Quantum Separability in Polynomial Time

Giulio Malavolta

Quantum Separability in Polynomial Time

Quantum Physics 2026-07-26 v1

Authors: Giulio Malavolta

Abstract

The quantum separability problem asks whether a bipartite density matrix is separable or is $\eta$ -far from every separable state. We give a randomized polynomial-time algorithm for this problem for every fixed constant gap $\eta>0$ , when distance is measured in the Euclidean norm.

Cite

@article{arxiv.2607.23773,
  title  = {Quantum Separability in Polynomial Time},
  author = {Giulio Malavolta},
  journal= {arXiv preprint arXiv:2607.23773},
  year   = {2026}
}