Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Entropy and Optimal Decompositions of States Relative to a Maximal Commutative Subalgebra
Open Systems & Information Dynamics
Quantum Information & Computation
Evolution from entanglement to decoherence of bipartite mixed "X" states
Quantum Information & Computation
Concurrence for infinite-dimensional quantum systems
Quantum Information Processing
Multipartite concurrence for $$X$$X states under decoherence
Quantum Information Processing
| Hi-index | 0.00 |
A new strong lower bound on concurrence for two-qubit states is derived. Its equality with the concurrence itself for the pure- and X-states is proved analytically; while extensive numerical computations show that equality for a general mixed state may also exist. Being a very simple function and easy to calculate, it is more convenient and practical than the exact value in some cases, including entanglement investigations in spin chains. We study thermal localizable entanglement in spin chains as an example, to demonstrate the convenience of this bound.