Code switching revisited: Low-overhead magic state preparation using color codes

Abstract

We propose a protocol to prepare a high-fidelity magic state on a two-dimensional (2D) color code using a three-dimensional (3D) color code. Our method modifies the known code switching protocol with (i) a recently discovered transversal gate between the 2D and the 3D code and (ii) a judicious use of flag-based postselection. We numerically demonstrate that these modifications lead to a significant improvement in the fidelity of the magic state. For instance, subjected to a uniform circuit-level noise of $10^{-3}$ (excluding idling noise), our code switching protocol yields a magic state encoded in the distance-$3$ 2D color code with a logical infidelity of $4.6\times 10^{-5}\pm 1.6\times 10^{-5}$ (quantified by an error-corrected logical state tomography) with an $84\%$ of acceptance rate. Used in conjunction with a postselection approach, extrapolation from a polynomial fit suggests a fidelity improvement to $5.1\times 10^{-7}$ for the same code. Our protocol is aimed for architectures that allow nonlocal connectivity and should be readily implementable in near-term devices. Finally, we also present a simulation technique akin to an extended stabilizer simulator which effectively incorporates the non-Clifford $T$-gate, that permits to simulate the protocol without resorting to a resource intensive state-vector simulation.

12 pages, 11 figures. v2: minor changes. v3: several changes have been made with respect to v2, including modifications of the text body, abstract, and Tables I and II, as well as the addition of Appendix A, Section IV C and Figure 10

References in corpus (36)

• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Superconducting Qubits: Current State of Play
• Trapped-Ion Quantum Computing: Progress and Challenges
• Logical quantum processor based on reconfigurable atom arrays
• Topological Quantum Distillation
• Restrictions on Transversal Encoded Quantum Gate Sets
• Stim: a fast stabilizer circuit simulator
• Magic state distillation with low overhead
• Methodology for quantum logic gate constructions
• Demonstration of fault-tolerant universal quantum gate operations
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Halving the cost of quantum addition
• Quantum computing enhanced computational catalysis
• Quantum error correction with only two extra qubits
• Magic State Distillation: Not as Costly as You Think
• Novel constructions for the fault-tolerant Toffoli gate
• Topological Computation without Braiding
• Quantum computation with realistic magic state factories
• Classification of topologically protected gates for local stabilizer codes
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• Fault-tolerant quantum computation with few qubits
• Multilevel distillation of magic states for quantum computing
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• Surface code implementation of block code state distillation
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• A magic state's fidelity can be superior to the operations that created it
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Fault-tolerant quantum error correction for Steane's seven-qubit color code with few or no extra qubits
• A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
• Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer
• Reducing the quantum computing overhead with complex gate distillation
• Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors
• Code conversion with the quantum Golay code for a universal transversal gate set

Cited by in corpus (5)

• Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching
• From Magic State Distillation to Dynamical Systems
• Efficient simulation of logical magic state preparation protocols
• Catalytic $z$-rotations in constant $T$-depth
• Clifford Transformations for Fermionic Quantum Systems: From Paulis to Majoranas to Fermions