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

Linear and Multilinear Algebra

Quantum error correction for a subgroup of the Pauli group using higher rank numerical range

Sayyed Ahmad Mousavi, Abbas Salemi

Published May 7, 2015• 1 citation
Publisher

Abstract

Suppose noise is characterized by a quantum channel whose error operators are members of an arbitrary (not necessarily abelian) Pauli subgroup of -qubit Pauli group, where . In this paper, using a maximal abelian subgroup of , we obtained the largest , for which the joint rank- numerical range associated with members of is non-empty. It is proved that qubits codeword encodes data qubits. Moreover, we obtain recovery operators such that the decoded state automatically appears in the output with no syndrome measurements for such channels.

DOI
10.1080/03081087.2015.1039954

Related papers

Joint higher rank numerical range of Pauli group

Sayyed Ahmad Mousavi, Abbas Salemi

For a noisy quantum channel, a quantum error correction code of dimension k exists if and only if the joint rank- numerical range associated with the error operators of the channel is non-empty. In this paper, the joint rank- numerical range of an -tuple of elements in the -qubit Pauli group are discussed. Let be a Hermitian triple in the -qubit Pauli group. We state a constructive method to obtain the joint rank- numerical range of . Moreover, we show that .

Linear and Multilinear Algebra•Feb 14, 2014•2 citations

Quantum error correction and generalized numerical ranges

Chi-Kwong Li, Yiu‐Tung Poon

For a noisy quantum channel, a quantum error correcting code exists if and only if the joint higher rank numerical ranges associated with the error operators of the channel is non-empty. In this paper, geometric properties of the joint higher rank numerical ranges are obtained and their implications to quantum computing are discussed. It is shown that if the dimension of the underlying Hilbert space of the quantum states is sufficiently large, the joint higher rank numerical range of operators is always star-shaped and contains a non-empty convex subset. In case the operators are infinite dimensional, the joint infinite rank numerical range of the operators is a convex set closely related to the joint essential numerical ranges of the operators.

arXiv:0812.4772•Dec 27, 2008•5 citations

GENERALIZED JOINT HIGHER-RANK NUMERICAL RANGE

Mohammad Ali Mehrjoofard, Hamid Reza Afshin, Sotoodeh Bagheri

The rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. For a noisy quantum channel, a quantum error correcting code of dimension k exists, if and only if the associated joint rank-k numerical range is non-empty. In this paper, the no- tion of joint rank-k numerical range is generalized, and some state- ments of (2011, Generalized numerical ranges and quantum error correction, J. Operator Theory, 66: 2, 335-351.) are extended.

Journal of Algebraic Systems•Jun 1, 2015•0 citations

Quantum Error Correction and Higher-Rank Numerical Range

Choi, M D, David W. Kribs, Karol Życzkowski

We solve the fundamental quantum error correction problem for bi-unitary channels on two-qubit Hilbert space. We construct qubit codes for such channels on arbitrary dimension Hilbert space, and identify correctable codes for Pauli-error models not detected by the stabilizer formalism. This is accomplished through an application of a new tool for error correction in quantum computing called the ``higher-rank numerical range''. We describe its basic properties and discuss possible further applications.

•Nov 10, 2005•1 citation

Pauli channels can be estimated from syndrome measurements in quantum error correction

Thomas Wagner, Hermann Kampermann, Dagmar Bruß +1 more

The performance of quantum error correction can be significantly improved if detailed information about the noise is available, allowing to optimize both codes and decoders. It has been proposed to estimate error rates from the syndrome measurements done anyway during quantum error correction. While these measurements preserve the encoded quantum state, it is currently not clear how much information about the noise can be extracted in this way. So far, apart from the limit of vanishing error rates, rigorous results have only been established for some specific codes. In this work, we rigorously resolve the question for arbitrary stabilizer codes. The main result is that a stabilizer code can be used to estimate Pauli channels with correlations across a number of qubits given by the pure distance. This result does not rely on the limit of vanishing error rates, and applies even if high weight errors occur frequently. Moreover, it also allows for measurement errors within the framework of quantum data-syndrome codes. Our proof combines Boolean Fourier analysis, combinatorics and elementary algebraic geometry. It is our hope that this work opens up interesting applications, such as the online adaptation of a decoder to time-varying noise.

arXiv:2107.14252•Quantum•Sep 19, 2022•38 citations

Optimal recovery for quantum error correction

Sun Woo P. Kim

