New design cuts circuit depth for surface code quantum computing

Jahan Claes has developed encoding circuits that reduce the depth required to prepare encoded quantum states for the surface code. The work delivers circuits with depth d for distance-d surface codes, a reduction from the previously known depth of 2d. These inductively constructed circuits, proven to be optimal at depth d + O(1), offer a shortest-depth, locally connected encoding suitable for physical implementation on a square grid. This advancement addresses a key challenge in building quantum computers by simplifying the initial state preparation process.

Rotated Surface Code Encoding with Depth-d Circuits

This represents a significant reduction from the previously established standard of depth 2d for distance-d surface codes, streamlining a critical process in quantum computation. The new circuits achieve this encoding in depth d, directly scaling with the size of the encoded quantum information. Their circuit is constructed inductively from circuits that grow the code from d to (d+2). The circuits grow the code from an initial distance d to a distance of (d+2), a key step in scaling up quantum error correction.

The simplicity of the encoding circuit directly addresses a practical challenge in building quantum computers; it is locally connected and designed for easy physical implementation on a square grid. This architecture minimizes the complexity of qubit connectivity, a major hurdle in translating theoretical quantum algorithms into functioning hardware.

The surface code remains the most studied error-correcting code due to its high threshold, simplified decoding procedures and inherent suitability for two-dimensional layouts. Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill laid foundational work on topological quantum memory. The team’s approach is detailed in their recent publication in Quantum, furthering the open-access dissemination of quantum science. The new circuits are not merely theoretical constructs. They are designed with physical realizability in mind, offering a pathway to more efficient and scalable quantum computation.

Inductive Construction Proves Optimal Encoding Depth

The circuits are built using an inductive approach, progressively increasing the code’s distance from d to (d+2), and the team has mathematically proven this method approaches an optimal limit at depth d + O(1). For any error correcting code, one might want to start with an arbitrary physical state and inject it into the code. Fowler, Matteo Mariantoni, John M. Martinis and Andrew N.

More like this

Quantum EducationBonn physicists—Color meets Flavor—explain quantum states

Quantum PhysicsNew X-ray technique maps dopants in quantum silicon without damage

Quantum PhysicsNew asymmetry measure stays within the Gaussian quantum manifold

Quantum Error CorrectionCollege Park Team Cuts Simulation Costs up to 17x