| concurrence | |
|---|---|
| Name | Concurrence |
| Field | Quantum information theory |
| Introduced | 1998 |
| Introduced by | William K. Wootters |
| Related | Entanglement measure, Quantum entanglement |
concurrence
Concurrence is a quantitative entanglement measure used to assess quantum correlations between subsystems, originally defined for two-qubit states and later extended to higher-dimensional and multipartite systems. It provides a computable scalar that reflects the degree of nonseparability of a quantum state and plays a central role in studies of quantum information theory such as quantum computing, quantum cryptography, and quantum communication. Concurrence is important because it often admits closed-form expressions, operational interpretations, and monotonicity properties under LOCC.
Concurrence was introduced in the context of quantifying entanglement for mixed states of two qubits by William K. Wootters in the late 1990s. Physically, concurrence distinguishes separable (classical-like) from entangled (nonclassical) states: a zero concurrence indicates a separable state, while a maximal value corresponds to a maximally entangled state such as a Bell state. The measure is closely related to the entanglement of formation and provides an operational way to bound resources required to create a given state under LOCC constraints. Concurrence is also used to study dynamics of entanglement in models like the Heisenberg spin chain, XXZ model, and Jaynes–Cummings model when interacting with environments described by decoherence channels such as amplitude damping or phase damping.
For a pure state |ψ⟩ of two qubits with density operator ρ=|ψ⟩⟨ψ|, the concurrence C(|ψ⟩) is defined via the spin-flipped state: C(|ψ⟩)=|⟨ψ|σ_y⊗σ_y|ψ^*⟩| where σ_y is a Pauli matrix and |ψ^*⟩ is complex conjugation in the computational basis. For a mixed state ρ of two qubits, concurrence is defined by the convex-roof extension: C(ρ)=min ∑_i p_i C(|ψ_i⟩) over ensembles {p_i,|ψ_i⟩} with ρ=∑_i p_i|ψ_i⟩⟨ψ_i|. Wootters provided an explicit formula using the eigenvalues λ_i of the non-Hermitian matrix R=ρ (σ_y⊗σ_y) ρ^* (σ_y⊗σ_y): C(ρ)=max(0, √λ_1−√λ_2−√λ_3−√λ_4). This construction uses concepts from density matrix theory, Schmidt decomposition, and matrix algebra.
For two qubits, concurrence is fully characterized by the Wootters formula and is directly linked to the entanglement of formation via a monotonic function. For higher-dimensional bipartite systems (d×d), generalizations include the I-concurrence and G-concurrence, defined respectively by Rungta et al. and Gour and others, which employ determinants and generalized Schmidt coefficients. Multipartite entanglement measures derived from concurrence include the three-tangle (residual tangle) for three qubits introduced by Coffman, Kundu, and Wootters and extensions to N-party invariants such as monogamy inequalities. In spin chains and many-body systems studied by Lieb–Mattis theorem techniques or numerically via DMRG, concurrence between pairs of sites gives insight into entanglement length and critical behaviour near quantum phase transitions (e.g., Ising model, XY model).
Concurrence is an entanglement monotone: it does not increase under stochastic LOCC and hence satisfies one of the defining properties of good entanglement measures. It is monotonically related to the entanglement of formation for two qubits through a concave mapping given by the von Neumann entropy of reduced states. Concurrence also bounds other measures: for example, it provides lower bounds to the negativity and logarithmic negativity in certain regimes and is related to relative entropy of entanglement bounds. Monogamy relations such as the Coffman–Kundu–Wootters inequality express trade-offs between pairwise concurrence and multipartite residual entanglement, linking concurrence to distribution of quantum correlations across networks studied in quantum networks and quantum error correction.
For two-qubit mixed states the Wootters algorithm reduces the convex-roof optimization to an eigenvalue problem for R, making concurrence efficiently computable. For higher dimensions the convex-roof problem is generally NP-hard; practical approaches include analytic formulas for special symmetric states (e.g., Werner states, isotropic states), semidefinite programming relaxations, and numerical convex-roof solvers. Techniques often exploit symmetries from groups like SU(2) or U(d), and use tools from linear algebra (singular value decomposition) and algebraic geometry. Software packages in quantum computing toolkits such as QuTiP and libraries in MATLAB or Python implement concurrence computations and approximations for research and experiment analysis.
Concurrence quantifies resources in protocols: it predicts performance for quantum teleportation, entanglement swapping, and quantum key distribution schemes like BB84 variants when entangled states are used. In entanglement distillation tasks concurrence helps determine yield and fidelity achievable under LOCC. In condensed-matter physics, pairwise concurrence maps reveal entanglement structure relevant to quantum phase transitions and topological phases investigated at institutions such as CERN and research groups at MIT and Caltech. In quantum metrology, concurrence contributes to understanding metrological advantage provided by entangled probes in protocols related to the Heisenberg limit.
Experimentally, concurrence can be estimated via full quantum state tomography of the density matrix ρ using apparatus in platforms like trapped ions, superconducting qubits, and photonic circuits, followed by applying the Wootters formula. Direct estimation schemes reduce measurement overhead using entanglement witnesses, collective measurements, or randomized measurement protocols such as classical shadows and Bell-state projections. Experiments demonstrating concurrence and related measures have been reported by groups at IBM Quantum, Google Quantum AI, University of Innsbruck, and University of Oxford using NV centers, optical parametric down-conversion sources, and circuit quantum electrodynamics setups. Noise characterization and error mitigation are essential when inferring concurrence from imperfect data, frequently employing bootstrapping and Bayesian estimation methods.
Category:Quantum information theory Category:Quantum entanglement