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

Quantum Error Transmutation

Daniel Zhang, Toby S. Cubitt

Published Oct 16, 2023• 1 citation
arXivHTMLPDF

Abstract

We introduce a generalisation of quantum error correction, relaxing the requirement that a code should identify and correct a set of physical errors on the Hilbert space of a quantum computer exactly, instead allowing recovery up to a pre-specified admissible set of errors on the code space. We call these quantum error transmuting codes. They are of particular interest for the simulation of noisy quantum systems, and for use in algorithms inherently robust to errors of a particular character. Necessary and sufficient algebraic conditions on the set of physical and admissible errors for error transmutation are derived, generalising the Knill-Laflamme quantum error correction conditions. We demonstrate how some existing codes, including fermionic encodings, have error transmuting properties to interesting classes of admissible errors. Additionally, we report on the existence of some new codes, including low-qubit and translation invariant examples.

DOI
10.48550/arxiv.2310.10278

Related papers

Permutation-invariant quantum codes

Yingkai Ouyang

A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system. When the physical model is the Heisenberg ferromagnet in the absence of an external magnetic field, the corresponding ground space contains all permutation-invariant states. We use techniques from combinatorics and operator theory to construct families of permutation-invariant quantum codes. These codes have length proportional to ${t}^{2}$; one family of codes perfectly corrects arbitrary weight $t$ errors, while the other family of codes approximately correct $t$ spontaneous decay errors. The analysis of our codes' performance with respect to spontaneous decay errors utilizes elementary matrix analysis, where we revisit and extend the quantum error correction criterion of Knill and Laflamme, and Leung, Chuang, Nielsen and Yamamoto.

arXiv:1302.3247•Physical Review A•Dec 10, 2014•91 citations

A New Error Correction Intuitive Approach in Quantum Communications Protocols

Skander Aris, Merabtine Nadjim, Malek Benslama

Abstract: 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 errors and a formal proof that the classical bounds on the probability of errorcorrecting codes applies to error correcting quantum codes, provided that the interaction is dominated by an identity component.

American Journal of Applied Sciences•Aug 1, 2007•3 citations

Theory of approximate quantum error correction and the error-set model

Dor Elimelech, Victor V. Albert, Alexander Barg

We develop a theory of approximate quantum error correction (QEC) based on the error-set model, complemented by general methods for code construction. Exact QEC has a powerful error-set structure: by the Knill-Laflamme conditions, a code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span. This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory of asymptotically good codes. A longstanding view has been that these features do not extend to AQEC, leaving the theory essentially channel-by-channel. We show instead that, although full Knill--Laflamme linearity fails, a restricted form survives and suffices to extend all three structural features to the approximate setting. Specifically, a common error-set criterion governs families of channels whose Kraus operators are linear combinations of a given error set and whose coefficient matrices satisfy a spectral constraint. Using the Bény-Oreshkov worst-case and Petz average-case frameworks, we derive uniform fidelity guarantees for these families in terms of two new code parameters--the \emph{environment-leakage distance}, controlling worst-case performance, and the \emph{Knill-Laflamme Hellinger distance}, characterizing the average-case performance of Petz recovery. To demonstrate the scope of this model, we develop partition-based constructions across diverse quantum systems and geometries, placing exact and approximate correction on equal footing. These constructions lead to a metric--error alignment hierarchy for Hilbert spaces, metrics, and error families, which in turn characterizes the resulting recovery guarantees. They yield the first known asymptotically good code families for fermionic systems, one-dimensional Rydberg-blockaded systems, and deletion errors, and extend to other physical platforms.

quant-pharXiv:2607.22995•Jul 28, 2026•0 citations

Quantum error correction on infinite-dimensional Hilbert spaces

Cédric Bény, Achim Kempf, David W. Kribs

We present a generalization of quantum error correction to infinite-dimensional Hilbert spaces. We find that, under relatively mild conditions, much of the structure known from systems in finite-dimensional Hilbert spaces carries straightforwardly over to infinite dimensions. We also find that, at least in principle, there exist qualitatively new classes of quantum error correcting codes that have no finite-dimensional counterparts. We begin with a shift of focus from states to algebras of observables. Standard subspace codes and subsystem codes are seen as the special case of algebras of observables given by finite-dimensional von Neumann factors of type I. The new classes of codes that arise in infinite dimensions are shown to be characterized by von Neumann algebras of types II and III, for which we give in-principle physical examples.

arXiv:0811.0421•Journal of Mathematical Physics•Jun 1, 2009•20 citations

Perturbative Quantum Error Correction

Cédric Bény

We derive simple necessary and sufficient conditions under which a quantum channel obtained from an arbitrary perturbation from the identity can be reversed on a given code to the lowest order in fidelity. We find the usual Knill-Laflamme conditions applied to a certain operator subspace which, for a generic perturbation, is generated by the Lindblad operators. For a weak interaction with an environment, the error space to be corrected is a subspace of that spanned by the interaction operators, selected by the environment's initial state.

arXiv:1102.3809•Physical Review Letters•Aug 16, 2011•21 citations

Noise-Symmetry Optimization of Quantum Error-Corrected Metrology

Shuyun Su, Shengshi Pang

