A bridge to lower overhead quantum computation

Abstract

Two primary challenges stand in the way of practical large-scale quantum computation, namely achieving sufficiently low error rate quantum gates and implementing interesting quantum algorithms with a physically reasonable number of qubits. In this work we address the second challenge, presenting a new technique, bridge compression, which enables remarkably low volume structures to be found that implement complex computations in the surface code. The surface code has a number of highly desirable properties, including the ability to achieve arbitrarily reliable computation given sufficient qubits and quantum gate error rates below approximately 1%, and the use of only a 2-D array of qubits with nearest neighbor interactions. As such, our compression technique is of great practical relevance.

17 pages, 71 figures, formal proof of methodology added

Cited by in corpus (34)

• Surface codes: Towards practical large-scale quantum computation
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• The Future of Quantum Computing with Superconducting Qubits
• Automated optimization of large quantum circuits with continuous parameters
• Efficient Distributed Quantum Computing
• Novel constructions for the fault-tolerant Toffoli gate
• Local and Distributed Quantum Computation
• Multilevel distillation of magic states for quantum computing
• Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
• Surface code implementation of block code state distillation
• Requirements for fault-tolerant factoring on an atom-optics quantum computer
• Optimized Surface Code Communication in Superconducting Quantum Computers
• Distilling one-qubit magic states into Toffoli states
• Synthesis of Arbitrary Quantum Circuits to Topological Assembly
• Composite Toffoli gate with two-round error detection
• Inplace Access to the Surface Code Y Basis
• Quantum circuit optimization by topological compaction in the surface code
• Simulating the Transverse Ising Model on a Quantum Computer: Error Correction with the Surface Code
• Logic Synthesis for Fault-Tolerant Quantum Computers
• Exponentially faster implementations of Select(H) for fermionic Hamiltonians
• Distillation protocols for Fourier states in quantum computing
• SurfBraid: A concept tool for preparing and resource estimating quantum circuits protected by the surface code
• Hardness of braided quantum circuit optimization in the surface code
• Resource optimization for fault-tolerant quantum computing
• Distributed Quantum Computing Utilizing Multiple Codes on Imperfect Hardware
• Resource comparison of two surface code implementations of small angle Z rotations
• Cross-level Validation of Topological Quantum Circuits
• Quantum Theory from Principles, Quantum Software from Diagrams
• String Diagrams for Defect-Based Surface Code Computing
• Really Small Shoe Boxes - On Realistic Quantum Resource Estimation
• Programming a Topological Quantum Computer
• Controlling distilleries in fault-tolerant quantum circuits: problem statement and analysis towards a solution
• Programming quantum computers using 3-D puzzles, coffee cups, and doughnuts
• Mapping of Topological Quantum Circuits to Physical Hardware