Strong NP-hardness of the quantum separability problem
The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
Given the density matrix $\rho$ of a bipartite quantum state, the quantum separability problem asks whether $\rho$ is entangled or separable. In 2003, Gurvits showed that this problem is NP-hard if $\rho$ is located within an inverse exponential (with respect to dimension) distance from the border of the set of separable quantum states. In this paper, we extend this NP-hardness to an inverse polynomial distance from the separable set. The result follows from a simple combination of works by Gurvits, Ioannou, and Liu. We apply our result to show (1) an immediate lower bound on the maximum distance between a bound entangled state and the separable set (assuming $\rm{P}\neq\rm{ NP}$), and (2) NP-hardness for the problem of determining whether a completely positive trace-preserving linear map is entanglement-breaking.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777 · cited 1×
“as in Shor’s factoring algorithm [4]), quantum communication complexity [5, 6], and quantum cryptography [7].”
BackgroundHorodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 1×
“as in Shor’s factoring algorithm [4]), quantum communication complexity [5, 6], and quantum cryptography [7].”
BackgroundMixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Separability Criterion for Density Matrices
Peres, A. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.1413 · Cited by 5,191
Separability of mixed states: necessary and sufficient conditions
Horodecki, M., Horodecki, P., & Horodecki, R. (1996) · Physics Letters A · doi:10.1016/s0375-9601(96)00706-2 · Cited by 3,649
Discussion of Probability Relations between Separated Systems
Schrödinger, E. (1935) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100013554 · Cited by 3,124 · cited 1×
“Once dubbed “the characteristic trait of quantum mechanics” [1], the phenomenon of quantum entanglement has been (theoretically) harnessed in a multitude of quantum computational tasks and areas, including quantum teleportation [2], superdense coding [3], quantum parallelism (e.”
BackgroundCompletely positive linear maps on complex matrices
Choi, M.-D. (1975) · Linear Algebra and its Applications · doi:10.1016/0024-3795(75)90075-0 · Cited by 2,659 · cited 1×
“If and only if Φ is CP, then J(Φ) is positive semidefinite [39], and if and only if Φ is TP, then TrA(J(Φ)) = I/MN [16].”
BackgroundLinear transformations which preserve trace and positive semidefiniteness of operators
Jamiołkowski, A. (1972) · Reports on Mathematical Physics · doi:10.1016/0034-4877(72)90011-0 · Cited by 1,512 · cited 3×
“Then, for any linear map Φ : HM,N 7→ HM,N , there exists a unique operator in HMN,MN given by the Jamio lkowski isomorphism [28], denoted J(Φ), such that:”
MethodInfluentialMixed-state entanglement and distillation: Is there a ‘bound’ entanglement in nature?
Horodecki, M., Horodecki, P., & Horodecki, R. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.5239 · Cited by 1,208
Hidden quantum nonlocality revealed by local filters
Gisin, N. (1996) · Physics Letters A · doi:10.1016/s0375-9601(96)80001-6 · Cited by 531 · cited 1×
“In Step 3, the stochastic local operations and classical communication (LOCC) map Υ is an example of a local filter (as first considered in [41]), and ensures TrA′(Υ(ρ)) = I/2MN , allowing us to call the oracle on its output.”
Background
Cited by
Gühne, O., & Tóth, G. (2009) · Physics Reports · doi:10.1016/j.physrep.2009.02.004 · Cited by 2,401
“As recently shown, this result also holds if the if the inverse accuracy 1/ε is required to increase only polynomially [106].”
BackgroundQuantum magnonics: When magnon spintronics meets quantum information science
Yuan, H. Y., Cao, Y., Kamra, A., Duine, R. A., & Yan, P. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.03.002 · Cited by 611
Computing quantum discord is NP-complete
Huang, Y. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/3/033027 · Cited by 286
Quantum Hamiltonian Complexity
Gharibian, S., Huang, Y., Landau, Z., & Shin, S. W. (2015) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000066 · Cited by 144
Self-citationEntanglement quantification from collective measurements processed by machine learning
Roik, J., Bartkiewicz, K., Černoch, A., & Lemr, K. (2022) · Physics Letters A · doi:10.1016/j.physleta.2022.128270 · Cited by 26
Metadata
- Authors
- Gharibian, S.
- Venue
- Quantum Information and Computation
- Publisher
- Rinton Press
- Published
- 2010-03
- Volume
- 10
- Issue
- 3&4
- Pages
- 343-360
- ISSN
- 1533-7146 (ISSN-L)
- OpenAlex
- W1644115585
- Cited by
- 234
- References
- 12
- FWCI
- 7.48
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.