The typical model for measurement noise in quantum error correction is to randomly flip the binary measurement outcome. In experiments, measurements yield much richer information - e.g., continuous current values, discrete photon counts - which is then mapped into binary outcomes by discarding some of this information. In this work, we consider methods to incorporate all of this richer information, typically called soft information, into the decoding of quantum error correction codes, and in particular the surface code. We describe how to modify both the Minimum Weight Perfect Matching and Union-Find decoders to leverage soft information, and demonstrate these soft decoders outperform the standard (hard) decoders that can only access the binary measurement outcomes. Moreover, we observe that the soft decoder achieves a threshold 25\% higher than any hard decoder for phenomenological noise with Gaussian soft measurement outcomes. We also introduce a soft measurement error model with amplitude damping, in which measurement time leads to a trade-off between measurement resolution and additional disturbance of the qubits. Under this model we observe that the performance of the surface code is very sensitive to the choice of the measurement time - for a distance-19 surface code, a five-fold increase in measurement time can lead to a thousand-fold increase in logical error rate. Moreover, the measurement time that minimizes the physical error rate is distinct from the one that minimizes the logical performance, pointing to the benefits of jointly optimizing the physical and quantum error correction layers.
The typical model for measurement noise in quantum error correction is to randomly flip the binary measurement outcome. In experiments, measurements yield much richer information - e.g., continuous current values, discrete photon counts - which is then mapped into binary outcomes by discarding some of this information. In this work, we consider methods to incorporate all of this richer information, typically called soft information, into the decoding of quantum error correction codes, and in particular the surface code. We describe how to modify both the Minimum Weight Perfect Matching and Union-Find decoders to leverage soft information, and demonstrate these soft decoders outperform the standard (hard) decoders that can only access the binary measurement outcomes. Moreover, we observe that the soft decoder achieves a threshold 25% higher than any hard decoder for phenomenological noise with Gaussian soft measurement outcomes. We also introduce a soft measurement error model with amplitude damping, in which measurement time leads to a trade-off between measurement resolution and additional disturbance of the qubits. Under this model we observe that the performance of the surface code is very sensitive to the choice of the measurement time - for a distance-19 surface code, a five-fold increase in measurement time can lead to a thousand-fold increase in logical error rate. Moreover, the measurement time that minimizes the physical error rate is distinct from the one that minimizes the logical performance, pointing to the benefits of jointly optimizing the physical and quantum error correction layers.
Quantum error correction allows for quantum information to be preserved using logical qubits, which are subject to lower error rates than their constituent physical qubits. The degree of error suppression depends on the choice of error correcting code and distance, the underlying physical error rate, and the accuracy of the decoder. While traditional decoders utilise a binary (hard) syndrome, recent work shows that additional (soft) information captured during qubit readout can be effectively utilised to improve decoding accuracy. In this work, we present experimental results from a distance-three surface code implemented on transmon qubits, where we perform Z-stabiliser measurements to protect the state of the logical qubit against bit-flip errors. We initialise the logical qubit in one of 16 possible computational states representing the logical zero state, and perform repeated stabiliser checks over a variable number of rounds to preserve the state over time. We compare the decoding performance for a hard minimum-weight perfect matching decoder against a soft variant where rich measurement information is incorporated, and demonstrate an improved logical fidelity. Additionally, we employ a recurrent neural network decoder with both soft and hard variants and observe improved performance when soft information is used. The general nature of soft information makes it widely applicable to different physical qubit platforms, where it can be leveraged to shorten measurement times and improve the logical fidelity in quantum error correction experiments. Pre-print available at arXiv:2403.00706.
Quantum error correction enables the preservation of logical qubits with a lower logical error rate than the physical error rate, with performance depending on the decoding method. Traditional decoding approaches rely on the binarization (“hardening”) of readout data, thereby ignoring valuable information embedded in the analog (“soft”) readout signal. We present experimental results showcasing the advantages of incorporating soft information into the decoding process of a distance-3 ( d = 3 ) bit-flip surface code with flux-tunable transmons. We encode each of the 16 computational states that make up the logical state | 0 L ⟩ , and protect them against bit-flip errors by performing repeated Z -basis stabilizer measurements. To infer the logical fidelity for the | 0 L ⟩ state, we average across the 16 computational states and employ two decoding strategies: minimum-weight perfect matching and a recurrent neural network. Our results show a reduction of up to 6.8% in the extracted logical error rate with the use of soft information. Decoding with soft information is widely applicable, independent of the physical qubit platform, and could allow for shorter readout durations, further minimizing logical error rates. Published by the American Physical Society 2024
Realizing the full potential of quantum computation requires quantum error correction (QEC), with most recent breakthrough demonstrations of QEC using the surface code.QEC codes use multiple noisy physical qubits to encode information in fewer logical qubits, enabling the identification of errors through a decoding process.This process increases the logical fidelity (or accuracy) making the computation more reliable.However, most fast (efficient run-time) decoders neglect important noise characteristics, thereby reducing their accuracy.In this work, we introduce decoders that are both fast and accurate, and can be used with a wide class of QEC codes including the surface code.Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC.Using the surface code threshold as a performance metric, we observe a threshold at 0.94% error probability for our decoders, outperforming the 0.82% threshold for a standard minimum-weight perfect matching decoder.We also test our belief-matching decoders in a theoretical case study of codes tailored to a biased noise model.We find that the decoders lead to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.Surprisingly, in the wellbelow-threshold regime, the rectangular surface code becomes more resource efficient than the tailored surface code due to a previously unnoticed phenomenon that we call "fragile boundaries."Our decoders outperform all other fast decoders in terms of threshold and accuracy, enabling better results in current quantum-error-correction experiments and opening up new areas for theoretical case studies.
Quantum error mitigation (QEM) is typically viewed as a suite of practical techniques for today's noisy intermediate-scale quantum devices, with limited relevance once fault-tolerant quantum computers become available. In this work, we challenge this conventional wisdom by showing that QEM can continue to provide substantial benefits in the era of quantum error correction (QEC), and in an even more efficient manner than it does on current devices. We introduce a framework for logical-level QEM that leverages soft information naturally produced by QEC decoders, requiring no additional data, hardware modifications, or runtime overhead beyond what QEC protocols already provide. Within this framework, we develop and analyze three logical-level QEM techniques: post-selection and runtime abort policies, probabilistic error cancellation, and zero-noise extrapolation. Our techniques reduce logical error rates by more than 100x while discarding fewer than 0.1% of shots; they also provide in situ characterization of logical channels for QEM protocols. As a proof of principle, we benchmark our approach using a surface-code architecture and two state-of-the-art decoders based on tensor-network contraction and minimum-weight perfect matching. We evaluate logical-level QEM on random Clifford circuits and molecular simulation algorithms and find that, compared to previous approaches relying on QEC only or QEC combined with QEM, we can achieve up to 87.4% spacetime overhead savings. Our results demonstrate that logical-level QEM with QEC decoder soft information can reliably improve logical performance, underscoring the efficiency and usefulness of QEM techniques for fault-tolerant quantum computers.
Quantum error correction promises a viable path to fault-tolerant computations, enabling exponential error suppression when the device's error rates remain below the protocol's threshold. However, this threshold strongly depends on the classical method used to decode the measurements of the syndrome. These classical algorithms traditionally only interpret binary data, ignoring valuable information contained in complete analog measurement data. We present the first large-scale experimental verification of soft decoding by implementing repetition codes up to distance 51 on superconducting hardware. Unlike previous demonstrations limited to small code distances, this extensive range allows us to confirm a fundamental improvement in the exponential scaling of error suppression rather than a mere constant-factor reduction in error rates. We observe a 25% increase in the threshold, which yields logical error rates up to 30 times lower than standard hard decoding. Analyzing the trade-off between information volume and decoding performance, we show that a single byte of information per measurement suffices to reach optimal decoding. This underscores the effectiveness and practicality of soft decoding on hardware, including in time-sensitive contexts such as real-time decoding.
As quantum computers remain susceptible to noise, QEC is essential for preserving logical information during computations. However, the performance of QEC codes breaks down beyond certain noise thresholds, revealing fundamental limits on their ability to protect quantum information. These limits can be characterized using information-theoretic measures such as the coherent information, which quantifies the maximum rate at which logical information can be reliably transmitted through a noisy quantum channel. In this work, we establish a direct connection between the CI and the binary cross-entropy loss used when training neural network decoders. Specifically, we show that the CI constitutes a sharp lower bound on the achievable loss for decoders that track logical operators across noisy channels. To this end, we develop a transformer-based neural network model based on maximum likelihood decoding. We train this network to estimate the CI and evaluate its performance on the surface code under three noise models: code capacity, phenomenological, and circuit-level noise. Our results demonstrate that the network accurately predicts CI and yields threshold estimates that closely match known theoretical limits. When used as a decoder, the network significantly outperforms the minimum weight perfect matching decoder in terms of logical error rate. We also introduce a novel soft post-selection scheme that independently treats uncertainty in both logical operators and relies on confidence-based filtering of the network's output. We prove that such post-selection strategies, based on the MLD cosets, are optimal, and demonstrate their scalability in terms of both logical error rate and abort probability. These findings establish transformer-based architectures as powerful tools for QEC and provide the first numerical evidence supporting the optimality and scalability of MLD-based post-selection.