Reducing the quantum computing overhead with complex gate distillation
arXiv:1403.5280 · doi:10.1103/PhysRevA.91.042315
Abstract
In leading fault-tolerant quantum computing schemes, accurate transformation are obtained by a two-stage process. In a first stage, a discrete, universal set of fault-tolerant operations is obtained by error-correcting noisy transformations and distilling resource states. In a second stage, arbitrary transformations are synthesized to desired accuracy by combining elements of this set into a circuit. Here, we present a scheme which merges these two stages into a single one, directly distilling complex transformations. We find that our scheme can reduce the total overhead to realize certain gates by up to a few orders of magnitude. In contrast to other schemes, this efficient gate synthesis does not require computationally intensive compilation algorithms, and a straightforward generalization of our scheme circumvents compilation and synthesis altogether.
9 pages, 5 figures
References in corpus (16)
- Quantum Teleportation is a Universal Computational Primitive
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Computing with Very Noisy Devices
- Reliable Quantum Computers
- Fault-tolerant quantum computation with high threshold in two dimensions
- Magic state distillation with low overhead
- A quantum information processor with trapped ions
- Resilient Quantum Computation: Error Models and Thresholds
- Gate count estimates for performing quantum chemistry on small quantum computers
- Simulating chemistry efficiently on fault-tolerant quantum computers
- Efficient synthesis of universal Repeat-Until-Success circuits
- Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
- Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics
- Clifford Gates by Code Deformation
- A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
- Complex instruction set computing architecture for performing accurate quantum rotations with less magic
Cited by in corpus (35)
- Majorana Zero Modes and Topological Quantum Computation
- Roads towards fault-tolerant universal quantum computation
- Toward the first quantum simulation with quantum speedup
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- A random compiler for fast Hamiltonian simulation
- Magic State Distillation: Not as Costly as You Think
- Quantum computation with realistic magic state factories
- Characterizing Universal Gate Sets via Dihedral Benchmarking
- A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
- Scalable randomized benchmarking of non-Clifford gates
- The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
- Codes and Protocols for Distilling , controlled-, and Toffoli Gates
- Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
- Efficient synthesis of probabilistic quantum circuits with fallback
- Error Rates and Resource Overheads of Repetition Cat Qubits
- Unifying gate-synthesis and magic state distillation
- T-count optimization and Reed-Muller codes
- Reducing the overhead for quantum computation when noise is biased
- Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
- An efficient magic state approach to small angle rotations
- Fast estimation of outcome probabilities for quantum circuits
- A practical phase gate for producing Bell violations in Majorana wires
- Robust Majorana magic gates via measurements
- Universal limitations on implementing resourceful unitary evolutions
- High-Fidelity Magic-State Preparation with a Biased-Noise Architecture
- Towers of generalized divisible quantum codes
- Fault-tolerant conversion between adjacent Reed-Muller quantum codes based on gauge fixing
- Code switching revisited: Low-overhead magic state preparation using color codes
- Magic state distillation with punctured polar codes
- Lower T-count with faster algorithms
- High-precision and low-depth quantum algorithm design for eigenstate problems
- Low Depth Phase Oracle Using a Parallel Piecewise Circuit
- Resource comparison of two surface code implementations of small angle Z rotations
- Efficient simulation of logical magic state preparation protocols
- Contributions to the Theory of Clifford-Cyclotomic Circuits