Towards low overhead magic state distillation
arXiv:1811.08461 · doi:10.1103/PhysRevLett.123.070507
Abstract
Magic state distillation is a resource intensive sub-routine for quantum computation. The ratio of noisy input states to output states with error rate at most scales as (Bravyi and Haah, PRA 2012). In a breakthrough paper, Hastings and Haah (PRL 2018) showed that it is possible to construct distillation routines with sub-logarithmic overhead, achieving and falsifying a conjecture that is lower bounded by . They then ask whether can be made arbitrarily close to . We answer this question in the affirmative for magic state distillation routines using qudits ( dimensional quantum systems).
arXiv comment4 + 3 pages, comments welcome
References in corpus (13)
- Quantum Teleportation is a Universal Computational Primitive
- Stabilizer Codes and Quantum Error Correction
- Magic state distillation with low overhead
- Enhanced fault-tolerant quantum computing in -level systems
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Quantum computation with realistic magic state factories
- Multilevel distillation of magic states for quantum computing
- Qudit versions of the qubit "pi-over-eight" gate
- Qutrit Magic State Distillation
- Codes and Protocols for Distilling , controlled-, and Toffoli Gates
- Diagonal gates in the Clifford hierarchy
- Distillation with sublogarithmic overhead
- Higher Weights of Affine Grassmann Codes and Their Duals
Cited by in corpus (38)
- Ultracold polar molecules as qudits
- Quantifying the magic of quantum channels
- Quantifying magic for multi-qubit operations
- Experimental high-dimensional Greenberger-Horne-Zeilinger entanglement with superconducting transmon qutrits
- No-Go Theorems for Quantum Resource Purification
- Efficiently computable bounds for magic state distillation
- Implementation of a Walsh-Hadamard gate in a superconducting qutrit
- Molecular Asymmetry and Optical Cycling: Laser Cooling Asymmetric Top Molecules
- Arithmetic Circuits for Multilevel Qudits Based on Quantum Fourier Transform
- Characterization of Control in a Superconducting Qutrit Using Randomized Benchmarking
- Pseudomagic Quantum States
- Lower bound for the T count via unitary stabilizer nullity
- Characterization of an operational quantum resource in a critical many-body system
- Morphing quantum codes
- Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
- Constraints on magic state protocols from the statistical mechanics of Wigner negativity
- Quantifying dynamical magic with completely stabilizer preserving operations as free
- Spectral Properties Versus Magic Generation in -doped Random Clifford Circuits
- The -qutrit, a two-mode bosonic qutrit
- Designing the Quantum Channels Induced by Diagonal Gates
- Mitigating Coherent Noise by Balancing Weight-2 -Stabilizers
- Certifying dimension of quantum systems by sequential projective measurements
- Climbing the Diagonal Clifford Hierarchy
- The qudit Pauli group: non-commuting pairs, non-commuting sets, and structure theorems
- Magic state distillation with punctured polar codes
- Counting stabiliser codes for arbitrary dimension
- Scaling W state circuits in the qudit Clifford hierarchy
- Rescaling decoder for 2D topological quantum color codes on 4.8.8 lattices
- Rigorous noise reduction with quantum autoencoders
- From Magic State Distillation to Dynamical Systems
- Low Overhead Qutrit Magic State Distillation
- Characterization of multi-level dynamics and decoherence in a high-anharmonicity capacitively shunted flux circuit
- Composability of global phase invariant distance and its application to approximation error management
- Experimental Approach to Demonstrating Contextuality for Qudits
- Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
- Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
- Scalable platform for qudit-based quantum computing using polar molecules
- Adaptively secure unitary designs with constant non-Clifford cost