Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0812.2993 · Physical Review A

Dynamics of the bounds of squared concurrence

Zhao Liu, Heng Fan

Published Mar 6, 2009• 12 citations
arXivHTMLPDF

Abstract

The dynamics of the quantum entanglement is a fundamental characteristic for various quantum systems. Since the computable entanglement measure for higher dimensional quantum states itself is absent, the dynamics of the entanglement expressed in an operational method will be of interest. We study the dynamics of $\ensuremath{\tau}$, an analytical lower bound of squared concurrence, of a bipartite $d\ensuremath{\bigotimes}d$ quantum state when one party goes through an arbitrary noisy channel. For a pure input state, the range of $\ensuremath{\tau}$ is obtained explicitly. For a mixed input state, an upper bound of $\ensuremath{\tau}$ is found. Interestingly, the tangle ${\ensuremath{\tau}}^{\ensuremath{'}}$, as an upper bound of squared concurrence, also has a similar dynamical property. Our results are similar to that of Konrad et al. and can help the estimation of high-dimension bipartite entanglement in experiments.

DOI
10.1103/physreva.79.032306

Related papers

Evolution of entanglement for quantum mixed states

Chang‐shui Yu, X. X. Yi, He‐Shan Song

A simple relation is introduced for concurrence to describe how much the entanglement of a bipartite system is at least left if either (or both) subsystem undergoes an arbitrary physical process. This provides a lower bound for concurrence of mixed states (pure states are included) in contrast to the upper bound given by Konrad et al. [Nat. Phys. 4, 99 (2008)]. Our results are also suitable for general high-dimensional bipartite quantum systems.

arXiv:0812.3959•Physical Review A•Dec 18, 2008•25 citations

Entanglement of formation and concurrence for mixed states

Xiu-Hong Gao, Sergio A Albeverio, Kai Chen +2 more

We review some results on analytical computations of the measures for quantum entanglement: entanglement of formation and concurrence. We introduce some estimations of the lower bounds for the entanglement of formation in bipartite mixed states, and of lower bounds for the concurrence in bipartite and tripartite systems. The results on lower bounds for the concurrence are also generalized to arbitrary multipartite systems.

Frontiers of Computer Science in China•Jun 1, 2008•27 citations

Measurable lower bounds on concurrence

Iman Sargolzahi, Sayyed Yahya Mirafzali, Mohsen Sarbishaei

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.

arXiv:0910.1928•Oct 10, 2009•0 citations

Concurrence of Mixed Bipartite Quantum States in Arbitrary Dimensions

Florian Mintert, Marek Kuś, Andreas Buchleitner

We derive a lower bound for the concurrence of mixed bipartite quantum states, valid in arbitrary dimensions. As a corollary, a weaker, purely algebraic estimate is found, which detects mixed entangled states with a positive partial transpose.

arXiv:quant-ph/0403063•Physical Review Letters•Apr 23, 2004•252 citations

Measurable lower bounds on concurrence

Iman Sargolzahi, Sayyed Yahya Mirafzali, Mohsen Sarbishaei

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 \textit{purely algebraic} bounds of concurrence [F. Mintert \textit{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.

Quantum Information and Computation•Jan 1, 2011•1 citation

A note on lower bounds of concurrence for arbitrary dimensional bipartite quantum states

Zhi-Bo Chen, Shao-Ming Fei

Abstract Quantification of quantum entanglement plays a crucial role in the study of quantum information tasks. We present analytical lower bounds for both concurrence and 2-concurrence based on the correlation matrices of bipartite quantum states. Compared with other related lower bounds, our approach provides a better estimation of the entanglement, particularly for states with large purity.

arXiv:2503.16291•Laser Physics•Mar 18, 2025•1 citation
The dynamics of the quantum entanglement is a fundamental characteristic for various quantum systems. Since the computable entanglement measure for higher dimensional quantum states itself is absent, the dynamics of the entanglement expressed in an operational method will be of interest. We study the dynamics of \ensuremathτ\ensuremath{\tau}\ensuremathτ, an analytical lower bound of squared concurrence, of a bipartite d\ensuremath⨂dd\ensuremath{\bigotimes}dd\ensuremath⨂d quantum state when one party goes through an arbitrary noisy channel. For a pure input state, the range of \ensuremathτ\ensuremath{\tau}\ensuremathτ is obtained explicitly. For a mixed input state, an upper bound of \ensuremathτ\ensuremath{\tau}\ensuremathτ is found. Interestingly, the tangle \ensuremathτ\ensuremath′{\ensuremath{\tau}}^{\ensuremath{'}}\ensuremathτ\ensuremath′, as an upper bound of squared concurrence, also has a similar dynamical property. Our results are similar to that of Konrad et al. and can help the estimation of high-dimension bipartite entanglement in experiments.
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.
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 \textit{purely algebraic} bounds of concurrence [F. Mintert \textit{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.