Efficient Magic State Distillation by Zero-Level Distillation

Abstract

Magic state distillation (MSD) is an essential element for universal fault-tolerant quantum computing, which distills a high-fidelity magic state from noisy magic states using ideal (error-corrected) Clifford operations. For ideal Clifford operations, it needs to be performed on the logical qubits and hence incurs a large spatiotemporal overhead, which is one of the major bottlenecks for the realization of fault-tolerant quantum computers (FTQCs). Here we propose zero-level distillation, which prepares a high-fidelity logical magic state at the physical level, namely zero level, using physical qubits and nearest-neighbor two-qubit gates on a square lattice. We develop a zero-level distillation circuit and show that distillation can be made even more efficient than the conventional sophisticated approaches with logical level distillations. The key idea involves the Knill et al.-type distillation using the Steane code and its careful mapping to the square-lattice architecture with error detection. The distilled magic state on the Steane-code state is then teleported or converted to surface codes. We numerically find that the error rate of the logical magic state scales as approximately $100\times p^2$ in terms of the physical error rate $p$. For example, with a physical error rate of $p=10^{-4}$ ($10^{-3}$), the logical error rate is reduced to $p_L=10^{-6}$ ($10^{-4}$), resulting in an improvement of 2 (1) orders of magnitude. This contributes to reducing both space and time overhead for early FTQC as well as full-fledged FTQC combined with conventional multilevel distillation protocols.

13 pages and 17 figures

References in corpus (19)

• Quantum Computing in the NISQ era and beyond
• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• Surface codes: Towards practical large-scale quantum computation
• Simulated Quantum Computation of Molecular Energies
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Restrictions on Transversal Encoded Quantum Gate Sets
• Stim: a fast stabilizer circuit simulator
• Qulacs: a fast and versatile quantum circuit simulator for research purpose
• Demonstration of fault-tolerant universal quantum gate operations
• Magic State Distillation: Not as Costly as You Think
• A Fault-Tolerant Honeycomb Memory
• Fault-tolerant magic state preparation with flag qubits
• On measurement-based quantum computation with the toric code states
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Fault-tolerant interface between quantum memories and quantum processors
• Beyond NISQ: The Megaquop Machine
• Fault-tolerant Quantum Error Correction on Near-term Quantum Processors using Flag and Bridge Qubits
• Simulation and performance analysis of quantum error correction with a rotated surface code under a realistic noise model

Cited by in corpus (11)

• Scaling and logic in the color code on a superconducting quantum processor
• Low-overhead magic state distillation with color codes
• Locality-aware Pauli-based computation for local magic state preparation
• Magic State Injection with Erasure Qubits
• From Magic State Distillation to Dynamical Systems
• Simulation of Shor algorithm for discrete logarithm problems with comprehensive pairs of modulo p and order q
• Entanglement boosting: Low-volume logical Bell pair preparation for distributed fault-tolerant quantum computation
• Catalytic $z$-rotations in constant $T$-depth
• Efficient simulation of logical magic state preparation protocols
• Power and limitations of distributed quantum state purification
• Clifford Transformations for Fermionic Quantum Systems: From Paulis to Majoranas to Fermions