Operational one-to-one mapping between coherence and entanglement measures
By Huangjun Zhu, Zhihao Ma, Zhu Cao, S. Fei, Vlatko Vedral. 2017
132 citations recorded by the source corpus.
We establish a general operational one-to-one mapping between coherence measures and entanglement measures: Any entanglement measure of bipartite pure states is the minimum of a suitable coherence measure over product bases. Any coherence measure of pure states, with extension to mixed states by convex roof, is the maximum entanglement generated by incoherent operations acting on the system and an incoherent ancilla. Remarkably, the generalized CNOT gate is the universal optimal incoherent operation. In this way, all convex-roof coherence measures, including the coherence of formation, are endowed with (additional) operational interpretations. By virtue of this connection, many results on entanglement can be translated to the coherence setting, and vice versa. As applications, we provide tight observable lower bounds for generalized entanglement concurrence and coherence concurrence, which enable experimentalists to quantify entanglement and coherence of the maximal dimension in real experiments.
Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics
View Paper: https://www.semanticscholar.org/paper/659a71d5bed612e969582173729ccf35c3f50781
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Atomic and Molecular Physics, and Optics
- Gerardo Adesso
- Martin Bodo Plenio
- Alexander Streltsov
- Fernando G. S. L. Brandão
- Fabrizio Illuminati
- Susana F. Huelga
- Michael J. Hartmann
Citations in the corpus
- Colloquium: quantum coherence as a resource (2016, methodology): “A complete proof for IO in any dimension was presented recently by (Zhu et al., 2017). state with Bloch vector s = (sx, sy, sz)T via SIO, DIO, IO or MIO if and only if the following inequalities are fulfilled (Streltsov et al., 2017): s2x + s 2 y ≤ r2x + r2y , (12) 1 − s2z s2x + s2y ≥ 1 − r2z r2x +…”