Three-qubit Protocol to Purify Generalized Werner States
详细信息    查看全文
  • 作者:M. Jafarpour ; F. Ashrafpouri
  • 关键词:Entanglement purification ; Generalized Werner state ; GHZ state ; Fidelity
  • 刊名:International Journal of Theoretical Physics
  • 出版年:2015
  • 出版时间:May 2015
  • 年:2015
  • 卷:54
  • 期:5
  • 页码:1689-1697
  • 全文大小:232 KB
  • 参考文献:1. Nielsen, MA, Chuang, IL (2000) Quantum computation and quantum information. Cambridge University Press, Cambridge
    2. Patel, A.: What is quantum computation?. arXiv:quant-ph/9909082v1 (1999)
    3. Bennett, CH, Shor, PW (1998) Quantum information theory. IEEE Trans. Inf. Theory 44: pp. 2724-2742 CrossRef
    4. Sergienco, AV, Jaeger, GS (1995) Quantum information processing and precise optical measurement with entangled-photon pairs. Contempt. Phys. 44: pp. 341-356 CrossRef
    5. Bennett, CH, DiVincenzo, DP (2000) Quantum information and computation. Nature 404: pp. 247-255 CrossRef
    6. Bennett, CH, Brassard, G, Crepeau, C, Jozsa, R, Peres, A, Wootters, WK (1993) Teleportation an unknown quantum state via dual classical and EPR channels. Phys. Rev. Lett. 70: pp. 1895-1899 CrossRef
    7. Deng, FG, Li, CY, Li, YS, Zhou, HY, Wang, Y (2005) Symmetric multiparty-controlled teleportation of an arbitrary two-particle entanglement. Phys. Rev. A 72: pp. 022338 CrossRef
    8. Ekert, AK (1991) Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett. 67: pp. 661-663 CrossRef
    9. Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution. Proceedings of In: Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, pp 175-79 (1984)
    10. Bennett, CH (1992) Quantum cryptography: uncertainty in the service of privacy. Science 257: pp. 752-753 CrossRef
    11. Jennewein, T, Simon, C, Weihs, G, Weinfurter, H, Zeilinger, A (2000) Quantum cryptography with entangled photons. Phys. Rev. Lett. 84: pp. 4729-4732 CrossRef
    12. Long, GL, Liu, XS (2002) Theoretically efficient high-capacity quantum-key-distribution scheme. Phys. Rev. A 65: pp. 032302 CrossRef
    13. Schumacher, B (1995) Quantum coding. Phys. Rev. A 51: pp. 2738-2747 CrossRef
    14. Jozsa, R, Schumacher, BJ (1994) A new proof of the quantum noiseless coding theorem. J. Mod. Opt. 41: pp. 2343-2349 CrossRef
    15. Deng, G, Long, GL, Liu, XS (2003) Two-step quantum direct communication protocol using the Einstein-Podolsky-Rosen pair block. Phys. Rev. A 68: pp. 042317 CrossRef
    16. Cleve, R, Gottesman, D, Lo, HK (1999) How to share a quantum secret?. Phys. Rev. Lett. 83: pp. 648-651 CrossRef
    17. Lance, AM, Symul, T, Bowen, WP, Sanders, BC, Lam, PK (2004) Tripartite quantum state sharing. Phys. Rev. Lett. 92: pp. 177903 CrossRef
    18. Lance, AM, Symul, T, Bowen, WP, Sanders, BC, Tyc, T, Ralph, TC, Lam, PK (2005) Continuous variable quantum state sharing via quantum disentanglement. Phys. Rev. A 71: pp. 033814 CrossRef
    19. Li, YM, Zhang, KS, Peng, KC (2004) Multiparty secret sharing of quantum information based on entanglement swapping. Phys. Lett. A 324: pp. 420-424 CrossRef
    20. Deng, FG, Li, XH, Li, CY, Zhou, P, Zhou, HY (2005) Multiparty quantum state sharing of an arbitrary two-particle state with Einstein-Podolsky-Rosen pairs. Phys. Rev. A 72: pp. 044301
  • 刊物类别:Physics and Astronomy
  • 刊物主题:Physics
    Physics
    Quantum Physics
    Elementary Particles and Quantum Field Theory
    Mathematical and Computational Physics
  • 出版者:Springer Netherlands
  • ISSN:1572-9575
文摘
Generalizing the two-qubit purification method of Bennett et al. (Phys. Rev. Lett. 76, 722-25 1996), we present a three-qubit protocol, to purify partially entangled pairs of generalized Werner states, with application of controlled-not gates, projective measurements and Pauli rotations. The protocol is simple and recyclable and the fidelity of the purified states converge rapidly to 1, after a few cycles.
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.