A fault-tolerant non-Clifford gate for the surface code in two dimensions
arXiv:1903.11634 · doi:10.1126/sciadv.aay4929
Abstract
Fault-tolerant logic gates will consume a large proportion of the resources of a two-dimensional quantum computing architecture. Here we show how to perform a fault-tolerant non-Clifford gate with the surface code; a quantum error-correcting code now under intensive development. This alleviates the need for distillation or higher-dimensional components to complete a universal gate set. The operation uses both local transversal gates and code deformations over a time that scales with the size of the qubit array. An important component of the gate is a just-in-time decoder. These decoding algorithms allow us to draw upon the advantages of three-dimensional models using only a two-dimensional array of live qubits. Our gate is completed using parity checks of weight no greater than four. We therefore expect it to be amenable with near-future technology. As the gate circumvents the need for magic-state distillation, it may reduce the resource overhead of surface-code quantum computation considerably.
arXiv comment17 pages, 10 figures, comments welcome; v2 - final author version. Final version includes more details on resource overheads and a discussion on gauge prefixing with the color code
References in corpus (36)
- Fault-tolerant quantum computation by anyons
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Error Correction for Quantum Memories
- State preservation by repetitive error detection in a superconducting quantum circuit
- Fault-tolerant quantum computation with high threshold in two dimensions
- Efficient high-fidelity quantum computation using matter qubits and linear optics
- Roads towards fault-tolerant universal quantum computation
- Surface code quantum computing by lattice surgery
- Restrictions on Transversal Encoded Quantum Gate Sets
- Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
- Universal fault-tolerant quantum computation with only transversal gates and error correction
- Quantum memories at finite temperature
- Long-range quantum entanglement in noisy cluster states
- Demonstration of weight-four parity measurements in the surface code architecture
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- Fault tolerant quantum computation with very high threshold for loss errors
- Quantum computation with realistic magic state factories
- Classification of topologically protected gates for local stabilizer codes
- Unfolding the color code
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- Foliated Quantum Codes
- Fault-tolerant logical gates in quantum error-correcting codes
- Fault-tolerant error correction with the gauge color code
- String and Membrane condensation on 3D lattices
- Decoding color codes by projection onto surface codes
- Topological color code and symmetry-protected topological phases
- The disjointness of stabilizer codes and limitations on fault-tolerant logical gates
- Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
- Locality-Preserving Logical Operators in Topological Stabiliser Codes
- Gauge color codes in two dimensions
- 2D quantum computation with 3D topological codes
- Universal fault-tolerant quantum computation with Bacon-Shor codes
- Doubled Color Codes
- Transversal gates and error propagation in 3D topological codes
Cited by in corpus (56)
- Logical quantum processor based on reconfigurable atom arrays
- The Future of Quantum Computing with Superconducting Qubits
- Magic State Distillation: Not as Costly as You Think
- Focus beyond quadratic speedups for error-corrected quantum advantage
- Encoding a magic state with beyond break-even fidelity
- Conformal field theories are magical
- Biology and medicine in the landscape of quantum advantages
- The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
- High threshold codes for neutral atom qubits with biased erasure errors
- Quantum coding with low-depth random circuits
- Anyon condensation and the color code
- Error Rates and Resource Overheads of Repetition Cat Qubits
- Limitations in quantum computing from resource constraints
- High-threshold quantum computing by fusing one-dimensional cluster states
- Topological Order, Quantum Codes and Quantum Computation on Fractal Geometries
- Pauli topological subsystem codes from Abelian anyon theories
- Universal fault-tolerant measurement-based quantum computation
- Fault-Tolerant Quantum Gates with Defects in Topological Stabiliser Codes
- Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding
- Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
- Optimal Universal Quantum Error Correction via Bounded Reference Frames
- Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
- Creating entangled logical qubits in the heavy-hex lattice with topological codes
- Quantum computation from dynamic automorphism codes
- A "thoughtful" Local Friendliness no-go theorem: a prospective experiment with new assumptions to suit
- Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
- Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device
- Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
- Tailoring three-dimensional topological codes for biased noise
- Magic State Distillation from Entangled States
- Computing data for Levin-Wen with defects
- Long-range-enhanced surface codes
- Quantum error correction with fractal topological codes
- Error correction of transversal CNOT gates for scalable surface code computation
- Nonlocal discrete time crystals in periodically driven surface codes
- Non-Pauli topological stabilizer codes from twisted quantum doubles
- Limitations on transversal gates for hypergraph product codes
- Non-Pauli Errors in the Three-Dimensional Surface Code
- Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases
- A new twist on the Majorana surface code: Bosonic and fermionic defects for fault-tolerant quantum computation
- Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
- Braiding defects in topological stabiliser codes of any dimension cannot be universal
- Characterization of errors in a CNOT between surface code patches
- Lattice surgery-based logical state teleportation via noisy links
- Single-shot preparation of hypergraph product codes via dimension jump
- Non-Abelian Self-Correcting Quantum Memory and Transversal Non-Clifford Gate beyond the Distance Barrier
- Color codes with twists: construction and universal gate set implementation
- Finding the disjointness of stabilizer codes is NP-complete
- Optimal number of stabilizer measurement rounds in an idling surface code patch
- Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
- Intrinsic Heralding and Optimal Decoders for Non-Abelian Topological Order
- Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
- Quantum repetition codes as building blocks of large period discrete time crystals
- Universal fault tolerant quantum computation in 2D without getting tied in knots
- Color code with a logical control- gate using transversal rotations
- Offloading Quantum Computation by Superposition Masking