Tight Noise Thresholds for Quantum Computation with Perfect Stabilizer Operations
arXiv:0907.3189 · doi:10.1103/PhysRevLett.103.170504
Abstract
We study how much noise can be tolerated by a universal gate set before it loses its quantum-computational power. Specifically we look at circuits with perfect stabilizer operations in addition to imperfect non-stabilizer gates. We prove that for all unitary single-qubit gates there exists a tight depolarizing noise threshold that determines whether the gate enables universal quantum computation or if the gate can be simulated by a mixture of Clifford gates. This exact threshold is determined by the Clifford polytope spanned by the 24 single-qubit Clifford gates. The result is in contrast to the situation wherein non-stabilizer qubit states are used; the thresholds in that case are not currently known to be tight.
4 pages, 2 figures
References in corpus (3)
Cited by in corpus (16)
- Negative Quasi-Probability as a Resource for Quantum Computation
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Qudit versions of the qubit "pi-over-eight" gate
- Qutrit Magic State Distillation
- Catalysis and activation of magic states in fault tolerant architectures
- Bound States for Magic State Distillation in Fault-Tolerant Quantum Computation
- Experimental magic state distillation for fault-tolerant quantum computing
- Approximation of real error channels by Clifford channels and Pauli measurements
- Comparison of a quantum error correction threshold for exact and approximate errors
- The Power of Noisy Fermionic Quantum Computation
- Noise Thresholds for Higher Dimensional Systems using the Discrete Wigner Function
- Nonlocality as a Benchmark for Universal Quantum Computation in Ising Anyon Topological Quantum Computers
- Generalised state spaces and non-locality in fault tolerant quantum computing schemes
- Hybrid magic state distillation for universal fault-tolerant quantum computation
- Resource optimization for fault-tolerant quantum computing
- The Computational Power of Non-interacting Particles