2023/11/18 by Craig Gidney, Gidney, Craig · 2 citations
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2311.10971
openalex publication_date 2023/11/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper shows that entanglement can be purified using very little storage, assuming the only source of noise is in the quantum channel being used to share the entanglement. Entangled pairs with a target infidelity of ε can be created in O(log \frac1ε) time using O(log∗ \frac1ε) storage space, where log∗ is the iterated logarithm. This is achieved by using multiple stages of error detection, with boosting within each stage. For example, the paper shows that 11 qubits of noiseless storage is enough to turn entanglement with an infidelity of 1/3 into entanglement with an infidelity of 10-1000000000000000000000000000.