Threefold entanglement matching

Threefold entanglement matching We address the problem of entanglement matching in the probabilistic teleportation scheme by considering two independent levels of entanglement in the measurement basis. The probability of a successful teleportation has an upper bound which only depends on the amount of entanglement of the quantum channel. However, we found that each entanglement of the measurement basis contributes independently to the success probability as long as it is weaker than the entanglement of the channel. Accordingly, the teleportation process reaches its optimal probability when both entanglements of the measurement basis match the entanglement of the channel. Additionally, we study the probabilistic scheme for extracting an unknown state from a partially known state. We characterize the success probability and the concurrence involved in that process. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Threefold entanglement matching

Loading next page...
 
/lp/springer_journal/threefold-entanglement-matching-06eGxkg0jw
Publisher
Springer US
Copyright
Copyright © 2015 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-015-1118-6
Publisher site
See Article on Publisher Site

Abstract

We address the problem of entanglement matching in the probabilistic teleportation scheme by considering two independent levels of entanglement in the measurement basis. The probability of a successful teleportation has an upper bound which only depends on the amount of entanglement of the quantum channel. However, we found that each entanglement of the measurement basis contributes independently to the success probability as long as it is weaker than the entanglement of the channel. Accordingly, the teleportation process reaches its optimal probability when both entanglements of the measurement basis match the entanglement of the channel. Additionally, we study the probabilistic scheme for extracting an unknown state from a partially known state. We characterize the success probability and the concurrence involved in that process.

Journal

Quantum Information ProcessingSpringer Journals

Published: Sep 14, 2015

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from Google Scholar, PubMed
Create lists to organize your research
Export lists, citations
Access to DeepDyve database
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off