Resource comparison of two surface code implementations of small angle Z rotations
arXiv:1406.4948
Abstract
Fault-tolerant Z rotations by pi/2^k are important as they arise in numerous quantum algorithms, most notably those involving quantum Fourier transforms. We describe surface code implementations of two recently described methods of efficiently constructing these rotations. One method uses state distillation to get low-error (|0> + exp(i pi/2^k)|1>)/sqrt(2) states, with each distillation level requiring 2^(k+2)-1 input states to produce a single purer output state, and uses these distilled states to directly implement pi/2^k angle Z rotations. The other method is indirect, using sequences of single-qubit Clifford and T gates. We compute and compare the overhead of our surface code implementations of these two techniques. We find that the approximating sequence overhead is less than or equal to direct distillation for k > 3 and logical error rates <~ 10^-12.
16 pages, 13 figures
References in corpus (26)
- Surface codes: Towards practical large-scale quantum computation
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Computing with Very Noisy Devices
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological Quantum Distillation
- Topological fault-tolerance in cluster state quantum computation
- Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
- Quantum codes on a lattice with boundary
- Quantum computing with nearest neighbor interactions and error rates over 1%
- Magic state distillation with low overhead
- Efficient synthesis of universal Repeat-Until-Success circuits
- Improved magic states distillation for quantum universality
- Multilevel distillation of magic states for quantum computing
- Topological Subsystem Codes
- Clifford Gates by Code Deformation
- Efficient Decomposition of Single-Qubit Gates into Basis Circuits
- 2-D color code quantum computation
- A bridge to lower overhead quantum computation
- Reducing the quantum computing overhead with complex gate distillation
- Accuracy thresholds of topological color codes on the hexagonal and square-octagonal lattices
- Optimal complexity correction of correlated errors in the surface code
- Topological color codes on Union Jack lattices: A stable implementation of the whole Clifford group
- Complex instruction set computing architecture for performing accurate quantum rotations with less magic
- Topological One-Way Quantum Computation on Verified Logical Cluster States
- Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries