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:quant-ph/0203039

Lower Bound for entanglement cost of antisymmetric states

Toshiyuki Shimono

Published Mar 8, 2002• 8 citations
arXivHTMLPDF

Abstract

This report gives a lower bound of entanglement cost for antisymmetric states of bipartite d-level systems to be log_2 (d/(d-1)) ebit (for d=3, E_c >= 0.585...). The paper quant-ph/0112131 claims that the value is equal to one ebit for d=3, since all of the eigenvalues of reduced matrix of any pure states living in N times tensor product of antisymmetric space is not greater than 2^(-N) thus the von Neumann entropy is not less than N, but the proof is not true. Hence whether the value is equal to or less than one ebit is not clear at this moment.

DOI
10.48550/arxiv.quant-ph/0203039

Related papers

The entanglement cost of the antisymmetric state is one ebit: Sharp purity bounds for tensor products of antisymmetric pairs

Matthew Liston

This preprint proves a sharp purity bound for arbitrary complex pure states in tensor products of antisymmetric pair spaces, across the physical cut consisting of the first system from each pair versus the second system from each pair. For every finite number m of pairs and local dimensions at least two, purity is at most 2^(-m) and entanglement entropy is at least m bits, with equality characterized by products of normalized decomposable two-forms. It derives entanglement of formation m for m copies of the normalized antisymmetric state and, using the published regularization theorem, entanglement cost one ebit for every local dimension at least two. The archive provides original formal sources and a precise account of their scope; it does not claim a complete Lean translation of every ordinary LOCC execution. Research directed and curated by Matthew Liston. The mathematics, proofs, formalization and manuscript preparation substantially involve AI systems; paper-specific attribution and checking limits are disclosed in the paper and archive. No independent human proof verification, external endorsement or peer review is claimed. Licensing: original manuscript and documentation CC BY 4.0; original code MIT. The inherited QICLean SchattenNorm helper retains Apache 2.0 and its original attribution. The archive provides the exact file-level license mapping. Manuscript revision: 22 October 2026. Research director's note — Matthew Liston: This project is motivated by philosophical exploration and curiosity about AI-assisted research. My aim in sharing these results is to make them available for scrutiny, correction and further development, so that others can build on whatever proves useful to mathematics and science. Correspondence: atemporalwalk@gmail.com.

•Oct 22, 2026•0 citations

Entanglement cost of antisymmetric states and additivity of capacity of some quantum channels

Keiji Matsumoto, Fumitaka Yura

We study the entanglement cost of the states in the antisymmetric space, which consists of ( d − 1) d -dimensional systems. The cost is always log 2 ( d − 1) ebits when the state is divided into bipartite . Combined with the arguments in [6], additivity of channel capacity of some quantum channels is also shown.

arXiv:quant-ph/0306009•Journal of Physics A Mathematical and General•Mar 29, 2004•48 citations

Entanglement cost of three-level antisymmetric states

Fumitaka Yura

We show that the entanglement cost of the three-dimensional antisymmetric states is one ebit.

arXiv:quant-ph/0302163•Journal of Physics A Mathematical and General•Apr 2, 2003•22 citations

Lower bounds on entanglement entropy without twin copy

Yannick Meurice

We discuss the possibility of estimating experimentally the von Neumann entanglement entropy S A v N of a symmetric bipartite quantum system A B by using the basic measurement counts (bitstrings) for a single copy of a prepared state. Using exact diagonalization and analog simulations performed with the publicly available QuEra facilities for chains and ladders of Rydberg atoms, we calculate the Shannon entropy S A B X associated with the bitstrings of adiabatically prepared ground states and the reduced entropies S A X and S B X obtained from the marginal probabilities in A and B . We then calculate the classical mutual information I A B X = S A X + S B X − S A B X , which is a lower bound on S A v N . We show that for a broad range of lattice spacing and detuning, I A B X is typically 20% below S A v N in regions where S A v N is large and a less close bound in regions where S A v N is low. We argue that this use of the easily available bitstrings provides a robust and efficient way to explore empirically the phase diagram of qubit-based quantum simulators and identify critical regions.

arXiv:2404.09935•Physical Review Research•Apr 24, 2025•10 citations

An entropy inequality

Meik Hellmund, Armin Uhlmann

