File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s11128-010-0190-1
- Scopus: eid_2-s2.0-79956076726
- WOS: WOS:000289848800006
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes
Title | Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes | ||||
---|---|---|---|---|---|
Authors | |||||
Keywords | Adaptive algorithm Breeding method Entanglement distillation Quantum low density parity check code Random hashing Recurrence method | ||||
Issue Date | 2011 | ||||
Publisher | Springer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1570-0755 | ||||
Citation | Quantum Information Processing, 2011, v. 10 n. 2, p. 213-229 How to Cite? | ||||
Abstract | Many entanglement distillation schemes use either universal random hashing or breeding as their final step to obtain almost perfect shared EPR pairs spite of a high yield, the hardness of decoding a random linear code makes the use of random hashing and breeding infeasible in practice 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 this respect, the effectiveness of using QLDPC codes in practical entanglement distillation is illustrated. © The Author(s) 2010. | ||||
Persistent Identifier | http://hdl.handle.net/10722/145044 | ||||
ISSN | 2023 Impact Factor: 2.2 2023 SCImago Journal Rankings: 0.541 | ||||
ISI Accession Number ID |
Funding Information: Valuable discussions with C.-H. F. Fung is gratefully acknowledged. This work is supported by the RGC grant number HKU701004 of the HKSAR government. We would like to thank the Computer Center of HKU for their helpful support in providing the use of the HPCPOWER System for some of the simulations reported in this paper. | ||||
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chau, HF | en_HK |
dc.contributor.author | Ho, KH | en_HK |
dc.date.accessioned | 2012-02-21T05:42:26Z | - |
dc.date.available | 2012-02-21T05:42:26Z | - |
dc.date.issued | 2011 | en_HK |
dc.identifier.citation | Quantum Information Processing, 2011, v. 10 n. 2, p. 213-229 | en_HK |
dc.identifier.issn | 1570-0755 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/145044 | - |
dc.description.abstract | Many entanglement distillation schemes use either universal random hashing or breeding as their final step to obtain almost perfect shared EPR pairs spite of a high yield, the hardness of decoding a random linear code makes the use of random hashing and breeding infeasible in practice 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 this respect, the effectiveness of using QLDPC codes in practical entanglement distillation is illustrated. © The Author(s) 2010. | en_HK |
dc.language | eng | en_US |
dc.publisher | Springer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1570-0755 | en_HK |
dc.relation.ispartof | Quantum Information Processing | en_HK |
dc.rights | The Author(s) | en_US |
dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | en_US |
dc.subject | Adaptive algorithm | en_HK |
dc.subject | Breeding method | en_HK |
dc.subject | Entanglement distillation | en_HK |
dc.subject | Quantum low density parity check code | en_HK |
dc.subject | Random hashing | en_HK |
dc.subject | Recurrence method | en_HK |
dc.title | Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4551/resserv?sid=springerlink&genre=article&atitle=Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes&title=Quantum Information Processing&issn=15700755&date=2011-04-01&volume=10&issue=2& spage=213&authors=H. F. Chau, K. H. Ho | en_US |
dc.identifier.email | Chau, HF: hfchau@hku.hk | en_HK |
dc.identifier.authority | Chau, HF=rp00669 | en_HK |
dc.description.nature | published_or_final_version | en_US |
dc.identifier.doi | 10.1007/s11128-010-0190-1 | en_HK |
dc.identifier.scopus | eid_2-s2.0-79956076726 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-79956076726&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 10 | en_HK |
dc.identifier.issue | 2 | en_HK |
dc.identifier.spage | 213 | en_HK |
dc.identifier.epage | 229 | en_HK |
dc.identifier.eissn | 1573-1332 | en_US |
dc.identifier.isi | WOS:000289848800006 | - |
dc.publisher.place | United States | en_HK |
dc.description.other | Springer Open Choice, 21 Feb 2012 | en_US |
dc.identifier.scopusauthorid | Chau, HF=7005742276 | en_HK |
dc.identifier.scopusauthorid | Ho, KH=8314914400 | en_HK |
dc.identifier.citeulike | 7565117 | - |
dc.identifier.issnl | 1570-0755 | - |