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:2506.19776

Quantum Resource Correction

Mark Byrd, Daniel Dilley, Alvin Gonzales, Masaya Takahashi, Zain H. Saleem, Lian-Ao Wu

Published Jun 24, 2025• 2 citations
arXivHTMLPDF

Abstract

Resource theories play a crucial role in characterizing states and properties essential for quantum information processing. A significant challenge is protecting resources from errors. We explore strategies for correcting quantum resources. We show that resource preserving operations in resource theory define a gauge freedom on code spaces, which allows for recovery strategies that can correct the resource while changing non-essential properties. This allows decoding to be simplified. The results are applicable to various resource theories and we provide an application to quantum sensing.

DOI
10.48550/arxiv.2506.19776

Related papers

Error Correction in Lattice Quantum Electrodynamics with Quantum Reference Frames

Elias Rothlin, Carla Ferradini, Lin-Qing Chen

Is gauge symmetry merely a redundancy in our description, or does it carry a deeper information-theoretic significance? Quantum error-correcting codes (QECCs) show that redundancy can serve as a resource for protecting information against noise. In this work, we ask whether gauge theories can be understood in similar terms, and make this idea concrete in lattice quantum electrodynamics (QED), building on and extending earlier works that established a bridge between gauge systems, stabilizer codes, and quantum reference frames (QRFs). For Abelian gauge groups, we show that explicit recovery operations can be constructed using group-theoretical methods for error sets determined by both ideal and non-ideal QRFs. Applied to lattice QED, this yields two QECC structures: one in the pure-gauge sector and one including fermions. We construct a gauge-field QRF based on spanning trees of the lattice and a fermionic field QRF from the matter field, thereby making explicit how physical information is encoded. While the syndromes of gauge-violating errors associated with constraint measurements are generically degenerate, QRFs resolve this degeneracy and single out families of correctable errors. This establishes lattice QED as a QECC beyond the stabilizer setting and shows concretely how gauge symmetry provides an encoding structure that supports error correction.

quant-pharXiv:2604.06149•Apr 8, 2026•7 citations

Decoding Quantum Error Correction Codes With Local Variation

Michael Hanks, William J. Munro, Kae Nemoto

In this article, we investigate the role of local information in the decoding of the repetition and surface error correction codes for the protection of quantum states. Our key result is an improvement in resource efficiency when local information is taken into account during the decoding process: the code distance associated with a given logical error rate is reduced with a magnitude depending on the proximity of the physical error rate to the accuracy threshold of the code. We also briefly discuss an averaged approach with local information for table lookup and localized decoding schemes, an expected breakdown of these effects for large-scale systems, and the importance of this resource reduction in the near term.

arXiv:1912.09635•IEEE Transactions on Quantum Engineering•Jan 1, 2020•2 citations

Stabilizer Formalism for Operator Quantum Error Correction

David Poulin

Operator quantum error correction is a recently developed theory that provides a generalized and unified framework for active error correction and passive error avoiding schemes. In this Letter, we describe these codes using the stabilizer formalism. This is achieved by adding a gauge group to stabilizer codes that defines an equivalence class between encoded states. Gauge transformations leave the encoded information unchanged; their effect is absorbed by virtual gauge qubits that do not carry useful information. We illustrate the construction by identifying a gauge symmetry in Shor's 9-qubit code that allows us to remove 3 of its 8 stabilizer generators, leading to a simpler decoding procedure and a wider class of logical operations without affecting its essential properties. This opens the path to possible improvements of the error threshold of fault-tolerant quantum computing.

arXiv:quant-ph/0508131•Physical Review Letters•Dec 1, 2005•372 citations

A correspondence between quantum error correcting codes and quantum reference frames

Sylvain Carrozza, Aidan Chatwin-Davies, Philipp A. Höhn +1 more

