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:0705.4650 · Physical Review A

Tight bounds on the concurrence of quantum superpositions

Julien Niset, Nicolas J. Cerf

Published Oct 23, 2007• 29 citations
arXivHTMLPDF

Abstract

The entanglement content of superpositions of quantum states is investigated based on a measure called concurrence. Given a bipartite pure state in arbitrary dimension written as the quantum superposition of two other such states, we find simple inequalities relating the concurrence of the state to that of its components. We derive an exact expression for the concurrence when the component states are biorthogonal and provide elegant upper and lower bounds in all other cases. For quantum bits, our upper bound is tighter than the previously derived bound [N. Linden et al., Phys. Rev. Lett. 97, 100502 (2006)].

DOI
10.1103/physreva.76.042328

Related papers

Concurrence of superpositions of many states

Seyed Javad Akhtarshenas

In this paper, we use the concurrence vector as a measure of entanglement, and investigate lower and upper bounds on the concurrence of a superposition of bipartite states as a function of the concurrence of the superposed states. We show that the amount of entanglement quantified by the concurrence vector is exactly the same as that quantified by $I$ concurrence, so that our results can be compared to those given in Phys. Rev. A 76, 042328 (2007). We obtain a tighter lower bound in the case in which the two superposed states are orthogonal. We also show that when the two superposed states are not necessarily orthogonal, both lower and upper bounds are, in general, tighter than the bounds given in terms of the $I$ concurrence. An extension of the results to the case with more than two states in the superpositions is also given.

arXiv:1010.3413•Physical Review A•Apr 8, 2011•19 citations

Reexamination of entanglement of superpositions

Gilad Gour

We find tight lower and upper bounds on the entanglement of a superposition of two bipartite states in terms of the entanglement of the two states constituting the superposition. Our upper bound is dramatically tighter than the one presented by Linden et al. [Phys. Rev. Lett. 97, 100502 (2006)] and our lower bound can be used to provide lower bounds on different measures of entanglement such as the entanglement of formation and the entanglement of subspaces. We also find that in the case in which the two states are one-sided orthogonal, the entanglement of the superposition state can be expressed explicitly in terms of the entanglement of the two states in the superposition.

arXiv:0707.1521•Physical Review A•Nov 21, 2007•31 citations

Concurrence of superpositions

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

Bounds on the concurrence of the superposition state in terms of the concurrences of the states being superposed are found in this paper. The bounds on concurrence are quite different from those on the entanglement measured by von Neumann entropy [Linden et al., Phys. Rev. Lett. 97, 100502 (2006)]. In particular, a nonzero lower bound can be provided if the states being superposed are properly constrained.

arXiv:quant-ph/0610219•Physical Review A•Feb 28, 2007•38 citations

Improved bounds on negativity of superpositions

Zhihao Ma, Zhihua Chen, Shuai Han +2 more

We consider an alternative formula for the negativity based on a simple generalization of the concurrence. We use the formula to bound the amount of entanglement in a superposition of two bipartite pure states of arbitrary dimension. Various examples indicate that our bounds are tighter than the previously known results.

Quantum Information and Computation•Nov 1, 2012•2 citations

Estimating the concurrence for quantum states via symmetric measurements

Hao-Fan Wang, Wen Zhou, Lin Chen +1 more

Concurrence is one of the most well-known entanglement measures. We show that, for arbitrary bipartite states, the lower bound of concurrence induced by symmetric measurements is always tighter than the one obtain from realignment. Besides, we derive an extended version of lower bound of concurrence induced by symmetric measurements, which can also be experimentally identified without state tomography, and further present a corresponding lower bound of genuine tripartite entanglement concurrence.

quant-pharXiv:2606.31010•Jul 1, 2026•0 citations

Multipartite entanglement of superpositions

Daniel Cavalcanti, Marcelo Terra Cunha, Antonio Acín

The entanglement of superpositions [Linden et al., Phys. Rev. Lett. 97, 100502 (2006)]is generalized to the multipartite scenario: an upper bound to the multipartite entanglement of a superposition is given in terms of the entanglement of the superposed states and the superposition coefficients. This bound is proven to be tight for a class of states composed of an arbitrary number of qubits. We also extend the result to a large family of quantifiers, which includes the negativity, the robustness of entanglement, and the best separable approximation measure.

arXiv:0705.2521•Physical Review A•Oct 23, 2007•19 citations
The entanglement content of superpositions of quantum states is investigated based on a measure called concurrence. Given a bipartite pure state in arbitrary dimension written as the quantum superposition of two other such states, we find simple inequalities relating the concurrence of the state to that of its components. We derive an exact expression for the concurrence when the component states are biorthogonal and provide elegant upper and lower bounds in all other cases. For quantum bits, our upper bound is tighter than the previously derived bound [N. Linden et al., Phys. Rev. Lett. 97, 100502 (2006)].
In this paper, we use the concurrence vector as a measure of entanglement, and investigate lower and upper bounds on the concurrence of a superposition of bipartite states as a function of the concurrence of the superposed states. We show that the amount of entanglement quantified by the concurrence vector is exactly the same as that quantified by III concurrence, so that our results can be compared to those given in Phys. Rev. A 76, 042328 (2007). We obtain a tighter lower bound in the case in which the two superposed states are orthogonal. We also show that when the two superposed states are not necessarily orthogonal, both lower and upper bounds are, in general, tighter than the bounds given in terms of the III concurrence. An extension of the results to the case with more than two states in the superpositions is also given.
We find tight lower and upper bounds on the entanglement of a superposition of two bipartite states in terms of the entanglement of the two states constituting the superposition. Our upper bound is dramatically tighter than the one presented by Linden et al. [Phys. Rev. Lett. 97, 100502 (2006)] and our lower bound can be used to provide lower bounds on different measures of entanglement such as the entanglement of formation and the entanglement of subspaces. We also find that in the case in which the two states are one-sided orthogonal, the entanglement of the superposition state can be expressed explicitly in terms of the entanglement of the two states in the superposition.
Concurrence is one of the most well-known entanglement measures. We show that, for arbitrary bipartite states, the lower bound of concurrence induced by symmetric measurements is always tighter than the one obtain from realignment. Besides, we derive an extended version of lower bound of concurrence induced by symmetric measurements, which can also be experimentally identified without state tomography, and further present a corresponding lower bound of genuine tripartite entanglement concurrence.
The entanglement of superpositions [Linden et al., Phys. Rev. Lett. 97, 100502 (2006)]is generalized to the multipartite scenario: an upper bound to the multipartite entanglement of a superposition is given in terms of the entanglement of the superposed states and the superposition coefficients. This bound is proven to be tight for a class of states composed of an arbitrary number of qubits. We also extend the result to a large family of quantifiers, which includes the negativity, the robustness of entanglement, and the best separable approximation measure.