CoChat

Strong NP-hardness of the quantum separability problem

Gharibian, S. · 2010 · Quantum Information and Computation
Cited by 234

The DOI matches its Crossref record; 10 of the 10 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.26421/qic10.3-4-11

Cites

10 of 10 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 10 references

Cited by

See all 234

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
10
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Strong NP-hardness of the quantum separability problem. https://app.cochat.ai/papers/10.26421/qic10.3-4-11
The paper
Gharibian, S. (2010). Strong NP-hardness of the quantum separability problem. Quantum Information and Computation. https://doi.org/10.26421/qic10.3-4-11

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.