A new entanglement measure based on the total concurrence

• URL: http://arxiv.org/abs/2512.24057v1
• Date: Tue, 30 Dec 2025 07:58:55 GMT
• Title: A new entanglement measure based on the total concurrence
• Authors: Dong-Ping Xuan, Zhong-Xi Shen, Wen Zhou, Zhi-Xi Wang, Shao-Ming Fei,
• Abstract summary: A bona fide measure of quantum entanglement is introduced, the $mathcalCt_q$-concurrence ($q geq 2$)<n>An analytical expression is derived for the $mathcalCt_q$-concurrence in the cases of isotropic and Werner states.<n>The monogamy relations that the $mathcalCt_q$-concurrence satisfies for qubit systems are examined.
• Score: 2.003078340059495
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum entanglement is a crucial resource in quantum information processing, advancing quantum technologies. The greater the uncertainty in subsystems' pure states, the stronger the quantum entanglement between them. From the dual form of $q$-concurrence ($q\geq 2$) we introduce the total concurrence. A bona fide measure of quantum entanglement is introduced, the $\mathcal{C}^{t}_q$-concurrence ($q \geq 2$), which is based on the total concurrence. Analytical lower bounds for the $\mathcal{C}^{t}_q$-concurrence are derived. In addition, an analytical expression is derived for the $\mathcal{C}^{t}_q$-concurrence in the cases of isotropic and Werner states. Furthermore, the monogamy relations that the $\mathcal{C}^{t}_q$-concurrence satisfies for qubit systems are examined. Additionally, based on the parameterized $α$-concurrence and its complementary dual, the $\mathcal{C}^{t}_α$-concurrence $(0\leqα\leq\frac{1}{2})$ is also proposed.

Related papers

• Two-parameter bipartite entanglement measure [4.908885505207505]
  Entanglement concurrence is an important bipartite entanglement measure that has found wide applications in quantum technologies.<n>We introduce a two- parameter family of entanglement measures, referred to as the unified $(q,s)$-concurrence.<n>Explicit expressions are obtained for the unified $(q,s)$-concurrence in the cases of isotropic and Werner states.
  arXiv  Detail & Related papers  (2026-01-30T05:09:31Z)
• Generalized quantum Zernike Hamiltonians: Polynomial Higgs-type algebras and algebraic derivation of the spectrum [0.0]
  We consider the quantum analog of the generalized Zernike systems given by the Hamiltonian.<n>This two-dimensional quantum model exhibits higher-order integrals of motion within the enveloping algebra of the Heisenberg algebra.
  arXiv  Detail & Related papers  (2025-02-04T17:06:54Z)
• On estimating the trace of quantum state powers [11.63482880743131]
  We investigate the computational complexity of estimating the trace of quantum state powers $texttr(rhoq)$ for an $n$-qubit mixed quantum state $rho$.<n>Our speedup is achieved by introducing efficiently computable uniform approximations of positive power functions into quantum singular value transformation.
  arXiv  Detail & Related papers  (2024-10-17T13:57:13Z)
• G_q-concurrence and entanglement constraints in multiqubit systems [2.150800093140658]
  We show that $G_q$-concurrence satisfies all the axiomatic conditions of an entanglement measure and can be considered as a generalization of concurrence. We construct a set of entanglement indicators that can detect genuinely multiqubit entangled states even when the tangle loses its efficacy.
  arXiv  Detail & Related papers  (2024-06-27T11:07:51Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Quantum Current and Holographic Categorical Symmetry [62.07387569558919]
  A quantum current is defined as symmetric operators that can transport symmetry charges over an arbitrary long distance. The condition for quantum currents to be superconducting is also specified, which corresponds to condensation of anyons in one higher dimension.
  arXiv  Detail & Related papers  (2023-05-22T11:00:25Z)
• Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling [30.53587208999909]
  We give a quantum algorithm for computing an $epsilon$-approximate Nash equilibrium of a zero-sum game in a $m times n$ payoff matrix with bounded entries. Given a standard quantum oracle for accessing the payoff matrix our algorithm runs in time $widetildeO(sqrtm + ncdot epsilon-2.5 + epsilon-3)$ and outputs a classical representation of the $epsilon$-approximate Nash equilibrium.
  arXiv  Detail & Related papers  (2023-01-10T02:56:49Z)
• Sample optimal tomography of quantum Markov chains [23.427626096032803]
  A state on a tripartite quantum system $mathcalH_Aotimes mathcalH_B$ forms a Markov chain, i.e., quantum conditional independence, if it can be reconstructed from its marginal on $mathcalH_Aotimes mathcalH_B$. A quantum operation from $mathcalH_B$ to $mathcalH_BotimesmathcalH_C$ via the
  arXiv  Detail & Related papers  (2022-09-06T06:30:37Z)
• On quantum algorithms for the Schr\"odinger equation in the semi-classical regime [27.175719898694073]
  We consider Schr"odinger's equation in the semi-classical regime. Such a Schr"odinger equation finds many applications, including in Born-Oppenheimer molecular dynamics and Ehrenfest dynamics.
  arXiv  Detail & Related papers  (2021-12-25T20:01:54Z)
• Emulating Quantum Interference with Generalized Ising Machines [0.0]
  This paper presents an exact and general procedure for mapping any sequence of quantum gates onto a network of probabilistic p-bits. We can view this structure as a Boltzmann machine whose states each represent a Feynman path leading from an initial configuration of qubits to a final configuration. Our results for mapping an arbitrary quantum circuit to a Boltzmann machine with a complex energy function should help push the boundaries of the simulability of quantum circuits with probabilistic resources.
  arXiv  Detail & Related papers  (2020-07-14T22:10:29Z)
• Quasi-polynomial time algorithms for free quantum games in bounded dimension [11.56707165033]
  We give a semidefinite program of size $exp(mathcalObig(T12(log2(AT)+log(Q)log(AT))/epsilon2big)) to compute additive $epsilon$-approximations on the values of two-player free games. We make a connection to the quantum separability problem and employ improved multipartite quantum de Finetti theorems with linear constraints.
  arXiv  Detail & Related papers  (2020-05-18T16:55:08Z)
• Quantization of the 1-D forced harmonic oscillator in the space ($x, v$) [0.0]
  For the resonant case, both forms of quantization are different. The average energy of the system is higher in ($x,hat p$) quantization than on the $(x,hat v$) quantization. The Boltzmann-Shannon entropy on the ($x,hat p$) quantization is higher than on the ($x,hat v$) quantization.
  arXiv  Detail & Related papers  (2020-04-29T21:29:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.