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:1302.5081 · Physical Review Letters

Quantum Error Correction via Less Noisy Qubits

Yuichiro Fujiwara

Published Apr 22, 2013• 15 citations
arXivHTMLPDF

Abstract

Known quantum error correction schemes are typically able to take advantage of only a limited class of classical error-correcting codes. Entanglement-assisted quantum error correction is a partial solution which made it possible to exploit any classical linear codes over the binary or quaternary finite field. However, the known entanglement-assisted scheme requires noiseless qubits that help correct quantum errors on noisy qubits, which can be too severe an assumption. We prove that a more relaxed and realistic assumption is sufficient by presenting encoding and decoding operations assisted by qubits on which quantum errors of one particular kind may occur. As in entanglement assistance, our scheme can import any binary or quaternary linear codes. If the auxiliary qubits are noiseless, our codes become entanglement-assisted codes, and saturate the quantum Singleton bound when the underlying classical codes are maximum distance separable.

DOI
10.1103/physrevlett.110.170501

Related papers

Using arbitrary parity-check matrices for quantum error correction assisted by less noisy qubits

Yuichiro Fujiwara

Recently a framework for assisted quantum error correction was proposed in which a specific type of error is allowed to occur on auxiliary qubits, which is in contrast to standard entanglement assistance that requires noiseless auxiliary qubits. However, while the framework maintains the ability to import any binary or quaternary linear code without sacrificing active error correction power, it requires the code designer to turn a parity-check matrix of the underlying classical code into an equivalent one in standard form. This means that classical coding theoretic techniques that require parity-check matrices to be in specific form may not fully be exploitable. Another issue of the recently proposed scheme is that the error correction capabilities for bit errors and phase errors are generally equal, which is not ideal for asymmetric error models. This paper addresses these two problems. We generalize the framework in such a way that any parity-check matrix of any binary or quaternary linear code can be exploited. Our generalization also allows for importing a pair of distinct linear codes so that error correction capabilities become suitably asymmetric.

arXiv:1407.7909•Jul 30, 2014•0 citations

Entanglement-assisted Quantum Error Correcting Code Saturating The Classical Singleton Bound

Soham Ghosh, Evagoras Stylianou, Holger Boche

We introduce a construction for entanglement-assisted quantum error-correcting codes (EAQECCs) that saturates the classical Singleton bound with less shared entanglement than any known method for code rates below $ \frac{k}{n} = \frac{1}{3} $. For higher rates, our EAQECC also meets the Singleton bound, although with increased entanglement requirements. Additionally, we demonstrate that any classical $[n,k,d]_q$ code can be transformed into an EAQECC with parameters $[[n,k,d;2k]]_q$ using $2k$ pre-shared maximally entangled pairs. The complexity of our encoding protocol for $k$-qudits with $q$ levels is $\mathcal{O}(k \log_{\frac{q}{q-1}}(k))$, excluding the complexity of encoding and decoding the classical MDS code. While this complexity remains linear in $k$ for systems of reasonable size, it increases significantly for larger-levelled systems, highlighting the need for further research into complexity reduction.

arXiv:2410.04130•Oct 5, 2024•0 citations

Catalytic Quantum Error Correction

Todd A. Brun, Igor Devetak, Min-Hsiu Hsieh

We develop the theory of entanglement-assisted quantum error-correcting (EAQEC) codes, a generalization of the stabilizer formalism to the setting in which the sender and receiver have access to preshared entanglement. Conventional stabilizer codes are equivalent to self-orthogonal symplectic codes. In contrast, EAQEC codes do not require self-orthogonality, which greatly simplifies their construction. We show how any classical binary or quaternary block code can be made into an EAQEC code. We provide a table of best known EAQEC codes with code length up to 10. With the self-orthogonality constraint removed, we see that the distance of an EAQEC code can be better than any standard quantum error-correcting code with the same fixed net yield. In a quantum computation setting, EAQEC codes give rise to catalytic quantum codes, which assume a subset of the qubits are noiseless. We also give an alternative construction of EAQEC codes by making classical entanglement-assisted codes coherent.

