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 (12)

• Surface codes: Towards practical large-scale quantum computation
• Efficient Distributed Quantum Computing
• Novel constructions for the fault-tolerant Toffoli gate
• Multilevel distillation of magic states for quantum computing
• Distilling one-qubit magic states into Toffoli states
• 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
• Distillation protocols for Fourier states in quantum computing
• Resource optimization for fault-tolerant quantum computing
• Resource comparison of two surface code implementations of small angle Z rotations
• Cross-level Validation of Topological Quantum Circuits
• Mapping of Topological Quantum Circuits to Physical Hardware