Upper and lower bounds for Tsallis-q entanglement measure

Quantification of entanglement is important but very difficult task because, in general, different measures of entanglement, which have been introduced to determine the degree of entanglement, cannot be calculated easily for arbitrary mixed states. Hence, in order to have an approximation of entangl...

Full description

Saved in:
Bibliographic Details
Published in:Quantum information processing 2020-11, Vol.19 (11), Article 413
Main Authors: Moslehi, Mahboobeh, Baghshahi, Hamid Reza, Mirafzali, Sayyed Yahya
Format: Article
Language:English
Subjects:
Data Structures and Information Theory
Entanglement
Lower bounds
Mathematical Physics
Numerical methods
Physics
Physics and Astronomy
Quantum Computing
Quantum Information Technology
Quantum Physics
Spintronics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Quantification of entanglement is important but very difficult task because, in general, different measures of entanglement, which have been introduced to determine the degree of entanglement, cannot be calculated easily for arbitrary mixed states. Hence, in order to have an approximation of entanglement, besides the numerical methods, a series of upper and lower bounds, which can be calculated analytically, have been introduced. In this paper using upper and lower bounds of concurrence and tangle, which are two measures of entanglement, and considering the relation between these measures and Tsallis- q entanglement (an another entanglement measure), upper and lower bounds for Tsallis- q entanglement for 2 ⊗ d bipartite mixed states are introduced. Then, by comparing these bounds with upper and lower bounds of concurrence and tangle, it is shown that, in wide range of parameters, the Tsallis- q entanglement bounds are tighter than the bounds of concurrence and tangle.
ISSN:1570-0755
1573-1332
DOI:10.1007/s11128-020-02926-9