Towards measurable bounds on entanglement measures
Remigiusz Augusiak, Maciej Lewenstein

TL;DR
This paper develops methods to establish measurable bounds on entanglement measures, especially concurrence, using positive maps and two-copy observables, improving detection capabilities for quantum entanglement.
Contribution
It introduces a general framework for constructing measurable lower bounds on concurrence from positive maps, extending previous bounds and including the transposition map case.
Findings
New bounds are positive where previous bounds are zero.
The method generalizes the Mintert--Buchleitner bound.
Upper bounds on all concurrences are provided.
Abstract
While the experimental detection of entanglement provides already quite a difficult task, experimental quantification of entanglement is even more challenging, and has not yet been studied thoroughly. In this paper we discuss several issues concerning bounds on concurrence measurable collectively on copies of a given quantum state. Firstly, we concentrate on the recent bound on concurrence by Mintert--Buchleitner [F. Mintert and A. Buchleitner, Phys. Rev. Lett. 98, 140505 (2007)]. Relating it to the reduction criterion for separability we provide yet another proof of the bound and point out some possibilities following from the proof which could lead to improvement of the bound. Then, relating concurrence to the generalized robustness of entanglement, we provide a method allowing for construction of lower bounds on concurrence from any positive map (not only the reduction one). All…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
