2009/07/07 by H. F. Chau, Chau, H. F., Kin-Chu Ho +1
Computer Science · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.0907.1130
openalex publication_date 2009/07/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Many entanglement distillation schemes use either universal random hashing or breeding as their final step to obtain almost perfect shared EPR pairs. In spite of a high yield, the hardness of decoding a random linear code makes the use of random hashing and breeding infeasible in practice. In this pilot study, we analyze the performance of the recurrence method, a well-known entanglement distillation scheme, with its final random hashing or breeding procedure being replaced by various efficiently decodable quantum codes. Among all the replacements investigated, the one using a certain adaptive quantum low density parity check (QLDPC) code is found to give the highest yield for Werner states over a wide range of noise level --- the yield for using this QLDPC code is higher than the first runner up by more than 25% over a wide parameter range. In this respect, the effectiveness of using QLDPC codes in practical entanglement distillation is illustrated.