Quantum error correction (QEC) codes have emerged as a powerful tool to protect quantum-enhanced metrology against noise. However, the ability to correct errors alone does not guarantee high metrological sensitivity, as the encoded states may become insensitive to the parameter of interest. Here we show that this limitation can be overcome by exploiting an intrinsic freedom of QEC codes: for a fixed set of correctable errors, the Knill-Laflamme conditions admit an equivalence class of encodings. When the correctable noise possesses unitary symmetries, these symmetries generate continuous transformations within this class, allowing systematic optimization of the encoding to increase the quantum Fisher information while preserving the correctable set of noise. Based on this observation, we develop a symmetry-based optimization approach and derive criteria identifying when such optimization can enhance metrological sensitivity. In particular, for stabilizer-sum Hamiltonians, symmetry optimization can convert a code with vanishing QFI into one achieving the standard quantum limit in general or even Heisenberg scaling in specific cases, illustrating the power of symmetry optimization for QEC-assisted quantum metrology.

quant-pharXiv:2608.21842•Physical Review Letters•Aug 25, 2026•0 citations
We introduce a generalisation of quantum error correction, relaxing the requirement that a code should identify and correct a set of physical errors on the Hilbert space of a quantum computer exactly, instead allowing recovery up to a pre-specified admissible set of errors on the code space. We call these quantum error transmuting codes. They are of particular interest for the simulation of noisy quantum systems, and for use in algorithms inherently robust to errors of a particular character. Necessary and sufficient algebraic conditions on the set of physical and admissible errors for error transmutation are derived, generalising the Knill-Laflamme quantum error correction conditions. We demonstrate how some existing codes, including fermionic encodings, have error transmuting properties to interesting classes of admissible errors. Additionally, we report on the existence of some new codes, including low-qubit and translation invariant examples.
A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system. When the physical model is the Heisenberg ferromagnet in the absence of an external magnetic field, the corresponding ground space contains all permutation-invariant states. We use techniques from combinatorics and operator theory to construct families of permutation-invariant quantum codes. These codes have length proportional to t2{t}^{2}t2; one family of codes perfectly corrects arbitrary weight ttt errors, while the other family of codes approximately correct ttt spontaneous decay errors. The analysis of our codes' performance with respect to spontaneous decay errors utilizes elementary matrix analysis, where we revisit and extend the quantum error correction criterion of Knill and Laflamme, and Leung, Chuang, Nielsen and Yamamoto.
Abstract: 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 errors and a formal proof that the classical bounds on the probability of errorcorrecting codes applies to error correcting quantum codes, provided that the interaction is dominated by an identity component.
We develop a theory of approximate quantum error correction (QEC) based on the error-set model, complemented by general methods for code construction. Exact QEC has a powerful error-set structure: by the Knill-Laflamme conditions, a code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span. This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory of asymptotically good codes. A longstanding view has been that these features do not extend to AQEC, leaving the theory essentially channel-by-channel. We show instead that, although full Knill--Laflamme linearity fails, a restricted form survives and suffices to extend all three structural features to the approximate setting. Specifically, a common error-set criterion governs families of channels whose Kraus operators are linear combinations of a given error set and whose coefficient matrices satisfy a spectral constraint. Using the Bény-Oreshkov worst-case and Petz average-case frameworks, we derive uniform fidelity guarantees for these families in terms of two new code parameters--the \emph{environment-leakage distance}, controlling worst-case performance, and the \emph{Knill-Laflamme Hellinger distance}, characterizing the average-case performance of Petz recovery. To demonstrate the scope of this model, we develop partition-based constructions across diverse quantum systems and geometries, placing exact and approximate correction on equal footing. These constructions lead to a metric--error alignment hierarchy for Hilbert spaces, metrics, and error families, which in turn characterizes the resulting recovery guarantees. They yield the first known asymptotically good code families for fermionic systems, one-dimensional Rydberg-blockaded systems, and deletion errors, and extend to other physical platforms.
We present a generalization of quantum error correction to infinite-dimensional Hilbert spaces. We find that, under relatively mild conditions, much of the structure known from systems in finite-dimensional Hilbert spaces carries straightforwardly over to infinite dimensions. We also find that, at least in principle, there exist qualitatively new classes of quantum error correcting codes that have no finite-dimensional counterparts. We begin with a shift of focus from states to algebras of observables. Standard subspace codes and subsystem codes are seen as the special case of algebras of observables given by finite-dimensional von Neumann factors of type I. The new classes of codes that arise in infinite dimensions are shown to be characterized by von Neumann algebras of types II and III, for which we give in-principle physical examples.
We derive simple necessary and sufficient conditions under which a quantum channel obtained from an arbitrary perturbation from the identity can be reversed on a given code to the lowest order in fidelity. We find the usual Knill-Laflamme conditions applied to a certain operator subspace which, for a generic perturbation, is generated by the Lindblad operators. For a weak interaction with an environment, the error space to be corrected is a subspace of that spanned by the interaction operators, selected by the environment's initial state.
Quantum error correction (QEC) codes have emerged as a powerful tool to protect quantum-enhanced metrology against noise. However, the ability to correct errors alone does not guarantee high metrological sensitivity, as the encoded states may become insensitive to the parameter of interest. Here we show that this limitation can be overcome by exploiting an intrinsic freedom of QEC codes: for a fixed set of correctable errors, the Knill-Laflamme conditions admit an equivalence class of encodings. When the correctable noise possesses unitary symmetries, these symmetries generate continuous transformations within this class, allowing systematic optimization of the encoding to increase the quantum Fisher information while preserving the correctable set of noise. Based on this observation, we develop a symmetry-based optimization approach and derive criteria identifying when such optimization can enhance metrological sensitivity. In particular, for stabilizer-sum Hamiltonians, symmetry optimization can convert a code with vanishing QFI into one achieving the standard quantum limit in general or even Heisenberg scaling in specific cases, illustrating the power of symmetry optimization for QEC-assisted quantum metrology.