Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code (2112.03708v1)

Published 7 Dec 2021 in quant-ph and cond-mat.mes-hall

Abstract: Quantum computers hold the promise of solving computational problems which are intractable using conventional methods. For fault-tolerant operation quantum computers must correct errors occurring due to unavoidable decoherence and limited control accuracy. Here, we demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors. Using 17 physical qubits in a superconducting circuit we encode quantum information in a distance-three logical qubit building up on recent distance-two error detection experiments. In an error correction cycle taking only $1.1\,\mu$s, we demonstrate the preservation of four cardinal states of the logical qubit. Repeatedly executing the cycle, we measure and decode both bit- and phase-flip error syndromes using a minimum-weight perfect-matching algorithm in an error-model-free approach and apply corrections in postprocessing. We find a low error probability of $3\,\%$ per cycle when rejecting experimental runs in which leakage is detected. The measured characteristics of our device agree well with a numerical model. Our demonstration of repeated, fast and high-performance quantum error correction cycles, together with recent advances in ion traps, support our understanding that fault-tolerant quantum computation will be practically realizable.

Citations (522)

Summary

  • The paper demonstrates repeated quantum error correction using a distance-three surface code on 17 superconducting qubits, achieving around 3% error per cycle.
  • The paper employs a pipelined protocol with controlled-phase gates and stabilizer measurements to efficiently detect and correct errors with a cycle time of 1.1 µs.
  • The paper validates theoretical predictions and outlines pathways for scaling fault-tolerant quantum computing through improved qubit coherence and real-time feedback.

Overview of "Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code"

The paper discusses an experimental demonstration of quantum error correction using a distance-three surface code implemented with superconducting qubits. The goal of the research is to tackle errors in quantum computation that result from decoherence and control inaccuracies, which are fundamental obstacles to achieving fault-tolerant quantum computing.

Implementation and Methodology

In their experimental setup, the authors employ 17 transmon qubits arranged in a square lattice diagram to form a distance-three surface code. This construction includes nine data qubits and eight auxiliary qubits. The auxiliary qubits serve the purpose of measuring the parity of neighboring data qubits to correct errors. The design is consistent with the planar realization of Kitaev's toric code, known for its resilience to noise, with an error threshold tolerance for quantum circuit noise.

The experimental protocol involves multiple time steps to perform controlled-phase (CZ) gates and stabilizer measurements, which are key components in detecting and correcting errors. The error correction cycles are executed in a pipelined manner to optimize performance and reduce cycle time. The authors achieve a cycle time of 1.1 µs and integrate a readout architecture that enables efficient detection of errors by distinguishing between computational qubit states and leakage states using three-state readouts.

Results and Analysis

The researchers demonstrate the preservation of cardinal states of a logical qubit across multiple error correction cycles. They report an error per cycle of about 3% when filtering out runs affected by detected qubit leakage events. This realization of quantum error correction using a surface code builds upon previous works with simpler codes and represents an important step toward practical implementations of fault-tolerant quantum computing.

They perform a detailed characterization of the prepared logical states by evaluating various fidelities with respect to target states, logical subspaces, and correctable errors. The paper shows that their sampling and decoding of stabilizers are consistent with theoretical predictions and corroborate simulations closely in terms of the errors per cycle.

Implications and Future Directions

This research demonstrates repeated, high-performance quantum error correction cycles, endorsing the practical realizability of fault-tolerant quantum computation. Future developments could focus on increasing efficiency through improvements in components' performance, such as coherence times and gate fidelities. Extending these methodologies to larger qubit systems may validate the scalability of this approach.

The authors discuss how future work should incorporate real-time decoding and feedback mechanisms as well as methods to manage leakage more effectively, with some potential solutions being explored, such as auxiliary qubit reset. Realizing these improvements could facilitate achieving the fault-tolerance necessary for quantum computation tasks unattainable by classical means.

This work is a stepping stone in proving the surface code's viability in a quantum error correction paradigm and driving advancements in scalable quantum computing, with broader implications for both theoretical research and practical applications within the field.

Youtube Logo Streamline Icon: https://streamlinehq.com