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:2610.00187

Entanglement cost of quantum depolarization

Kun Fang

quant-phcs.ITSubmitted Sep 17, 2026• Announced Sep 18, 2026• 0 citations
arXivHTMLPDF

Abstract

Entanglement cost is the asymptotic rate of Bell pairs required to prepare a quantum state. Its regularized definition has made exact evaluation difficult, even for isotropic states (i.e., depolarized maximally entangled states). In this work, we determine the entanglement cost of every qubit isotropic state and, more generally, every two-qubit Bell-diagonal state. Our proof uses a family of suitably tuned qubit semigroups to transform a general log-Sobolev entropy bound into supporting lines of Wootters' function. A recent exact tensorization theorem of Dong et al. [arXiv:2606.17729] extends these bounds to arbitrarily many copies, yielding a general lower bound on entanglement cost. Matching this bound with the entanglement of formation also determines the exact cost for a broader class of two-qubit states. For qudit isotropic states, we derive another general lower bound from the full depolarizing $2\to 3$ norm. This bound substantially improves on the PPT-relative entropy of entanglement and nearly matches the entanglement of formation, leaving a gap of at most $2\%$ of $\log d$ that vanishes as $d$ grows. Finally, the exact qubit results and qudit bounds extend to the entanglement cost of preparing quantum depolarizing channels under both parallel and sequential strategies.

AI Summary

Entanglement cost is the regularized entanglement of formation, so a single-copy formula does not exclude savings from collective preparation. This paper determines the cost for qubit isotropic states and all two-qubit Bell-diagonal states, and bounds it for higher-dimensional isotropic states. For every two-qubit state, it proves $E_C(\rho)\geq W(2F_{\max}(\rho)-1)$, where $F_{\max}$ is the maximum overlap with a maximally entangled state and $W(c)=h_2((1+\sqrt{1-c^2})/2)$, extended by zero for negative arguments. The bound equals $E_F$ whenever normalized negativity equals concurrence. Consequently, a Bell-diagonal state with largest Bell weight $q_{\max}$ has $E_C=E_F=W(2q_{\max}-1)$; for a qubit isotropic state with depolarizing noise $p$, this becomes $W(1-3p/2)$. The qubit proof tunes reversible qubit semigroups so that log-Sobolev entropy inequalities reproduce supporting lines of $W$. A recent exact tensorization theorem extends these inequalities to arbitrary copy numbers. In dimension $d\geq3$, an exact depolarizing $2\to3$ norm calculation and multiplicativity argument yield another entangled-fraction lower bound. For isotropic states, its gap from $E_F$ is numerically below $2\%$ of $\log d$ for every integer $3\leq d\leq10^4$, peaking near $1.989\%$ at $d=8$. Analytically, the absolute gap vanishes uniformly over noise as $O(d^{-2/3})$. Known Choi-state reductions transfer these results to parallel and adaptive sequential depolarizing-channel simulation. Exact costs remain unresolved for qudit isotropic states and general two-qubit states outside the identified class.

No sign of AI-generated textOverclaims

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
comments are welcome

Related papers

Entanglement Cost of Optimal Distributed Quantum State Purification

Jiayi Zhao, Chengkai Zhu, Xin Wang +1 more

We determine the preshared entanglement required for spatially separated parties, restricted to local operations and classical communication, to attain globally optimal probabilistic two-copy purification of arbitrary bipartite pure states under depolarizing noise. In every local dimension $d\ge 2$, one shared maximally entangled qubit pair suffices: local controlled-SWAP operations exactly reproduce the globally optimal successful transformation. Conversely, any finite-dimensional preshared resource state that attains the same benchmark, even under a positive-partial-transpose relaxation, must have entanglement of formation at least one ebit. For pure resources with one ebit, or for two-qubit resources including mixed states, attaining the benchmark is possible only for states with exactly two nonzero Schmidt weights, both equal to $1/2$, namely those locally unitarily equivalent to a maximally entangled qubit pair. These findings provide a benchmark for evaluating the entanglement demands of noise management in quantum networks and modular quantum computers.