In a gauge theory, a collection of kinematical degrees of freedom is used to redundantly describe a smaller amount of gauge-invariant information. In a quantum error correcting code (QECC), a collection of computational degrees of freedom that make up a device's physical layer is used to redundantly encode a smaller amount of logical information. We elaborate this parallel in terms of quantum reference frames (QRFs), which are a universal toolkit for dealing with symmetries in quantum systems and which define the gauge theory analog of encodings. The result is a precise dictionary between QECCs and QRF setups within the perspective-neutral framework for gauge systems. Concepts from QECCs like error sets and correctability translate to novel insights into the informational architecture of gauge theories. Conversely, the dictionary provides a systematic procedure for constructing symmetry-based QECCs and characterizing their error correcting properties. In this initial work, we scrutinize the dictionary between Pauli stabilizer codes and their corresponding QRF setups. We show that there is a one-to-one correspondence between maximal correctable error sets and tensor factorizations splitting system from error-generated QRF degrees of freedom. Relative to this split, errors corrupt only redundant frame data, leading to a novel characterization of correctability. When passed through the dictionary, standard Pauli errors behave as electric excitations that are dual, via Pontryagin duality, to magnetic excitations related to gauge-fixing. This gives rise to a new class of correctable errors and a systematic error duality. We illustrate our findings in surface codes, which themselves connect quantum error correction with gauge systems. Our exploratory investigations pave the way for foundational applications to gauge theories and for eventual practical applications to quantum simulation.

arXiv:2412.15317•Dec 19, 2024•19 citations

Error Suppression Mechanisms in Variational Quantum Algorithms: A Theoretical Analysis of Selective Correction Strategies

Tuan Garza, Chaitanya Sri

This work provides a rigorous theoretical investigation of selective error correction strategies for variational quantum algorithms, with focus on understanding the interplay between error suppression, circuit trainability, and computational resource requirements. We develop a mathematical framework that characterizes how different error correction codes affect the optimization landscape of parameterized quantum circuits, deriving exact bounds on error-suppression capabilities as functions of code distance, syndrome extraction frequency, and variational parameter space dimensionality. Our analysis reveals that selective correction-applying error mitigation only to critical circuit components-can preserve trainability while significantly reducing quantum resource overhead compared to full error correction. We establish theoretical conditions under which selective strategies maintain solution quality guarantees and prove convergence theorems for variational algorithms operating under this paradigm. The framework incorporates noise models spanning coherent and incoherent errors, providing performance predictions across different hardware platforms. We further analyze the trade-off between error correction resource investment and algorithm performance, identifying optimal correction strategies for various problem classes. This theoretical foundation advances understanding of practical quantum algorithm design under realistic noise conditions and offers principled approaches to resource-efficient quantum error management in near-term devices.

•Nov 27, 2025•0 citations

Theory of quantum error-correcting codes

Emanuel H. Knill, Raymond Laflamme

Quantum error correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery-operator-independent definition of error-correcting codes. We relate this definition to four others: the existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state, and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct e errors and a formal proof that the classical bounds on the probability of error of e-error-correcting codes applies to e-error-correcting quantum codes, provided that the interaction is dominated by an identity component.

