Improved magic states distillation for quantum universality

Abstract

Given stabilizer operations and the ability to repeatedly prepare a single-qubit mixed state rho, can we do universal quantum computation? As motivation for this question, "magic state" distillation procedures can reduce the general fault-tolerance problem to that of performing fault-tolerant stabilizer circuits. We improve the procedures of Bravyi and Kitaev in the Hadamard "magic" direction of the Bloch sphere to achieve a sharp threshold between those rho allowing universal quantum computation, and those for which any calculation can be efficiently classically simulated. As a corollary, the ability to repeatedly prepare any pure state which is not a stabilizer state (e.g., any single-qubit pure state which is not a Pauli eigenstate), together with stabilizer operations, gives quantum universality. It remains open whether there is also a tight separation in the so-called T direction.

6 pages, 5 figures

References in corpus (8)

• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum Computing with Very Noisy Devices
• Resilient Quantum Computation: Error Models and Thresholds
• How robust is a quantum gate in the presence of noise?
• Both Toffoli and Controlled-NOT need little help to do universal quantum computation
• Fault-Tolerant Postselected Quantum Computation: Schemes
• Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
• Classical simulatability, entanglement breaking, and quantum computation thresholds

Cited by in corpus (87)

• Quantum Error Correction for Quantum Memories
• Quantum Resource Theories
• The Resource Theory of Stabilizer Computation
• High threshold universal quantum computation on the surface code
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Negative Quasi-Probability as a Resource for Quantum Computation
• Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States
• Magic state distillation with low overhead
• Entanglement purification and quantum error correction
• Convex resource theory of non-Gaussianity
• Enhanced fault-tolerant quantum computing in $d$-level systems
• All-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Multilevel distillation of magic states for quantum computing
• Quantifying magic for multi-qubit operations
• Qudit versions of the qubit "pi-over-eight" gate
• Qutrit Magic State Distillation
• Surface code implementation of block code state distillation
• Catalysis and activation of magic states in fault tolerant architectures
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Bound States for Magic State Distillation in Fault-Tolerant Quantum Computation
• Efficient Decomposition of Single-Qubit Gates into $V$ Basis Circuits
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
• Fault-Tolerant Operation of a Quantum Error-Correction Code
• 2-D color code quantum computation
• Building a large-scale quantum computer with continuous-variable optical technologies
• Distilling one-qubit magic states into Toffoli states
• Cost-Reduced All-Gaussian Universality with the Gottesman-Kitaev-Preskill Code: Resource-Theoretic Approach to Cost Analysis
• Scaling and logic in the color code on a superconducting quantum processor
• The Power of Noisy Fermionic Quantum Computation
• Qutrit Magic State Distillation Tight in Some Directions
• Noise Thresholds for Higher Dimensional Systems using the Discrete Wigner Function
• Classical Processing Requirements for a Topological Quantum Computing System
• Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic
• Tight Noise Thresholds for Quantum Computation with Perfect Stabilizer Operations
• Non-Clifford gate on optical qubits by nonlinear feedforward
• Qutrit and Ququint Magic States
• Quantum Computation with Topological Codes: from qubit to topological fault-tolerance
• Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization
• High-Fidelity Magic-State Preparation with a Biased-Noise Architecture
• Quantifying dynamical magic with completely stabilizer preserving operations as free
• Simulating the Transverse Ising Model on a Quantum Computer: Error Correction with the Surface Code
• Magic State Distillation with the Ternary Golay Code
• Streamlined quantum computing with macronode cluster states
• Cluster-based architecture for fault-tolerant quantum computation
• Fault-tolerant Holonomic Quantum Computation in Surface Codes
• Error rates and resource overheads of encoded three-qubit gates
• Towers of generalized divisible quantum codes
• Magic informationally complete POVMs with permutations
• Logic Synthesis for Fault-Tolerant Quantum Computers
• Designing the Quantum Channels Induced by Diagonal Gates
• The magic of universal quantum computing with permutations
• Mitigating Coherent Noise by Balancing Weight-2 $Z$-Stabilizers
• Spin squeezed GKP codes for quantum error correction in atomic ensembles
• The vacuum provides quantum advantage to otherwise simulatable architectures
• Measurement-free fault-tolerant logical zero-state encoding of the distance-three nine-qubit surface code in a one-dimensional qubit array
• Generalised state spaces and non-locality in fault tolerant quantum computing schemes
• Interplay of entanglement structures and stabilizer entropy in spin models
• Sufficient condition for universal quantum computation using bosonic circuits
• Contextual bound states for qudit magic state distillation
• Fault-tolerant conversion between adjacent Reed-Muller quantum codes based on gauge fixing
• Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers
• Low-overhead magic state distillation with color codes
• Fault-tolerant quantum speedup from constant depth quantum circuits
• Climbing the Diagonal Clifford Hierarchy
• Magic state distillation with punctured polar codes
• Hybrid magic state distillation for universal fault-tolerant quantum computation
• Efficient fault-tolerant code switching via one-way transversal CNOT gates
• Small Codes for Magic State Distillation
• Auxiliary-assisted energy distillation from quantum batteries
• On the Power of Reusable Magic States
• Transversal Clifford and T-gate codes of short length and high distance
• Postselection threshold against biased noise
• Computational quantum-classical boundary of complex and noisy quantum systems
• Wigner's Theorem for stabilizer states and quantum designs
• On the Structure of Protocols for Magic State Distillation
• Signed quantum weight enumerators characterize qubit magic state distillation
• Analyzing the free states of one quantum resource theory as resource states of another
• Resource comparison of two surface code implementations of small angle Z rotations
• From Magic State Distillation to Dynamical Systems
• Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
• Positive and non-positive measurements in energy distillation from quantum batteries
• General entropic constraints on CSS codes within magic distillation protocols
• The robustness of magic state distillation against errors in Clifford gates
• Quantum Computation and Communication in Bosonic Systems
• Optical Quantum Computing