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

Lobachevskii Journal of Mathematics

On the Counting of Quantum Errors

Мокеев Александр Сергеевич

Published Jul 1, 2022• 0 citations
Publisher

Abstract

Abstract In the theory of quantum error correction, there are two very important types of subspaces, one is the non-commutative operator graph correspondent to the error and one is generated by the Kraus operators of the error. Dimensions of those subspaces could be considered as characteristics measuring the quality of the error-correcting scheme. In the present paper, we are discussing the relationship between these quantities.

DOI
10.1134/s1995080222100298

Related papers

Quantum error correction of observables

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

A formalism for quantum error correction based on operator algebras was introduced by us earlier [Phys. Rev. Lett. 98, 10052 (2007)] via consideration of the Heisenberg picture for quantum dynamics. The resulting theory allows for the correction of hybrid quantum-classical information and does not require an encoded state to be entirely in one of the corresponding subspaces or subsystems. Here, we provide detailed proofs for our earlier results, derive more results, and elucidate key points with expanded discussions. We also present several examples and indicate how the theory can be extended to operator spaces and general positive operator-valued measures.

arXiv:0705.1574•Physical Review A•Oct 2, 2007•67 citations

On Noncommutative Operator Graphs Generated by Resolutions of Identity

Grigori Gennadievich Amosov, Мокеев Александр Сергеевич

Abstract Noncommutative operator graphs play an important role in the theory of quantum error correction. In this paper, we briefly review recent results devoted to the graphs generated by resolutions of identity for which there exists a quantum error-correcting code. We discuss examples of such graphs and touch upon the problem of describing quantum noise within this theory.

Proceedings of the Steklov Institute of Mathematics•Jul 1, 2021•0 citations

Operator quantum error correction

David W. Kribs, David Poulin

Abstract. This paper is an expanded and more detailed version of the work [1] in which the Operator Quantum Error Correction protocol was introduced. This is a new scheme for the error correction of quantum operations that incorporates the known techniques — i.e. the standard error correction model, the method of decoherence-free subspaces, and the noiseless subsystem method — as special cases, and relies on a generalized mathematical framework for noiseless subsystems that applies to arbitrary quantum operations. We also discuss a number of examples and introduce the notion of “unitarily noiseless subsystems”. A unified and generalized approach to quantum error correction, called Operator Quantum Error Correction (OQEC), was recently introduced in [1]. This model unifies all of the known techniques for the error correction of quantum operations – i.e. the standard model [2, 3, 4, 5], the method of decoherence-free subspaces [6, 7, 8, 9]

Cambridge University Press eBooks•Sep 5, 2013•92 citations

Robustness of operator quantum error correction with respect to initialization errors

Ognyan Oreshkov

In the theory of operator quantum error correction (OQEC), the notion of correctability is defined under the assumption that states are perfectly initialized inside a particular subspace, a factor of which (a subsystem) contains the protected information. If the initial state of the system does not belong entirely to the subspace in question, the restriction of the state to the otherwise correctable subsystem may not remain invariant after the application of noise and error correction. It is known that in the case of decoherence-free subspaces and subsystems (DFSs) the condition for perfect unitary evolution inside the code imposes more restrictive conditions on the noise process if one allows imperfect initialization. It was believed that these conditions are necessary if DFSs are to be able to protect imperfectly encoded states from subsequent errors. By a similar argument, general operator quantum error-correcting (OQEC) codes would also require more restrictive error-correction conditions for the case of imperfect initialization. In this study, we examine this requirement by looking at the errors on the encoded state. In order to quantitatively analyze the errors in an OQEC code, we introduce a measure of the fidelity between the encoded information in two states for the case of subsystem encoding. A major part of the paper concerns the definition of the measure and the derivation of its properties. In contrast to what was previously believed, we obtain that more restrictive conditions are not necessary for either DFSs or for general OQEC codes. This is because the effective noise that can arise inside the code as a result of imperfect initialization is such that it can only increase the fidelity of an imperfectly encoded state with a perfectly encoded one.

arXiv:0709.3533•Physical Review A•Mar 20, 2008•10 citations

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•486 citations

Entanglement of subspaces and error-correcting codes

Gilad Gour, Nolan R. Wallach