arXiv:quant-ph/0608027•IEEE Transactions on Information Theory•Mar 25, 2014•128 citations

General entanglement-assisted quantum error-correcting codes

Min-Hsiu Hsieh, Igor Devetak, Todd A. Brun

Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of preexisting entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC from any classical linear code, unlike standard QECCs, which can only be constructed from dual-containing codes. Operator quantum error-correcting codes allow certain errors to be corrected (or prevented) passively, reducing the complexity of the correction procedure. We combine these two extensions of standard quantum error correction into a unified entanglement-assisted quantum error-correction formalism. This new scheme, which we call entanglement-assisted operator quantum error correction (EAOQEC), is the most general and powerful quantum error-correcting technique known, retaining the advantages of both entanglement-assistance and passive correction. We present the formalism, show the considerable freedom in constructing EAOQECCs from classical codes, and demonstrate the construction with examples.

arXiv:0708.2142•Physical Review A•Dec 19, 2007•139 citations

General entanglement-assisted quantum error-correcting codes

Todd A. Brun, Igor Devetak, Min-Hsiu Hsieh

Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of pre-existing entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC from any classical linear code, unlike standard QECCs which can only be constructed from dual-containing codes. Operator quantum error-correcting codes (OQECCs) allow certain errors to be corrected (or prevented) passively, reducing the complexity of the correction procedure. We combine these two extensions of standard quantum error correction into a unified entanglement- assisted quantum error correction formalism. This new scheme, which we call entanglement-assisted operator quantum error correction (EAOQEC), is the most general and powerful quantum error-correcting technique known, retaining the advantages of both entanglement-assistance and passive correction. We present the formalism, show the considerable freedom in constructing EAOQECCs from classical codes, and demonstrate the construction with examples.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•27 citations

Entanglement-assisted quantum codes achieving the quantum singleton bound but violating the quantum hamming bound

Ruihu Li, Luobin Guo, Zongben Xu

We give an infinite family of degenerate entanglement-assisted quantum error-correcting codes (EAQECCs) which violate the EA-quantum Hamming bound for non-degenerate EAQECCs and achieve the EA-quantum Singleton bound, thereby proving that the EA-quantum Hamming bound does not asymptotically hold for degenerate EAQECCs. Unlike the previously known quantum error-correcting codes that violate the quantum Hamming bound by exploiting maximally entangled pairs of qubits, our codes do not require local unitary operations on the entangled auxiliary qubits during encoding. The degenerate EAQECCs we present are constructed from classical error-correcting codes with poor minimum distances, which implies that, unlike the majority of known EAQECCs with large minimum distances, our EAQECCs take more advantage of degeneracy and rely less on the error correction capabilities of classical codes.

