2008/01/09 by Ying Dong, Dong, Ying, Xiuhao Deng +8
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata #quant-ph
paper · pdf · doi:10.48550/arxiv.0801.1379
4 pages 2 figures
arxiv created 2008/01/09 · openalex publication_date 2008/01/09 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We provide a systematic way of constructing entanglement-assisted quantum error-correcting codes via graph states in the scenario of preexisting perfectly protected qubits. It turns out that the preexisting entanglement can help beat the quantum Hamming bound and can enhance (not only behave as an assistance) the performance of the quantum error correction. Furthermore we generalize the error models to the case of not-so-perfectly-protected qubits and introduce the quantity infidelity as a figure of merit and show that our code outperforms also the ordinary quantum error-correcting codes.