The calculation of the error threshold of quantum error correcting codes typically proceeds as follows. First, syndromes are measured. Then, a decoder infers the error chain and the corresponding correction is applied. The threshold is then defined as the largest correctable error rate, with the maximum-likelihood decoder corresponding to the ``optimal'' threshold. However, a broader set of operations could be used to recover quantum information. The true optimal threshold should be optimised over all possible recovery schemes, which can be described by quantum channels. Here, we study such optimal recovery channels and their thresholds $p_\mathrm{th}^\mathrm{opt}$. We introduce an information-theoretic quantity, mutual trace distance, which provides a necessary and sufficient diagnostic for sharply determining $p_\mathrm{th}^\mathrm{opt}$ without explicit optimisation. In contrast, previous works give a lower bound on $p_\mathrm{th}^\mathrm{opt}$ by specifying particular recovery schemes, e.g. Schumacher-Westmoreland (SW) which provides coherent information as a diagnostic to lower bound $p^\mathrm{opt}_\mathrm{th}$. We prove that the Petz and SW recovery schemes are optimal, i.e. their threshold is $p_\mathrm{th}^\mathrm{opt}$. With their optimality established, we explore the structure of optimal and non-optimal recovery schemes and their phase diagrams.

quant-pharXiv:2603.06520•Mar 6, 2026•6 citations
Suppose noise is characterized by a quantum channel whose error operators are members of an arbitrary (not necessarily abelian) Pauli subgroup of -qubit Pauli group, where . In this paper, using a maximal abelian subgroup of , we obtained the largest , for which the joint rank- numerical range associated with members of is non-empty. It is proved that qubits codeword encodes data qubits. Moreover, we obtain recovery operators such that the decoded state automatically appears in the output with no syndrome measurements for such channels.
For a noisy quantum channel, a quantum error correcting code exists if and only if the joint higher rank numerical ranges associated with the error operators of the channel is non-empty. In this paper, geometric properties of the joint higher rank numerical ranges are obtained and their implications to quantum computing are discussed. It is shown that if the dimension of the underlying Hilbert space of the quantum states is sufficiently large, the joint higher rank numerical range of operators is always star-shaped and contains a non-empty convex subset. In case the operators are infinite dimensional, the joint infinite rank numerical range of the operators is a convex set closely related to the joint essential numerical ranges of the operators.
The rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. For a noisy quantum channel, a quantum error correcting code of dimension k exists, if and only if the associated joint rank-k numerical range is non-empty. In this paper, the no- tion of joint rank-k numerical range is generalized, and some state- ments of (2011, Generalized numerical ranges and quantum error correction, J. Operator Theory, 66: 2, 335-351.) are extended.
We solve the fundamental quantum error correction problem for bi-unitary channels on two-qubit Hilbert space. We construct qubit codes for such channels on arbitrary dimension Hilbert space, and identify correctable codes for Pauli-error models not detected by the stabilizer formalism. This is accomplished through an application of a new tool for error correction in quantum computing called the ``higher-rank numerical range''. We describe its basic properties and discuss possible further applications.
The performance of quantum error correction can be significantly improved if detailed information about the noise is available, allowing to optimize both codes and decoders. It has been proposed to estimate error rates from the syndrome measurements done anyway during quantum error correction. While these measurements preserve the encoded quantum state, it is currently not clear how much information about the noise can be extracted in this way. So far, apart from the limit of vanishing error rates, rigorous results have only been established for some specific codes. In this work, we rigorously resolve the question for arbitrary stabilizer codes. The main result is that a stabilizer code can be used to estimate Pauli channels with correlations across a number of qubits given by the pure distance. This result does not rely on the limit of vanishing error rates, and applies even if high weight errors occur frequently. Moreover, it also allows for measurement errors within the framework of quantum data-syndrome codes. Our proof combines Boolean Fourier analysis, combinatorics and elementary algebraic geometry. It is our hope that this work opens up interesting applications, such as the online adaptation of a decoder to time-varying noise.
The calculation of the error threshold of quantum error correcting codes typically proceeds as follows. First, syndromes are measured. Then, a decoder infers the error chain and the corresponding correction is applied. The threshold is then defined as the largest correctable error rate, with the maximum-likelihood decoder corresponding to the ``optimal'' threshold. However, a broader set of operations could be used to recover quantum information. The true optimal threshold should be optimised over all possible recovery schemes, which can be described by quantum channels. Here, we study such optimal recovery channels and their thresholds pthoptp_\mathrm{th}^\mathrm{opt}pthopt​. We introduce an information-theoretic quantity, mutual trace distance, which provides a necessary and sufficient diagnostic for sharply determining pthoptp_\mathrm{th}^\mathrm{opt}pthopt​ without explicit optimisation. In contrast, previous works give a lower bound on pthoptp_\mathrm{th}^\mathrm{opt}pthopt​ by specifying particular recovery schemes, e.g. Schumacher-Westmoreland (SW) which provides coherent information as a diagnostic to lower bound pthoptp^\mathrm{opt}_\mathrm{th}pthopt​. We prove that the Petz and SW recovery schemes are optimal, i.e. their threshold is pthoptp_\mathrm{th}^\mathrm{opt}pthopt​. With their optimality established, we explore the structure of optimal and non-optimal recovery schemes and their phase diagrams.