Lower bound of concurrence based on generalized positive maps

DOI10.1088/0253-6102/60/6/05MaRDI QIDQ2872826zbMATH OpenOpenAlexFDO

Authors Hui-Hui Qin, Shao-Ming Fei

Publication date 16 January 2014

Published in Communications in Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.1624, http://iopscience.iop.org/0253-6102/60/6/05

zbMATH Keywords

lower bound of concurrencepositive maps

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Abstract: We study the concurrence of arbitrary dimensional bipartite quantum systems. By using a positive but not completely positive map, we present an analytical lower bound of concurrence. Detailed examples are used to show that our bound can detect entanglement better and can improve the well known existing lower bounds.

Recommendations

• Lower bound of concurrence based on D-type positive map
• A lower bound of concurrence for multipartite quantum systems
• Lower bound of concurrence for qubit systems
• Lower bound of multipartite concurrence based on sub-partite quantum systems
• A lower bound of concurrence for multipartite quantum states

Cited in

(8)

• A useful strong lower bound on two-qubit concurrence
• Positive maps constructed from permutation pairs
• Lower bound of concurrence for qubit systems
• Separability criteria and lower bound for concurrence based on Hermitian maps
• Towards measurable bounds on entanglement measures
• Improved lower bounds of concurrence and convex-roof extended negativity based on Bloch representations
• Lower bound of concurrence based on D-type positive map
• Lower bounds on concurrence and negativity from a trace inequality

This page was built for publication: Lower bound of concurrence based on generalized positive maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872826)