quant-pharXiv:2609.23441•Sep 22, 2026•0 citations

Entanglement Cost of Bipartite Mixed States

Guifré Vidal, Wolfgang Dür, J. I. Cirac

We compute the entanglement cost of several families of bipartite mixed states, including arbitrary mixtures of two Bell states. This is achieved by developing a technique that allows us to ascertain the additivity of the entanglement of formation for any state supported on specific subspaces. As a side result, the proof of the irreversibility in asymptotic local manipulations of entanglement is extended to two-qubit systems.

arXiv:quant-ph/0112131•Physical Review Letters•Jun 20, 2002•160 citations

Classical Capacity and Entanglement Cost of the Amplitude Damping Channel

Ziao Tang, Chengkai Zhu, Ge Bai +1 more

Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel entanglement cost are additive with those of any finite-dimensional partner channel. This class includes all qubit-to-qubit channels of Kraus rank at most two. For the amplitude damping channel with damping probability $p$, the unassisted classical capacity equals the known single-use Holevo information, attained by a binary pure-state ensemble with collective decoding, and the entanglement cost is $h_2((1+\sqrt p)/2)$ ebits per use. The common mechanism is a support criterion for strong superadditivity of entanglement of formation: one marginal has no support on the sector in which both local systems are orthogonal to fixed distinguished vectors. We prove this criterion in arbitrary finite dimensions using a triangular block-matrix entropy inequality and decompositions preserving two expectations. For amplitude damping, we also derive an exact finite-block Holevo deficit, identify the unique optimal average input for $p<1$, and construct a binary Kraus representation attaining the uniform formation bound.

quant-pharXiv:2609.28592•Sep 24, 2026•3 citations

Lower bound on entanglement of formation for the qubit-qudit system

E. Gerjuoy

Wootters [Phys. Rev. Lett. $80,$ 2245 (1998)] has derived a closed formula for the entanglement of formation (EOF) of an arbitrary mixed state in a system of two qubits. There is no known closed-form expression for the EOF of an arbitrary mixed state in any system more complicated than two qubits. This paper, via a relatively straightforward generalization of Wootters' original derivation, obtains a closed-form lower bound on the EOF of an arbitary mixed state of a system composed of a qubit and a qudit (a d-level quantum system, with $d>~3).$ The derivation of the lower bound is detailed for a system composed of a qubit and a qutrit $(d=3);$ the generalization to $d>3$ then follows readily.

arXiv:quant-ph/0301015•Physical Review A•May 23, 2003•59 citations

Tight Entropy Contraction of Generalized Quantum Depolarization

Li Gao, Long Zhao

We establish upper and lower bounds for relative entropy contraction of generalized quantum depolarizing channels and semigroups. Our bound provides tight first order asymptotic of the contraction rate in terms of the dimension constant. One side estimate are based on sharp reverse ratio and convexity of relative entropy of two states, which can be derived from the recently introduced Hockey-Stick quantum $f$-divergence, and also independently, Bogoliubov--Kubo--Mori quantum Fisher information metric. The other side follows from the existence of index achieving pure state with respect to a general conditional expectation. Our results extend to the complete entropy contraction rate, tensor stable estimates for product dynamics. Examples include quantum depolarization, dephasing, and compact group symmetrization, with consequences for the decay rate of coherence and asymmetry.

quant-pharXiv:2608.19685•Aug 21, 2026•5 citations

Computable and Faithful Lower Bound on Entanglement Cost

Xin Wang, Mingrui Jing, Chengkai Zhu

