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:2212.09935 · ACM Symposium on Theory of Computing (STOC)

Approaching the Quantum Singleton Bound with Approximate Error Correction

Thiago Bergamaschi, Louis Golowich, Sam Gunn

Published Jun 10, 2024• 18 citations
arXivHTMLPDF

Abstract

It is well known that no quantum error correcting code of rate R can correct adversarial errors on more than a (1−R)/4 fraction of symbols. But what if we only require our codes to approximately recover the message?
DOI
10.1145/3618260.3649680

Related papers

On Bounds for Quantum Error Correcting Codes over EJ-Integers

Eda Yıldız

•Sep 14, 2018•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

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

On Bounds for Quantum Error Correcting Codes over EJ-Integers

Eda Yıldız

Electronic Notes in Discrete Mathematics•Dec 1, 2018•1 citation

Entanglement-assisted quantum communication beating the quantum Singleton bound

Markus Grassl

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.

arXiv:2007.01249•Physical Review A•Feb 24, 2021•66 citations

Constructing quantum error-correcting codes that require a variable amount of entanglement

Gaojun Luo, Martianus Frederic Ezerman, Markus Grassl +1 more

arXiv:2207.05647•Quantum Information Processing•Dec 26, 2023•53 citations
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 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.
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.