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:0811.0421 · Journal of Mathematical Physics

Quantum error correction on infinite-dimensional Hilbert spaces

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

Published Jun 1, 2009• 26 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1063/1.3155783

Related papers

Operator quantum error-correcting subsystems for self-correcting quantum memories

Dave Bacon

The most general method for encoding quantum information is not to encode the information into a subspace of a Hilbert space, but to encode information into a subsystem of a Hilbert space. Recently this notion has led to a more general notion of quantum error correction known as operator quantum error correction. In standard quantum error-correcting codes, one requires the ability to apply a procedure which exactly reverses on the error-correcting subspace any correctable error. In contrast, for operator error-correcting subsystems, the correction procedure need not undo the error which has occurred, but instead one must perform corrections only modulo the subsystem structure. This does not lead to codes which differ from subspace codes, but does lead to recovery routines which explicitly make use of the subsystem structure. Here we present two examples of such operator error-correcting subsystems. These examples are motivated by simple spatially local Hamiltonians on square and cubic lattices. In three dimensions we provide evidence, in the form a simple mean field theory, that our Hamiltonian gives rise to a system which is self-correcting. Such a system will be a natural high-temperature quantum memory, robust to noise without external intervening quantum error-correction procedures.

arXiv:quant-ph/0506023•Physical Review A•Jan 30, 2006•523 citations

Hybrid Clifford Codes via Operator Algebra Quantum Error Correction and Projective Representation Theory

Jonas Eidesen, David W. Kribs, Andrew Nemec

Clifford codes are a natural generalization of quantum stabilizer codes based primarily on representation theory. This class of codes has previously been extended to the setting of quantum subsystem codes. We formulate a two-fold generalization of Clifford codes, for both the hybrid classical and quantum information and projective representation theory settings. This leads to new classes of hybrid subspace and subsystem Clifford codes. We extend the fundamental representation theoretic quantum error correction theorem to include these codes, based on the operator algebra quantum error correction framework. We also discuss several examples throughout the presentation, of both stabilizer and non-stabilizer type.

quant-pharXiv:2606.02531•Journal of Physics A Mathematical and Theoretical•Jun 2, 2026•0 citations

Quantum Error Correcting Subsystem Codes From Two Classical Linear Codes

Dave Bacon, Andrea Casaccino

The essential insight of quantum error correction was that quantum information can be protected by suitably encoding this quantum information across multiple independently erred quantum systems. Recently it was realized that, since the most general method for encoding quantum information is to encode it into a subsystem, there exists a novel form of quantum error correction beyond the traditional quantum error correcting subspace codes. These new quantum error correcting subsystem codes differ from subspace codes in that their quantum correcting routines can be considerably simpler than related subspace codes. Here we present a class of quantum error correcting subsystem codes constructed from two classical linear codes. These codes are the subsystem versions of the quantum error correcting subspace codes which are generalizations of Shor's original quantum error correcting subspace codes. For every Shor-type code, the codes we present give a considerable savings in the number of stabilizer measurements needed in their error recovery routines.

arXiv:quant-ph/0610088•Oct 11, 2006•55 citations

Quantum Error Transmutation

Daniel Zhang, Toby S. Cubitt

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.

arXiv:2310.10278•Oct 16, 2023•2 citations

Encoding a qubit in an oscillator

Daniel Gottesman, Alexei Kitaev, John P. Preskill

Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of phase space to protect against errors that shift the values of the canonical variables q and p. In the setting of quantum optics, fault-tolerant universal quantum computation can be executed on the protected code subspace using linear optical operations, squeezing, homodyne detection, and photon counting; however, nonlinear mode coupling is required for the preparation of the encoded states. Finite-dimensional versions of these codes can be constructed that protect encoded quantum information against shifts in the amplitude or phase of a d-state system. Continuous-variable codes can be invoked to establish lower bounds on the quantum capacity of Gaussian quantum channels.

arXiv:quant-ph/0008040•Physical Review A•Jun 11, 2001•1,664 citations

Towards a unified framework for approximate quantum error correction

Prabha Mandayam, Hui Khoon Ng

