Complex instruction set computing architecture for performing accurate quantum rotations with less magic
arXiv:1302.3240
Abstract
We present quantum protocols for executing arbitrarily accurate rotations of a qubit about its axis. Reduced instruction set computing (\textsc{risc}) architectures typically restrict the instruction set to stabilizer operations and a single non-stabilizer operation, such as preparation of a "magic" state from which gates can be teleported. Although the overhead required to distill high-fidelity copies of this magic state is high, the subsequent quantum compiling overhead to realize rotations in a \textsc{risc} architecture can be much greater. We develop a complex instruction set computing (\textsc{cisc}) architecture whose instruction set includes stabilizer operations and preparation of magic states from which gates can be teleported, for . This results in a substantial overall reduction in the number of gates required to achieve a desired gate accuracy for rotations. The key to our construction is a family of shortened quantum Reed-Muller codes of length , whose magic-state distillation threshold shrinks with but is greater than 0.85% for .
arXiv comment13 pages, 4 figures. Resource metric now non-Clifford states. Comparison now to Meier-Eastin-Knill distillation and (optimal) Selinger compiling. Minor tweaks made to concatenated teleportation analysis
References in corpus (28)
- Surface codes: Towards practical large-scale quantum computation
- Good Quantum Error-Correcting Codes Exist
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Algorithms Revisited
- Reliable Quantum Computers
- Topological fault-tolerance in cluster state quantum computation
- Robustness of adiabatic quantum computation
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- High threshold universal quantum computation on the surface code
- Restrictions on Transversal Encoded Quantum Gate Sets
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Adiabatic Quantum Computation in Open Systems
- Optimal discrimination of quantum operations
- Error correcting codes for adiabatic quantum computation
- Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates
- Improved magic states distillation for quantum universality
- Zeno effect for quantum computation and control
- Noise resistance of adiabatic quantum computation using random matrix theory
- Decoherence in adiabatic quantum computation
- A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
- Role of Single Qubit Decoherence Time in Adiabatic Quantum Computation
- Robustness of the adiabatic quantum search
- Non-Markovian decoherence in the adiabatic quantum search algorithm
- The quantum adiabatic search with decoherence in the instantaneous energy eigenbasis
- Effects of dissipation in an adiabatic quantum search algorithm
- Quantum Reed-Muller Codes
- The robustness of magic state distillation against errors in Clifford gates
Cited by in corpus (17)
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- On Optimality of CSS Codes for Transversal
- Reducing the quantum computing overhead with complex gate distillation
- Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
- Quantum computing by color-code lattice surgery
- New techniques for fault-tolerant decomposition of Multi-Controlled Toffoli gate
- Towers of generalized divisible quantum codes
- Logic Synthesis for Fault-Tolerant Quantum Computers
- Designing the Quantum Channels Induced by Diagonal Gates
- Quantum Pin Codes
- Mitigating Coherent Noise by Balancing Weight-2 -Stabilizers
- Distillation protocols for Fourier states in quantum computing
- Climbing the Diagonal Clifford Hierarchy
- Magic state distillation with punctured polar codes
- Resource optimization for fault-tolerant quantum computing
- Classical Coding Approaches to Quantum Applications
- Resource comparison of two surface code implementations of small angle Z rotations