Quantum Information and Computation, ( ISI ), Volume (11), No (1), Year (2011-1) , Pages (79-94)

Title : ( Measurable lower bounds on concurrence )

Authors: Iman Sargolzahi , sayed yahya mirafzali , Mohsen Sarbishaei ,

Citation: BibTeX | EndNote

We derive measurable lower bounds on concurrence of arbitrary mixed states, for both bipartite and multipartite cases. First, we construct measurable lower bonds on the purely 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 a lower bound of the squared concurrence, we sum over our measurable bounds to achieve a measurable lower bound on concurrence. With two typical examples, we show that our method can detect more entangled states and also can give sharper lower bonds than the similar ones.


, Measuring entanglement,
برای دانلود از شناسه و رمز عبور پرتال پویا استفاده کنید.

author = {Sargolzahi, Iman and Mirafzali, Sayed Yahya and Sarbishaei, Mohsen},
title = {Measurable lower bounds on concurrence},
journal = {Quantum Information and Computation},
year = {2011},
volume = {11},
number = {1},
month = {January},
issn = {1533-7146},
pages = {79--94},
numpages = {15},
keywords = {Measuring entanglement; Concurrence},


%0 Journal Article
%T Measurable lower bounds on concurrence
%A Sargolzahi, Iman
%A Mirafzali, Sayed Yahya
%A Sarbishaei, Mohsen
%J Quantum Information and Computation
%@ 1533-7146
%D 2011