Quantifying the minimum entanglement needed to prepare quantum states and implement quantum processes is a key challenge in quantum information theory. In this Letter, we develop computable and faithful lower bounds on the entanglement cost under quantum operations that completely preserve the positivity of partial transpose (PPT operations), by introducing the generalized divergence of k-negativity, a generalization of logarithmic negativity. Our bounds are efficiently computable via semidefinite programming and provide nontrivial values for all states that are non-PPT (NPT), establishing their faithfulness for the resource theory of NPT entanglement. Notably, we find and affirm the irreversibility of asymptotic entanglement manipulation under PPT operations for full-rank entangled states. Furthermore, we extend our methodology to derive lower bounds on the entanglement cost of both point-to-point and bipartite quantum channels. Our bound demonstrates improvements over previously known computable bounds for a wide range of quantum states and channels. These findings push the boundaries of understanding the structure of entanglement and the fundamental limits of entanglement manipulation.

arXiv:2311.10649•Physical Review Letters•May 15, 2025•5 citations
Entanglement cost is the asymptotic rate of Bell pairs required to prepare a quantum state. Its regularized definition has made exact evaluation difficult, even for isotropic states (i.e., depolarized maximally entangled states). In this work, we determine the entanglement cost of every qubit isotropic state and, more generally, every two-qubit Bell-diagonal state. Our proof uses a family of suitably tuned qubit semigroups to transform a general log-Sobolev entropy bound into supporting lines of Wootters' function. A recent exact tensorization theorem of Dong et al. [arXiv:2606.17729] extends these bounds to arbitrarily many copies, yielding a general lower bound on entanglement cost. Matching this bound with the entanglement of formation also determines the exact cost for a broader class of two-qubit states. For qudit isotropic states, we derive another general lower bound from the full depolarizing 2→32\to 32→3 norm. This bound substantially improves on the PPT-relative entropy of entanglement and nearly matches the entanglement of formation, leaving a gap of at most 2%2\%2% of log⁡d\log dlogd that vanishes as ddd grows. Finally, the exact qubit results and qudit bounds extend to the entanglement cost of preparing quantum depolarizing channels under both parallel and sequential strategies.
Entanglement cost is the regularized entanglement of formation, so a single-copy formula does not exclude savings from collective preparation. This paper determines the cost for qubit isotropic states and all two-qubit Bell-diagonal states, and bounds it for higher-dimensional isotropic states.
For every two-qubit state, it proves EC(ρ)≥W(2Fmax⁡(ρ)−1)E_C(\rho)\geq W(2F_{\max}(\rho)-1)EC​(ρ)≥W(2Fmax​(ρ)−1), where Fmax⁡F_{\max}Fmax​ is the maximum overlap with a maximally entangled state and W(c)=h2((1+1−c2)/2)W(c)=h_2((1+\sqrt{1-c^2})/2)W(c)=h2​((1+1−c2​)/2), extended by zero for negative arguments. The bound equals EFE_FEF​ whenever normalized negativity equals concurrence. Consequently, a Bell-diagonal state with largest Bell weight qmax⁡q_{\max}qmax​ has EC=EF=W(2qmax⁡−1)E_C=E_F=W(2q_{\max}-1)EC​=EF​=W(2qmax​−1); for a qubit isotropic state with depolarizing noise ppp, this becomes W(1−3p/2)W(1-3p/2)W(1−3p/2).
The qubit proof tunes reversible qubit semigroups so that log-Sobolev entropy inequalities reproduce supporting lines of WWW. A recent exact tensorization theorem extends these inequalities to arbitrary copy numbers. In dimension d≥3d\geq3d≥3, an exact depolarizing 2→32\to32→3 norm calculation and multiplicativity argument yield another entangled-fraction lower bound. For isotropic states, its gap from EFE_FEF​ is numerically below 2%2\%2% of log⁡d\log dlogd for every integer 3≤d≤1043\leq d\leq10^43≤d≤104, peaking near 1.989%1.989\%1.989% at d=8d=8d=8. Analytically, the absolute gap vanishes uniformly over noise as O(d−2/3)O(d^{-2/3})O(d−2/3).
Known Choi-state reductions transfer these results to parallel and adaptive sequential depolarizing-channel simulation. Exact costs remain unresolved for qudit isotropic states and general two-qubit states outside the identified class.
We determine the preshared entanglement required for spatially separated parties, restricted to local operations and classical communication, to attain globally optimal probabilistic two-copy purification of arbitrary bipartite pure states under depolarizing noise. In every local dimension d≥2d\ge 2d≥2, one shared maximally entangled qubit pair suffices: local controlled-SWAP operations exactly reproduce the globally optimal successful transformation. Conversely, any finite-dimensional preshared resource state that attains the same benchmark, even under a positive-partial-transpose relaxation, must have entanglement of formation at least one ebit. For pure resources with one ebit, or for two-qubit resources including mixed states, attaining the benchmark is possible only for states with exactly two nonzero Schmidt weights, both equal to 1/21/21/2, namely those locally unitarily equivalent to a maximally entangled qubit pair. These findings provide a benchmark for evaluating the entanglement demands of noise management in quantum networks and modular quantum computers.
Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel entanglement cost are additive with those of any finite-dimensional partner channel. This class includes all qubit-to-qubit channels of Kraus rank at most two. For the amplitude damping channel with damping probability ppp, the unassisted classical capacity equals the known single-use Holevo information, attained by a binary pure-state ensemble with collective decoding, and the entanglement cost is h2((1+p)/2)h_2((1+\sqrt p)/2)h2​((1+p​)/2) ebits per use. The common mechanism is a support criterion for strong superadditivity of entanglement of formation: one marginal has no support on the sector in which both local systems are orthogonal to fixed distinguished vectors. We prove this criterion in arbitrary finite dimensions using a triangular block-matrix entropy inequality and decompositions preserving two expectations. For amplitude damping, we also derive an exact finite-block Holevo deficit, identify the unique optimal average input for p<1p<1p<1, and construct a binary Kraus representation attaining the uniform formation bound.
Wootters [Phys. Rev. Lett. 80,80,80, 2245 (1998)] has derived a closed formula for the entanglement of formation (EOF) of an arbitrary mixed state in a system of two qubits. There is no known closed-form expression for the EOF of an arbitrary mixed state in any system more complicated than two qubits. This paper, via a relatively straightforward generalization of Wootters' original derivation, obtains a closed-form lower bound on the EOF of an arbitary mixed state of a system composed of a qubit and a qudit (a d-level quantum system, with d> 3).d>~3).d> 3). The derivation of the lower bound is detailed for a system composed of a qubit and a qutrit (d=3);(d=3);(d=3); the generalization to d>3d>3d>3 then follows readily.
We establish upper and lower bounds for relative entropy contraction of generalized quantum depolarizing channels and semigroups. Our bound provides tight first order asymptotic of the contraction rate in terms of the dimension constant. One side estimate are based on sharp reverse ratio and convexity of relative entropy of two states, which can be derived from the recently introduced Hockey-Stick quantum fff-divergence, and also independently, Bogoliubov--Kubo--Mori quantum Fisher information metric. The other side follows from the existence of index achieving pure state with respect to a general conditional expectation. Our results extend to the complete entropy contraction rate, tensor stable estimates for product dynamics. Examples include quantum depolarization, dephasing, and compact group symmetrization, with consequences for the decay rate of coherence and asymmetry.
Quantifying the minimum entanglement needed to prepare quantum states and implement quantum processes is a key challenge in quantum information theory. In this Letter, we develop computable and faithful lower bounds on the entanglement cost under quantum operations that completely preserve the positivity of partial transpose (PPT operations), by introducing the generalized divergence of k-negativity, a generalization of logarithmic negativity. Our bounds are efficiently computable via semidefinite programming and provide nontrivial values for all states that are non-PPT (NPT), establishing their faithfulness for the resource theory of NPT entanglement. Notably, we find and affirm the irreversibility of asymptotic entanglement manipulation under PPT operations for full-rank entangled states. Furthermore, we extend our methodology to derive lower bounds on the entanglement cost of both point-to-point and bipartite quantum channels. Our bound demonstrates improvements over previously known computable bounds for a wide range of quantum states and channels. These findings push the boundaries of understanding the structure of entanglement and the fundamental limits of entanglement manipulation.