Compare Papers
Paper 1
All-optical cat-code quantum error correction
Jacob Hastrup, Ulrik Lund Andersen
- Year
- 2022
- Journal
- Physical Review Research
- DOI
- 10.1103/PhysRevResearch.4.043065
- arXiv
- -
The cat code is a promising encoding scheme for bosonic quantum error correction as it allows for correction against losses—the dominant error mechanism in most bosonic systems. However, it has remained unclear how the required syndrome measurement and recovery can be implemented in the optical regime. Here, we introduce a teleportation-based error-correction scheme for the cat code, using elements suitable for an optical setting. The scheme detects and corrects single-photon losses while restoring the amplitude of the cat states, thereby greatly suppressing the accumulation of errors in lossy channels.
Open paperPaper 2
Entanglement-assisted Quantum Error Correcting Code Saturating The Classical Singleton Bound
Soham Ghosh, Evagoras Stylianou, Holger Boche
- Year
- 2024
- Journal
- arXiv preprint
- DOI
- arXiv:2410.04130
- arXiv
- 2410.04130
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.
Open paper