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/0003038

On the Additivity of the Entanglement of Formation

Barbara M. Terhal

Published Mar 10, 2000• 4 citations
arXivHTMLPDF

Abstract

We withdraw this paper due to insufficient arguments in the derivation of Theorem 1. See quant-ph/0005062 for the new paper
DOI
10.48550/arxiv.quant-ph/0003038

Related papers

A counterexample to a conjectured entanglement inequality

Reinhard F. Werner, K. G. H. Vollbrecht

We give an explicit counterexample to an entanglement inequality suggested in a recent paper [quant-ph/0005126] by Benatti and Narnhofer. The inequality would have had far-reaching consequences, including the additivity of the entanglement of formation.

arXiv:quant-ph/0006046•Jun 9, 2000•4 citations

On Strong Superadditivity of the Entanglement of Formation

Koenraad M.R. Audenaert, Samuel L. Braunstein

arXiv:quant-ph/0303045•Communications in Mathematical Physics•Apr 1, 2004•76 citations

Towards Additivity of Entanglement of Formation

Toshiyuki Shimono

Lecture notes in computer science•Jan 1, 2002•1 citation

How hard is it to approximate the Jones polynomial?

Greg Kuperberg

Freedman, Kitaev, and Wang [arXiv:quant-ph/0001071], and later Aharonov, Jones, and Landau [arXiv:quant-ph/0511096], established a quantum algorithm to "additively" approximate the Jones polynomial V(L,t) at any principal root of unity t. The strength of this additive approximation depends exponentially on the bridge number of the link presentation. Freedman, Larsen, and Wang [arXiv:math/0103200] established that the approximation is universal for quantum computation at a non-lattice, principal root of unity; and Aharonov and Arad [arXiv:quant-ph/0605181] established a uniform version of this result. In this article, we show that any value-dependent approximation of the Jones polynomial at these non-lattice roots of unity is #P-hard. If given the power to decide whether |V(L,t)| > a or |V(L,t)| < b for fixed constants a > b > 0, there is a polynomial-time algorithm to exactly count the solutions to arbitrary combinatorial equations. In our argument, the result follows fairly directly from the universality result and Aaronson's theorem that PostBQP = PP [arXiv:quant-ph/0412187].

arXiv:0908.0512•Aug 4, 2009•91 citations

A note on entanglement of formation and generalized concurrence

Shao-Ming Fei, Zhi‐Xi Wang, Hui Zhao

arXiv:quant-ph/0408131•Physics Letters A•Aug 4, 2004•34 citations

Reply to ``The quantum algorithm of Kieu does not solve the Hilbert's tenth problem"

Tien D. Kieu

The arguments employed in quant-ph/0111009, to claim that the quantum algorithm in quant-ph/0110136 does not work, are so general that were they true then the adiabatic theorem itself would have been wrong. As a matter of fact, those arguments are only valid for the sudden approximation, not the adiabatic process.

arXiv:quant-ph/0111020•Nov 3, 2001•10 citations
Freedman, Kitaev, and Wang [arXiv:quant-ph/0001071], and later Aharonov, Jones, and Landau [arXiv:quant-ph/0511096], established a quantum algorithm to "additively" approximate the Jones polynomial V(L,t) at any principal root of unity t. The strength of this additive approximation depends exponentially on the bridge number of the link presentation. Freedman, Larsen, and Wang [arXiv:math/0103200] established that the approximation is universal for quantum computation at a non-lattice, principal root of unity; and Aharonov and Arad [arXiv:quant-ph/0605181] established a uniform version of this result. In this article, we show that any value-dependent approximation of the Jones polynomial at these non-lattice roots of unity is #P-hard. If given the power to decide whether |V(L,t)| > a or |V(L,t)| < b for fixed constants a > b > 0, there is a polynomial-time algorithm to exactly count the solutions to arbitrary combinatorial equations. In our argument, the result follows fairly directly from the universality result and Aaronson's theorem that PostBQP = PP [arXiv:quant-ph/0412187].