A bridge to lower overhead quantum computation

TL;DR

This paper introduces bridge compression, a technique that finds low-volume structures within the surface code to implement complex quantum computations efficiently, addressing key challenges in scalable quantum computing.

Contribution

The paper presents a novel bridge compression method that enables low-overhead implementation of complex quantum algorithms within the surface code framework.

Findings

Successfully finds low-volume structures for complex computations

Enhances practical feasibility of large-scale quantum computing

Addresses the challenge of implementing complex algorithms with minimal qubits

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.