Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes

From MaRDI portal
Publication:548217

DOI10.1007/S11128-010-0190-1zbMATH Open1217.81011arXiv0907.1130OpenAlexW1976658885MaRDI QIDQ548217FDOQ548217

Yong-Cai Geng, Sumit K. Garg

Publication date: 28 June 2011

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/0907.1130





Cites Work


Cited In (2)


   Recommendations





This page was built for publication: Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548217)