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:2007.01249 · Physical Review A

Entanglement-assisted quantum communication beating the quantum Singleton bound

Markus Grassl

Published Feb 24, 2021• 62 citations
arXivHTMLPDF

Abstract

Brun, Devetak, and Hsieh [Science 314, 436 (2006)] demonstrated that preshared entanglement between the sender and receiver enables quantum communication protocols that have better parameters than schemes without the assistance of entanglement. Subsequently, the same authors derived a version of the so-called quantum Singleton bound that relates the parameters of the entanglement-assisted quantum-error-correcting codes proposed by them. We present an entanglement-assisted quantum communication scheme with parameters violating this bound in certain ranges. For a fixed transmission rate, our scheme allows one to correct a larger fraction of errors.

DOI
10.1103/physreva.103.l020601

Related papers

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

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

LiRuihu, GuoLuobin, XuZongben

We give an infinite family of degenerate entanglement-assisted quantum error-correcting codes (EAQECCs) which violate the EA-quantum Hamming bound for nondegenerate EAQECCs and achieve the EA-quant...

Quantum Information and Computation•Oct 1, 2014•0 citations

Entanglement-assisted concatenated quantum codes

Jihao Fan, Jun Li, Yongbin Zhou +2 more

Entanglement-assisted concatenated quantum codes (EACQCs), constructed by concatenating two quantum codes, are proposed. These EACQCs show significant advantages over standard concatenated quantum codes (CQCs). First, we prove that, unlike standard CQCs, EACQCs can beat the nondegenerate Hamming bound for entanglement-assisted quantum error-correction codes (EAQECCs). Second, we construct families of EACQCs with parameters better than the best-known standard quantum error-correction codes (QECCs) and EAQECCs. Moreover, these EACQCs require very few Einstein-Podolsky-Rosen (EPR) pairs to begin with. Finally, it is shown that EACQCs make entanglement-assisted quantum communication possible, even if the ebits are noisy. Furthermore, EACQCs can outperform CQCs in entanglement fidelity over depolarizing channels if the ebits are less noisy than the qubits. We show that the error-probability threshold of EACQCs is larger than that of CQCs when the error rate of ebits is sufficiently lower than that of qubits. Specifically, we derive a high threshold of 47% when the error probability of the preshared entanglement is 1% to that of qubits.

arXiv:2202.08084•Proceedings of the National Academy of Sciences•Jun 10, 2022•14 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•131 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•25 citations

Quantum Error Correction via Less Noisy Qubits

Yuichiro Fujiwara

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.

arXiv:1302.5081•Physical Review Letters•Apr 22, 2013•14 citations
Brun, Devetak, and Hsieh [Science 314, 436 (2006)] demonstrated that preshared entanglement between the sender and receiver enables quantum communication protocols that have better parameters than schemes without the assistance of entanglement. Subsequently, the same authors derived a version of the so-called quantum Singleton bound that relates the parameters of the entanglement-assisted quantum-error-correcting codes proposed by them. We present an entanglement-assisted quantum communication scheme with parameters violating this bound in certain ranges. For a fixed transmission rate, our scheme allows one to correct a larger fraction of errors.
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.
Entanglement-assisted concatenated quantum codes (EACQCs), constructed by concatenating two quantum codes, are proposed. These EACQCs show significant advantages over standard concatenated quantum codes (CQCs). First, we prove that, unlike standard CQCs, EACQCs can beat the nondegenerate Hamming bound for entanglement-assisted quantum error-correction codes (EAQECCs). Second, we construct families of EACQCs with parameters better than the best-known standard quantum error-correction codes (QECCs) and EAQECCs. Moreover, these EACQCs require very few Einstein-Podolsky-Rosen (EPR) pairs to begin with. Finally, it is shown that EACQCs make entanglement-assisted quantum communication possible, even if the ebits are noisy. Furthermore, EACQCs can outperform CQCs in entanglement fidelity over depolarizing channels if the ebits are less noisy than the qubits. We show that the error-probability threshold of EACQCs is larger than that of CQCs when the error rate of ebits is sufficiently lower than that of qubits. Specifically, we derive a high threshold of 47% when the error probability of the preshared entanglement is 1% to that of qubits.
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.
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.