Quantum Information and Computation•Oct 1, 2014•13 citations
Known quantum error correction schemes are typically able to take advantage of only a limited class of classical error-correcting codes. Entanglement-assisted quantum error correction is a partial solution which made it possible to exploit any classical linear codes over the binary or quaternary finite field. However, the known entanglement-assisted scheme requires noiseless qubits that help correct quantum errors on noisy qubits, which can be too severe an assumption. We prove that a more relaxed and realistic assumption is sufficient by presenting encoding and decoding operations assisted by qubits on which quantum errors of one particular kind may occur. As in entanglement assistance, our scheme can import any binary or quaternary linear codes. If the auxiliary qubits are noiseless, our codes become entanglement-assisted codes, and saturate the quantum Singleton bound when the underlying classical codes are maximum distance separable.
Recently a framework for assisted quantum error correction was proposed in which a specific type of error is allowed to occur on auxiliary qubits, which is in contrast to standard entanglement assistance that requires noiseless auxiliary qubits. However, while the framework maintains the ability to import any binary or quaternary linear code without sacrificing active error correction power, it requires the code designer to turn a parity-check matrix of the underlying classical code into an equivalent one in standard form. This means that classical coding theoretic techniques that require parity-check matrices to be in specific form may not fully be exploitable. Another issue of the recently proposed scheme is that the error correction capabilities for bit errors and phase errors are generally equal, which is not ideal for asymmetric error models. This paper addresses these two problems. We generalize the framework in such a way that any parity-check matrix of any binary or quaternary linear code can be exploited. Our generalization also allows for importing a pair of distinct linear codes so that error correction capabilities become suitably asymmetric.
We introduce a construction for entanglement-assisted quantum error-correcting codes (EAQECCs) that saturates the classical Singleton bound with less shared entanglement than any known method for code rates below $ \frac{k}{n} = \frac{1}{3} $. For higher rates, our EAQECC also meets the Singleton bound, although with increased entanglement requirements. Additionally, we demonstrate that any classical [n,k,d]q[n,k,d]_q[n,k,d]q​ code can be transformed into an EAQECC with parameters [[n,k,d;2k]]q[[n,k,d;2k]]_q[[n,k,d;2k]]q​ using 2k2k2k pre-shared maximally entangled pairs. The complexity of our encoding protocol for kkk-qudits with qqq levels is O(klog⁡qq−1(k))\mathcal{O}(k \log_{\frac{q}{q-1}}(k))O(klogq−1q​​(k)), excluding the complexity of encoding and decoding the classical MDS code. While this complexity remains linear in kkk for systems of reasonable size, it increases significantly for larger-levelled systems, highlighting the need for further research into complexity reduction.
We develop the theory of entanglement-assisted quantum error-correcting (EAQEC) codes, a generalization of the stabilizer formalism to the setting in which the sender and receiver have access to preshared entanglement. Conventional stabilizer codes are equivalent to self-orthogonal symplectic codes. In contrast, EAQEC codes do not require self-orthogonality, which greatly simplifies their construction. We show how any classical binary or quaternary block code can be made into an EAQEC code. We provide a table of best known EAQEC codes with code length up to 10. With the self-orthogonality constraint removed, we see that the distance of an EAQEC code can be better than any standard quantum error-correcting code with the same fixed net yield. In a quantum computation setting, EAQEC codes give rise to catalytic quantum codes, which assume a subset of the qubits are noiseless. We also give an alternative construction of EAQEC codes by making classical entanglement-assisted codes coherent.
Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of preexisting entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC from any classical linear code, unlike standard QECCs, which can only be constructed from dual-containing codes. Operator quantum error-correcting codes allow certain errors to be corrected (or prevented) passively, reducing the complexity of the correction procedure. We combine these two extensions of standard quantum error correction into a unified entanglement-assisted quantum error-correction formalism. This new scheme, which we call entanglement-assisted operator quantum error correction (EAOQEC), is the most general and powerful quantum error-correcting technique known, retaining the advantages of both entanglement-assistance and passive correction. We present the formalism, show the considerable freedom in constructing EAOQECCs from classical codes, and demonstrate the construction with examples.
Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of pre-existing entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC from any classical linear code, unlike standard QECCs which can only be constructed from dual-containing codes. Operator quantum error-correcting codes (OQECCs) allow certain errors to be corrected (or prevented) passively, reducing the complexity of the correction procedure. We combine these two extensions of standard quantum error correction into a unified entanglement- assisted quantum error correction formalism. This new scheme, which we call entanglement-assisted operator quantum error correction (EAOQEC), is the most general and powerful quantum error-correcting technique known, retaining the advantages of both entanglement-assistance and passive correction. We present the formalism, show the considerable freedom in constructing EAOQECCs from classical codes, and demonstrate the construction with examples.
We give an infinite family of degenerate entanglement-assisted quantum error-correcting codes (EAQECCs) which violate the EA-quantum Hamming bound for non-degenerate EAQECCs and achieve the EA-quantum Singleton bound, thereby proving that the EA-quantum Hamming bound does not asymptotically hold for degenerate EAQECCs. Unlike the previously known quantum error-correcting codes that violate the quantum Hamming bound by exploiting maximally entangled pairs of qubits, our codes do not require local unitary operations on the entangled auxiliary qubits during encoding. The degenerate EAQECCs we present are constructed from classical error-correcting codes with poor minimum distances, which implies that, unlike the majority of known EAQECCs with large minimum distances, our EAQECCs take more advantage of degeneracy and rely less on the error correction capabilities of classical codes.