• DocumentCode
    1632775
  • Title

    Extracting quantum entanglement (general entanglement purification protocols)

  • Author

    Ambainis, Andris ; Smith, Adam ; Yang, Ke

  • fYear
    2002
  • fDate
    6/24/1905 12:00:00 AM
  • Firstpage
    82
  • Lastpage
    91
  • Abstract
    We study the problem of extracting Einstein-Podolsky-Rosen (EPR) pairs from a general source of entanglement. Suppose Alice and Bob share a bipartite state ρ which is "reasonably close" to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the fidelity of ρ and a maximally entangled state. They wish to "purify" ρ using local operations and classical communication, and output a state that is arbitrarily close to EPR pairs. We prove that, on average, Alice and Bob cannot increase the fidelity of the input state significantly. On the other hand, there exist protocols that may fail with a small probability, and otherwise will output states arbitrarily close to EPR pairs with very high probability. These protocols come from the "purity-testing protocols" of H. Barnum et al. (2001)
  • Keywords
    EPR paradox; protocols; quantum communication; quantum computing; EPR pair extraction; Einstein-Podolsky-Rosen pairs; classical communication; general entanglement purification protocols; local operations; maximally entangled state; protocol failure probability; purity-testing protocols; quantum entanglement extraction; shared bipartite state; state fidelity lower bound; Boolean functions; Data mining; Data structures; Military computing; Paramagnetic resonance; Protocols; Purification; Quantum computing; Quantum entanglement; Quantum mechanics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on
  • Conference_Location
    Montreal, Que.
  • ISSN
    1093-0159
  • Print_ISBN
    0-7695-1468-5
  • Type

    conf

  • DOI
    10.1109/CCC.2002.1004345
  • Filename
    1004345