Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2204.13834 · Quantum

Stability Experiments: The Overlooked Dual of Memory Experiments

Craig Gidney

Published Aug 24, 2022• 47 citations
arXivHTMLPDF

Abstract

Topological quantum computations are built on a foundation of two basic tasks: preserving logical observables through time and moving logical observables through space. Memory experiments, which check how well logical observables are preserved through time, are a well established benchmark. Strangely, there is no corresponding well established benchmark for moving logical observables through space. This paper tries to fill that gap with "stability experiments", which check how well a quantum error correction system can determine the product of a large region of stabilizers. Stability experiments achieve this by testing on a region that is locally a normal code but globally has a known product of stabilizers.

DOI
10.22331/q-2022-08-24-786

Related papers

Locality-preserving logical operators in topological stabilizer codes

Paul Webster, Stephen D. Bartlett

Locality-preserving logical operators in topological codes are naturally fault tolerant, since they preserve the correctability of local errors. Using a correspondence between such operators and gapped domain walls, we describe a procedure for finding all locality-preserving logical operators admitted by a large and important class of topological stabilizer codes. In particular, we focus on those equivalent to a stack of a finite number of surface codes of any spatial dimension, where our procedure fully specifies the group of locality-preserving logical operators. We also present examples of how our procedure applies to codes with different boundary conditions, including color codes and toric codes, as well as more general codes such as Abelian quantum double models and codes with fermionic excitations in more than two dimensions.

arXiv:1709.00020•Physical Review A•Jan 24, 2018•41 citations

Advancing Quantum Reliability: A Study on Topological Codes and Stabilizer Techniques for Scalable Error Correction

Krishna Kumar

Quantum computing stands at the precipice of revolutionizing numerous fields, yet its widespread practical application is obstructed by high error rates, far exceeding those encountered in classical computing. For quantum computers to become viable, these error rates must be significantly reduced, which is a critical challenge in the field. This paper explores the evolving landscape of quantum error correction, focusing on the topological code as a leading strategy for improving the fidelity of quantum computations. topological codes utilize a two-dimensional array of qubits and stabilizer operations to detect and correct quantum errors, offering robust scalability for large-scale quantum systems. The theoretical foundations of topological codes are examined along with their implementation challenges and recent advancements in decoding algorithms. Additionally, stabilizer codes are analyzed and their synergistic role in enhancing quantum error correction schemes. By addressing both theoretical concepts and practical considerations, this study provides insights into overcoming quantum error correction obstacles, moving closer to reliable, fault-tolerant quantum computing systems. The paper also highlights emerging techniques that may shape the future of quantum computing reliability.

International Conference on Computing Technologies (ICOCT)•Jun 13, 2025•2 citations

Checking the error correction strength of arbitrary surface code logical gates

Thomas J. Milburn, Austin G. Fowler

Topologically quantum error corrected logical gates are complex. Chains of errors can form in space and time and diagonally in spacetime. It is highly nontrivial to determine whether a given logical gate is free of low weight combinations of errors leading to failure. We report a new tool Nestcheck capable of analyzing an arbitrary topological computation and determining the minimum number of errors required to cause failure.

arXiv:1210.4249•Oct 16, 2012•2 citations

Perturbative Stability and Error-Correction Thresholds of Quantum Codes

Yaodong Li, Nicholas O’Dea, Vedika Khemani

Topologically ordered phases are stable to local perturbations, and topological quantum error-correcting codes enjoy thresholds to local errors. We connect the two notions of stability by constructing classical statistical mechanics models for decoding general Calderbank-Shor-Steane codes and classical linear codes. Our construction encodes correction success probabilities under uncorrelated bit-flip and phase-flip errors, and simultaneously describes a generalized Z 2 lattice-gauge theory with quenched disorder. We observe that the clean limit of the latter is precisely the imaginary-time path integral of the corresponding quantum code Hamiltonian when the errors are turned into a perturbative X or Z magnetic field. Motivated by error-correction considerations, we define general order parameters for all such generalized Z 2 lattice-gauge theories, and show that they are generally lower bounded by success probabilities of error correction. For CSS codes satisfying the low-density parity-check condition and with a sufficiently large code distance, we prove the existence of a low-temperature ordered phase of the corresponding lattice-gauge theories, particularly for those lacking Euclidean spatial locality and/or when there is a nonzero code rate. We further argue that these results provide evidence for stable phases in the corresponding perturbed quantum Hamiltonians, obtained in the limit of continuous imaginary time. To do so, we distinguish space- and timelike defects in the lattice-gauge theory. A high free-energy cost of spacelike defects corresponds to a successful “memory experiment” and suppresses the energy splitting among the ground states, while a high free-energy cost of timelike defects corresponds to a successful “stability experiment” and points to a nonzero gap to local excitations.

