MGT protocols encode the input into a measurement-heralded stabilizer code then apply a logical non-Clifford gate; useful resource states are Clifford-equivalent to diagonal states, and feedforward can often be Pauli.
Fault tolerant non-clifford state preparation for arbitrary rotations
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
abstract
Quantum error correction is an essential component for practical quantum computing on noisy quantum hardware. However, logical operations on error-corrected qubits require a significant resource overhead, especially for high-precision and high-fidelity non-Clifford rotation gates. To address this issue, we propose a postselection-based algorithm to efficiently prepare resource states for gate teleportation. Our algorithm achieves fault tolerance, demonstrating the exponential suppression of logical errors with code distance, and it applies to any stabilizer codes. We provide analytical derivations and numerical simulations of the fidelity and success probability of the algorithm. We benchmark the method on surface code and show a factor of 100 to 10,000 reduction in space-time overhead compared to existing methods. Overall, our approach presents a promising path to reducing the resource requirement for quantum algorithms on error-corrected and noisy intermediate-scale quantum computers.
fields
quant-ph 6representative citing papers
A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.
T-count minimization is cast as a binary search over continuous minimization problems, demonstrated numerically solvable for small-qubit circuits with reproduction of known results and extended via partitioning to larger circuits.
A deterministic recursive quantum circuit prepares antisymmetric states for η fermions in N orbitals with O(η²√N) T-gates and O(√N) dirty ancillas, outperforming sorting methods for η ≲ √N.
Resource estimation for magic-state distillation on silicon spin qubits finds 42% overhead reduction via optimized pulses and ~3x physical footprint reduction with biased codes versus surface code.
Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.
citing papers explorer
-
Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward
MGT protocols encode the input into a measurement-heralded stabilizer code then apply a logical non-Clifford gate; useful resource states are Clifford-equivalent to diagonal states, and feedforward can often be Pauli.
-
Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation
A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.
-
T Count as a Numerically Solvable Minimization Problem
T-count minimization is cast as a binary search over continuous minimization problems, demonstrated numerically solvable for small-qubit circuits with reproduction of known results and extended via partitioning to larger circuits.
-
Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping
A deterministic recursive quantum circuit prepares antisymmetric states for η fermions in N orbitals with O(η²√N) T-gates and O(√N) dirty ancillas, outperforming sorting methods for η ≲ √N.
-
Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits
Resource estimation for magic-state distillation on silicon spin qubits finds 42% overhead reduction via optimized pulses and ~3x physical footprint reduction with biased codes versus surface code.
-
Fire and ice: Partially fault-tolerant quantum computing with selective state filtering
Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.