Recent work on approximate quantum error correction (QEC) has opened up the possibility of constructing subspace codes that protect information with high fidelity in scenarios where perfect error correction is impossible. Motivated by this, we investigate the problem of approximate subsystem codes. Subsystem codes extend the standard formalism of subspace QEC to codes in which only a subsystem within a subspace of states is used to store information in a noise-resilient fashion. Here, we demonstrate easily checkable sufficient conditions for the existence of approximate subsystem codes. Furthermore, for certain classes of subsystem codes and noise processes, we prove the efficacy of the transpose channel as a simple-to-construct recovery map that works nearly as well as the optimal recovery channel. This work generalizes our earlier approach [H. K. Ng and P. Mandayam, Phys. Rev. A 81, 062342 (2010)] of using the transpose channel for the approximate correction of subspace codes to the case of subsystem codes, and brings us closer to a unifying framework for approximate QEC.

arXiv:1202.5139•Physical Review A•Jul 27, 2012•40 citations
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.
The most general method for encoding quantum information is not to encode the information into a subspace of a Hilbert space, but to encode information into a subsystem of a Hilbert space. Recently this notion has led to a more general notion of quantum error correction known as operator quantum error correction. In standard quantum error-correcting codes, one requires the ability to apply a procedure which exactly reverses on the error-correcting subspace any correctable error. In contrast, for operator error-correcting subsystems, the correction procedure need not undo the error which has occurred, but instead one must perform corrections only modulo the subsystem structure. This does not lead to codes which differ from subspace codes, but does lead to recovery routines which explicitly make use of the subsystem structure. Here we present two examples of such operator error-correcting subsystems. These examples are motivated by simple spatially local Hamiltonians on square and cubic lattices. In three dimensions we provide evidence, in the form a simple mean field theory, that our Hamiltonian gives rise to a system which is self-correcting. Such a system will be a natural high-temperature quantum memory, robust to noise without external intervening quantum error-correction procedures.
Clifford codes are a natural generalization of quantum stabilizer codes based primarily on representation theory. This class of codes has previously been extended to the setting of quantum subsystem codes. We formulate a two-fold generalization of Clifford codes, for both the hybrid classical and quantum information and projective representation theory settings. This leads to new classes of hybrid subspace and subsystem Clifford codes. We extend the fundamental representation theoretic quantum error correction theorem to include these codes, based on the operator algebra quantum error correction framework. We also discuss several examples throughout the presentation, of both stabilizer and non-stabilizer type.
The essential insight of quantum error correction was that quantum information can be protected by suitably encoding this quantum information across multiple independently erred quantum systems. Recently it was realized that, since the most general method for encoding quantum information is to encode it into a subsystem, there exists a novel form of quantum error correction beyond the traditional quantum error correcting subspace codes. These new quantum error correcting subsystem codes differ from subspace codes in that their quantum correcting routines can be considerably simpler than related subspace codes. Here we present a class of quantum error correcting subsystem codes constructed from two classical linear codes. These codes are the subsystem versions of the quantum error correcting subspace codes which are generalizations of Shor's original quantum error correcting subspace codes. For every Shor-type code, the codes we present give a considerable savings in the number of stabilizer measurements needed in their error recovery routines.
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.
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of phase space to protect against errors that shift the values of the canonical variables q and p. In the setting of quantum optics, fault-tolerant universal quantum computation can be executed on the protected code subspace using linear optical operations, squeezing, homodyne detection, and photon counting; however, nonlinear mode coupling is required for the preparation of the encoded states. Finite-dimensional versions of these codes can be constructed that protect encoded quantum information against shifts in the amplitude or phase of a d-state system. Continuous-variable codes can be invoked to establish lower bounds on the quantum capacity of Gaussian quantum channels.
Recent work on approximate quantum error correction (QEC) has opened up the possibility of constructing subspace codes that protect information with high fidelity in scenarios where perfect error correction is impossible. Motivated by this, we investigate the problem of approximate subsystem codes. Subsystem codes extend the standard formalism of subspace QEC to codes in which only a subsystem within a subspace of states is used to store information in a noise-resilient fashion. Here, we demonstrate easily checkable sufficient conditions for the existence of approximate subsystem codes. Furthermore, for certain classes of subsystem codes and noise processes, we prove the efficacy of the transpose channel as a simple-to-construct recovery map that works nearly as well as the optimal recovery channel. This work generalizes our earlier approach [H. K. Ng and P. Mandayam, Phys. Rev. A 81, 062342 (2010)] of using the transpose channel for the approximate correction of subspace codes to the case of subsystem codes, and brings us closer to a unifying framework for approximate QEC.