Let $S(\rho)=-\Tr (\rho\log\rho)$ be the von Neumann entropy of an $N$-dimensional quantum state $\rho$ and $e_2(\rho)$ the second elementary symmetric polynomial of the eigenvalues of $\rho$. We prove the inequality S(\rho) \;\le \; c(N) \; \sqrt{e_2(\rho)} where $c(N)=\log(N) \, \sqrt{\frac{2N}{N-1}}$. This generalizes an inequality given by Fuchs and Graaf~\cite{fuchsgraaf} for the case of one qubit, i.e., $N=2$. Equality is achieved if and only if $\rho$ is either a pure or the maximally mixed state. This inequality delivers new bounds for quantities of interest in quantum information theory, such as upper bounds for the minimum output entropy and the entanglement of formation as well as a lower bound for the Holevo channel capacity.

arXiv:0812.0906•Quantum Information and Computation•Jul 1, 2009•4 citations

Entanglement cost of quantum depolarization

Kun Fang

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.

quant-pharXiv:2610.00187•Sep 18, 2026•0 citations
This report gives a lower bound of entanglement cost for antisymmetric states of bipartite d-level systems to be log_2 (d/(d-1)) ebit (for d=3, E_c >= 0.585...). The paper quant-ph/0112131 claims that the value is equal to one ebit for d=3, since all of the eigenvalues of reduced matrix of any pure states living in N times tensor product of antisymmetric space is not greater than 2^(-N) thus the von Neumann entropy is not less than N, but the proof is not true. Hence whether the value is equal to or less than one ebit is not clear at this moment.
This preprint proves a sharp purity bound for arbitrary complex pure states in tensor products of antisymmetric pair spaces, across the physical cut consisting of the first system from each pair versus the second system from each pair. For every finite number m of pairs and local dimensions at least two, purity is at most 2^(-m) and entanglement entropy is at least m bits, with equality characterized by products of normalized decomposable two-forms. It derives entanglement of formation m for m copies of the normalized antisymmetric state and, using the published regularization theorem, entanglement cost one ebit for every local dimension at least two. The archive provides original formal sources and a precise account of their scope; it does not claim a complete Lean translation of every ordinary LOCC execution. Research directed and curated by Matthew Liston. The mathematics, proofs, formalization and manuscript preparation substantially involve AI systems; paper-specific attribution and checking limits are disclosed in the paper and archive. No independent human proof verification, external endorsement or peer review is claimed. Licensing: original manuscript and documentation CC BY 4.0; original code MIT. The inherited QICLean SchattenNorm helper retains Apache 2.0 and its original attribution. The archive provides the exact file-level license mapping. Manuscript revision: 22 October 2026. Research director's note — Matthew Liston: This project is motivated by philosophical exploration and curiosity about AI-assisted research. My aim in sharing these results is to make them available for scrutiny, correction and further development, so that others can build on whatever proves useful to mathematics and science. Correspondence: atemporalwalk@gmail.com.
We discuss the possibility of estimating experimentally the von Neumann entanglement entropy S A v N of a symmetric bipartite quantum system A B by using the basic measurement counts (bitstrings) for a single copy of a prepared state. Using exact diagonalization and analog simulations performed with the publicly available QuEra facilities for chains and ladders of Rydberg atoms, we calculate the Shannon entropy S A B X associated with the bitstrings of adiabatically prepared ground states and the reduced entropies S A X and S B X obtained from the marginal probabilities in A and B . We then calculate the classical mutual information I A B X = S A X + S B X − S A B X , which is a lower bound on S A v N . We show that for a broad range of lattice spacing and detuning, I A B X is typically 20% below S A v N in regions where S A v N is large and a less close bound in regions where S A v N is low. We argue that this use of the easily available bitstrings provides a robust and efficient way to explore empirically the phase diagram of qubit-based quantum simulators and identify critical regions.
Let $S(\rho)=-\Tr (\rho\log\rho)$ be the von Neumann entropy of an NNN-dimensional quantum state ρ\rhoρ and e2(ρ)e_2(\rho)e2​(ρ) the second elementary symmetric polynomial of the eigenvalues of ρ\rhoρ. We prove the inequality S(\rho) \;\le \; c(N) \; \sqrt{e_2(\rho)} where c(N)=log⁡(N) 2NN−1c(N)=\log(N) \, \sqrt{\frac{2N}{N-1}}c(N)=log(N)N−12N​​. This generalizes an inequality given by Fuchs and Graaf~\cite{fuchsgraaf} for the case of one qubit, i.e., N=2N=2N=2. Equality is achieved if and only if ρ\rhoρ is either a pure or the maximally mixed state. This inequality delivers new bounds for quantities of interest in quantum information theory, such as upper bounds for the minimum output entropy and the entanglement of formation as well as a lower bound for the Holevo channel capacity.
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.