Quantum computing by color-code lattice surgery
arXiv:1407.5103
Abstract
We demonstrate how to use lattice surgery to enact a universal set of fault-tolerant quantum operations with color codes. Along the way, we also improve existing surface-code lattice-surgery methods. Lattice-surgery methods use fewer qubits and the same time or less than associated defect-braiding methods. Furthermore, per code distance, color-code lattice surgery uses approximately half the qubits and the same time or less than surface-code lattice surgery. Color-code lattice surgery can also implement the Hadamard and phase gates in a single transversal step---much faster than surface-code lattice surgery can. Against uncorrelated circuit-level depolarizing noise, color-code lattice surgery uses fewer qubits to achieve the same degree of fault-tolerant error suppression as surface-code lattice surgery when the noise rate is low enough and the error suppression demand is high enough.
13 pages, 19 figures. Video of talk on paper at http://pirsa.org/14070006
References in corpus (22)
- Fault-tolerant quantum computation by anyons
- 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
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- A fault-tolerant one-way quantum computer
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Fast Decoders for Topological Quantum Codes
- Fault-tolerant quantum computation against biased noise
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- Fault-tolerant thresholds for quantum error correction with the surface code
- Decoding color codes by projection onto surface codes
- Efficient Decoders for Qudit Topological Codes
- 2-D color code quantum computation
- Approximation of real error channels by Clifford channels and Pauli measurements
- Simulation of rare events in quantum error correction
- Complex instruction set computing architecture for performing accurate quantum rotations with less magic
- Analytic asymptotic performance of topological codes
- Purifying Quantum States: Quantum and Classical Algorithms
Cited by in corpus (20)
- Roads towards fault-tolerant universal quantum computation
- Magic State Distillation: Not as Costly as You Think
- Single-shot fault-tolerant quantum error correction
- Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
- Encoding a magic state with beyond break-even fidelity
- The ZX calculus is a language for surface code lattice surgery
- Combining Topological Hardware and Topological Software: Color Code Quantum Computing with Topological Superconductor Networks
- Surface code compilation via edge-disjoint paths
- Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions
- Transversality and lattice surgery: exploring realistic routes towards coupled logical qubits with trapped-ion quantum processors
- Braiding by Majorana Tracking and Long-Range CNOT Gates with Color Codes
- Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
- Quantum computation from dynamic automorphism codes
- Noise Thresholds for the [[4, 2, 2]]-concatenated Toric Code
- High-Fidelity Magic-State Preparation with a Biased-Noise Architecture
- Fault-tolerant fermionic quantum computation based on color code
- Lattice Surgery on the Raussendorf Lattice
- Doubled Color Codes
- CSS code surgery as a universal construction
- Error correcting power of small topological codes