Quantum computation and quantum information
Quantum computation and quantum information
Towards measurable bounds on entanglement measures
Quantum Information Processing
An introduction to entanglement measures
Quantum Information & Computation
Hi-index | 0.00 |
We derive measurable lower bounds on concurrence of arbitrary mixed states, for bothbipartite and multipartite cases. First, we construct measurable lower bonds on thepurely algebraic bounds of concurrence [F. Mintert et al. (2004), Phys. Rev. lett., 92,167902]. Then, using the fact that the sum of the square of the algebraic bounds is alower bound of the squared concurrence, we sum over our measurable bounds to achievea measurable lower bound on concurrence. With two typical examples, we show that ourmethod can detect more entangled states and also can give sharper lower bonds thanthe similar ones.