Physical Review A•Feb 1, 1997•1,642 citations
Resource theories play a crucial role in characterizing states and properties essential for quantum information processing. A significant challenge is protecting resources from errors. We explore strategies for correcting quantum resources. We show that resource preserving operations in resource theory define a gauge freedom on code spaces, which allows for recovery strategies that can correct the resource while changing non-essential properties. This allows decoding to be simplified. The results are applicable to various resource theories and we provide an application to quantum sensing.
Is gauge symmetry merely a redundancy in our description, or does it carry a deeper information-theoretic significance? Quantum error-correcting codes (QECCs) show that redundancy can serve as a resource for protecting information against noise. In this work, we ask whether gauge theories can be understood in similar terms, and make this idea concrete in lattice quantum electrodynamics (QED), building on and extending earlier works that established a bridge between gauge systems, stabilizer codes, and quantum reference frames (QRFs). For Abelian gauge groups, we show that explicit recovery operations can be constructed using group-theoretical methods for error sets determined by both ideal and non-ideal QRFs. Applied to lattice QED, this yields two QECC structures: one in the pure-gauge sector and one including fermions. We construct a gauge-field QRF based on spanning trees of the lattice and a fermionic field QRF from the matter field, thereby making explicit how physical information is encoded. While the syndromes of gauge-violating errors associated with constraint measurements are generically degenerate, QRFs resolve this degeneracy and single out families of correctable errors. This establishes lattice QED as a QECC beyond the stabilizer setting and shows concretely how gauge symmetry provides an encoding structure that supports error correction.
In this article, we investigate the role of local information in the decoding of the repetition and surface error correction codes for the protection of quantum states. Our key result is an improvement in resource efficiency when local information is taken into account during the decoding process: the code distance associated with a given logical error rate is reduced with a magnitude depending on the proximity of the physical error rate to the accuracy threshold of the code. We also briefly discuss an averaged approach with local information for table lookup and localized decoding schemes, an expected breakdown of these effects for large-scale systems, and the importance of this resource reduction in the near term.
Operator quantum error correction is a recently developed theory that provides a generalized and unified framework for active error correction and passive error avoiding schemes. In this Letter, we describe these codes using the stabilizer formalism. This is achieved by adding a gauge group to stabilizer codes that defines an equivalence class between encoded states. Gauge transformations leave the encoded information unchanged; their effect is absorbed by virtual gauge qubits that do not carry useful information. We illustrate the construction by identifying a gauge symmetry in Shor's 9-qubit code that allows us to remove 3 of its 8 stabilizer generators, leading to a simpler decoding procedure and a wider class of logical operations without affecting its essential properties. This opens the path to possible improvements of the error threshold of fault-tolerant quantum computing.
In a gauge theory, a collection of kinematical degrees of freedom is used to redundantly describe a smaller amount of gauge-invariant information. In a quantum error correcting code (QECC), a collection of computational degrees of freedom that make up a device's physical layer is used to redundantly encode a smaller amount of logical information. We elaborate this parallel in terms of quantum reference frames (QRFs), which are a universal toolkit for dealing with symmetries in quantum systems and which define the gauge theory analog of encodings. The result is a precise dictionary between QECCs and QRF setups within the perspective-neutral framework for gauge systems. Concepts from QECCs like error sets and correctability translate to novel insights into the informational architecture of gauge theories. Conversely, the dictionary provides a systematic procedure for constructing symmetry-based QECCs and characterizing their error correcting properties. In this initial work, we scrutinize the dictionary between Pauli stabilizer codes and their corresponding QRF setups. We show that there is a one-to-one correspondence between maximal correctable error sets and tensor factorizations splitting system from error-generated QRF degrees of freedom. Relative to this split, errors corrupt only redundant frame data, leading to a novel characterization of correctability. When passed through the dictionary, standard Pauli errors behave as electric excitations that are dual, via Pontryagin duality, to magnetic excitations related to gauge-fixing. This gives rise to a new class of correctable errors and a systematic error duality. We illustrate our findings in surface codes, which themselves connect quantum error correction with gauge systems. Our exploratory investigations pave the way for foundational applications to gauge theories and for eventual practical applications to quantum simulation.
This work provides a rigorous theoretical investigation of selective error correction strategies for variational quantum algorithms, with focus on understanding the interplay between error suppression, circuit trainability, and computational resource requirements. We develop a mathematical framework that characterizes how different error correction codes affect the optimization landscape of parameterized quantum circuits, deriving exact bounds on error-suppression capabilities as functions of code distance, syndrome extraction frequency, and variational parameter space dimensionality. Our analysis reveals that selective correction-applying error mitigation only to critical circuit components-can preserve trainability while significantly reducing quantum resource overhead compared to full error correction. We establish theoretical conditions under which selective strategies maintain solution quality guarantees and prove convergence theorems for variational algorithms operating under this paradigm. The framework incorporates noise models spanning coherent and incoherent errors, providing performance predictions across different hardware platforms. We further analyze the trade-off between error correction resource investment and algorithm performance, identifying optimal correction strategies for various problem classes. This theoretical foundation advances understanding of practical quantum algorithm design under realistic noise conditions and offers principled approaches to resource-efficient quantum error management in near-term devices.
Quantum error correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery-operator-independent definition of error-correcting codes. We relate this definition to four others: the existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state, and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct e errors and a formal proof that the classical bounds on the probability of error of e-error-correcting codes applies to e-error-correcting quantum codes, provided that the interaction is dominated by an identity component.