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.
Adaptive Channel Reshaping for Improved Entanglement Distillation
School of Computer and Communication Sciences, EPFL(EPFL计算机与通信科学学院);IBM Quantum, IBM T.J. Watson Research Center(IBM量子,IBM T.J.沃森研究中心);IBM Quantum, Almaden Research Center(IBM量子,阿尔马登研究中心);IBM Research, IBM Research India(IBM研究,IBM印度研究中心)
Constant-Overhead Fault-Tolerant Bell-Pair Distillation using High-Rate Codes
Harvard University(哈佛大学);QuEra Computing Inc.(QuEra计算公司);Caltech(加州理工学院);Massachusetts Institute of Technology(麻省理工学院);The University of Chicago(芝加哥大学)
Improving Entanglement Resilience in Quantum Memories with Error-Detection-Based Distillation
School of Electrical Engineering, Korea University(韩国大学电气工程学院);Quantum Network Research Center, Korea Institute of Science and Technology Information(韩国科学技术信息研究院量子网络研究中心)