A magic state's fidelity can be superior to the operations that created it

Abstract

The leading approach to fault tolerant quantum computing requires a continual supply of magic states. When a new magic state is first encoded, its initial fidelity will be too poor for use in the computation. This necessitates a resource-intensive distillation process that occupies the majority of the computer's hardware; creating magic states with a high initial fidelity minimises this cost and is therefore crucial for practical quantum computing. Here we present the surprising and encouraging result that raw magic states can have a fidelity significantly better than that of the two-qubit gate operations used to construct them. Our protocol exploits post-selection without significantly slowing the rate of generation and tolerates finite error rates in initialisations, measurements and single-qubit gates. This approach may dramatically reduce the size of the hardware needed for a given quantum computing task.

5 pages, 4 figures

References in corpus (8)

• Surface codes: Towards practical large-scale quantum computation
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological fault-tolerance in cluster state quantum computation
• Restrictions on Transversal Encoded Quantum Gate Sets
• Magic state distillation with low overhead
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Multilevel distillation of magic states for quantum computing

Cited by in corpus (35)

• The Future of Quantum Computing with Superconducting Qubits
• Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays
• Encoding a magic state with beyond break-even fidelity
• Logical blocks for fault-tolerant topological quantum computation
• Optimized compiler for Distributed Quantum Computing
• Scaling and logic in the color code on a superconducting quantum processor
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
• Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling
• Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
• Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation
• Mitigating errors in logical qubits
• TISCC: A Surface Code Compiler and Resource Estimator for Trapped-Ion Processors
• Fault-tolerant quantum speedup from constant depth quantum circuits
• Code switching revisited: Low-overhead magic state preparation using color codes
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution
• Almost fault-tolerant quantum machine learning with drastic overhead reduction
• Constant Overhead Entanglement Distillation via Scrambling
• Logical entanglement distribution between distant 2D array qubits
• Magic State Injection with Erasure Qubits
• Prospects for NMR Spectral Prediction on Fault-Tolerant Quantum Computers
• Low-density parity-check representation of fault-tolerant quantum circuits
• Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
• From Magic State Distillation to Dynamical Systems
• Noise-Agnostic Unbiased Quantum Error Mitigation for Logical Qubits
• High-fidelity initialization a logical qubit with multiple injections
• Error-mitigated initialization of surface codes with non-Pauli stabilizers
• Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
• Fault-tolerant interfaces for modular quantum computing on diverse qubit platforms
• Entanglement boosting: Low-volume logical Bell pair preparation for distributed fault-tolerant quantum computation
• Efficient simulation of logical magic state preparation protocols
• Quantum-Processing-Assisted Classical Communications
• iSwitch: QEC on Demand via In-Situ Encoding of Bare Qubits for Ion Trap Architectures
• Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes
• Scalable and fault-tolerant preparation of encoded k-uniform states