We introduce the notion of entanglement of subspaces as a measure that quantifies the entanglement of bipartite states in a randomly selected subspace. We discuss its properties and in particular we show that for maximally entangled subspaces it is additive. Furthermore, we show that maximally entangled subspaces can play an important role in the study of quantum error-correction codes. We discuss both degenerate and nondegenerate codes and show that the subspace spanned by the logical code words of a nondegenerate code is a $k$-totally- (maximally) entangled subspace. As for non-degenerate codes, we provide a mathematical definition in terms of subspaces and, as an example, we analyze Shor's 9-qubit code in terms of 22 mutually orthogonal subspaces.

arXiv:0704.0251•Physical Review A•Oct 5, 2007•32 citations
Abstract In the theory of quantum error correction, there are two very important types of subspaces, one is the non-commutative operator graph correspondent to the error and one is generated by the Kraus operators of the error. Dimensions of those subspaces could be considered as characteristics measuring the quality of the error-correcting scheme. In the present paper, we are discussing the relationship between these quantities.
A formalism for quantum error correction based on operator algebras was introduced by us earlier [Phys. Rev. Lett. 98, 10052 (2007)] via consideration of the Heisenberg picture for quantum dynamics. The resulting theory allows for the correction of hybrid quantum-classical information and does not require an encoded state to be entirely in one of the corresponding subspaces or subsystems. Here, we provide detailed proofs for our earlier results, derive more results, and elucidate key points with expanded discussions. We also present several examples and indicate how the theory can be extended to operator spaces and general positive operator-valued measures.
Abstract. This paper is an expanded and more detailed version of the work [1] in which the Operator Quantum Error Correction protocol was introduced. This is a new scheme for the error correction of quantum operations that incorporates the known techniques — i.e. the standard error correction model, the method of decoherence-free subspaces, and the noiseless subsystem method — as special cases, and relies on a generalized mathematical framework for noiseless subsystems that applies to arbitrary quantum operations. We also discuss a number of examples and introduce the notion of “unitarily noiseless subsystems”. A unified and generalized approach to quantum error correction, called Operator Quantum Error Correction (OQEC), was recently introduced in [1]. This model unifies all of the known techniques for the error correction of quantum operations – i.e. the standard model [2, 3, 4, 5], the method of decoherence-free subspaces [6, 7, 8, 9]
In the theory of operator quantum error correction (OQEC), the notion of correctability is defined under the assumption that states are perfectly initialized inside a particular subspace, a factor of which (a subsystem) contains the protected information. If the initial state of the system does not belong entirely to the subspace in question, the restriction of the state to the otherwise correctable subsystem may not remain invariant after the application of noise and error correction. It is known that in the case of decoherence-free subspaces and subsystems (DFSs) the condition for perfect unitary evolution inside the code imposes more restrictive conditions on the noise process if one allows imperfect initialization. It was believed that these conditions are necessary if DFSs are to be able to protect imperfectly encoded states from subsequent errors. By a similar argument, general operator quantum error-correcting (OQEC) codes would also require more restrictive error-correction conditions for the case of imperfect initialization. In this study, we examine this requirement by looking at the errors on the encoded state. In order to quantitatively analyze the errors in an OQEC code, we introduce a measure of the fidelity between the encoded information in two states for the case of subsystem encoding. A major part of the paper concerns the definition of the measure and the derivation of its properties. In contrast to what was previously believed, we obtain that more restrictive conditions are not necessary for either DFSs or for general OQEC codes. This is because the effective noise that can arise inside the code as a result of imperfect initialization is such that it can only increase the fidelity of an imperfectly encoded state with a perfectly encoded one.
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.
We introduce the notion of entanglement of subspaces as a measure that quantifies the entanglement of bipartite states in a randomly selected subspace. We discuss its properties and in particular we show that for maximally entangled subspaces it is additive. Furthermore, we show that maximally entangled subspaces can play an important role in the study of quantum error-correction codes. We discuss both degenerate and nondegenerate codes and show that the subspace spanned by the logical code words of a nondegenerate code is a kkk-totally- (maximally) entangled subspace. As for non-degenerate codes, we provide a mathematical definition in terms of subspaces and, as an example, we analyze Shor's 9-qubit code in terms of 22 mutually orthogonal subspaces.