arXiv:2406.15757•PRX Quantum•Feb 10, 2025•19 citations

Quantum error correction for quantum memories

Barbara M. Terhal

It may seem inevitable that highly entangled quantum states are susceptible to disturbance through interaction with a decohering environment. However, certain multiqubit entangled states are well protected from common forms of decoherence as the quantum information is hidden in inherently nonlocal degrees of freedom. This review shows that this robustness is enabled by specific measurements on subsets of qubits, implementing a quantum version of an error correction process. Beginning with the basics, the latest understanding of the relation between this form of error correction and the concept of two-dimensional topological order in many-body physics is reviewed.

arXiv:1302.3428•Reviews of Modern Physics•Apr 7, 2015•1,512 citations

Stabilizer Codes and Quantum Error Correction

Daniel Gottesman

Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.

arXiv:quant-ph/9705052•May 28, 1997•2,856 citations
Topological quantum computations are built on a foundation of two basic tasks: preserving logical observables through time and moving logical observables through space. Memory experiments, which check how well logical observables are preserved through time, are a well established benchmark. Strangely, there is no corresponding well established benchmark for moving logical observables through space. This paper tries to fill that gap with "stability experiments", which check how well a quantum error correction system can determine the product of a large region of stabilizers. Stability experiments achieve this by testing on a region that is locally a normal code but globally has a known product of stabilizers.
Locality-preserving logical operators in topological codes are naturally fault tolerant, since they preserve the correctability of local errors. Using a correspondence between such operators and gapped domain walls, we describe a procedure for finding all locality-preserving logical operators admitted by a large and important class of topological stabilizer codes. In particular, we focus on those equivalent to a stack of a finite number of surface codes of any spatial dimension, where our procedure fully specifies the group of locality-preserving logical operators. We also present examples of how our procedure applies to codes with different boundary conditions, including color codes and toric codes, as well as more general codes such as Abelian quantum double models and codes with fermionic excitations in more than two dimensions.
Quantum computing stands at the precipice of revolutionizing numerous fields, yet its widespread practical application is obstructed by high error rates, far exceeding those encountered in classical computing. For quantum computers to become viable, these error rates must be significantly reduced, which is a critical challenge in the field. This paper explores the evolving landscape of quantum error correction, focusing on the topological code as a leading strategy for improving the fidelity of quantum computations. topological codes utilize a two-dimensional array of qubits and stabilizer operations to detect and correct quantum errors, offering robust scalability for large-scale quantum systems. The theoretical foundations of topological codes are examined along with their implementation challenges and recent advancements in decoding algorithms. Additionally, stabilizer codes are analyzed and their synergistic role in enhancing quantum error correction schemes. By addressing both theoretical concepts and practical considerations, this study provides insights into overcoming quantum error correction obstacles, moving closer to reliable, fault-tolerant quantum computing systems. The paper also highlights emerging techniques that may shape the future of quantum computing reliability.
Topologically ordered phases are stable to local perturbations, and topological quantum error-correcting codes enjoy thresholds to local errors. We connect the two notions of stability by constructing classical statistical mechanics models for decoding general Calderbank-Shor-Steane codes and classical linear codes. Our construction encodes correction success probabilities under uncorrelated bit-flip and phase-flip errors, and simultaneously describes a generalized Z 2 lattice-gauge theory with quenched disorder. We observe that the clean limit of the latter is precisely the imaginary-time path integral of the corresponding quantum code Hamiltonian when the errors are turned into a perturbative X or Z magnetic field. Motivated by error-correction considerations, we define general order parameters for all such generalized Z 2 lattice-gauge theories, and show that they are generally lower bounded by success probabilities of error correction. For CSS codes satisfying the low-density parity-check condition and with a sufficiently large code distance, we prove the existence of a low-temperature ordered phase of the corresponding lattice-gauge theories, particularly for those lacking Euclidean spatial locality and/or when there is a nonzero code rate. We further argue that these results provide evidence for stable phases in the corresponding perturbed quantum Hamiltonians, obtained in the limit of continuous imaginary time. To do so, we distinguish space- and timelike defects in the lattice-gauge theory. A high free-energy cost of spacelike defects corresponds to a successful “memory experiment” and suppresses the energy splitting among the ground states, while a high free-energy cost of timelike defects corresponds to a successful “stability experiment” and points to a nonzero gap to local excitations.
It may seem inevitable that highly entangled quantum states are susceptible to disturbance through interaction with a decohering environment. However, certain multiqubit entangled states are well protected from common forms of decoherence as the quantum information is hidden in inherently nonlocal degrees of freedom. This review shows that this robustness is enabled by specific measurements on subsets of qubits, implementing a quantum version of an error correction process. Beginning with the basics, the latest understanding of the relation between this form of error correction and the concept of two-dimensional topological order in many-body physics is reviewed.
Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.