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:2610.34972

Membership in the cone of quantum states over time is NP-hard

Matt Hoogsteder-Riera

quant-phmath-phSubmitted Oct 26, 2026• Announced Oct 27, 2026• 0 citations• Revised Oct 30, 2026 (v2)
v1 · Oct 26, 2026v2 · Oct 30, 2026
arXivHTMLPDF

Abstract

A state over time (stote) pairs a state $ρ$ with a channel $\mathcal{E}$ as the Hermitian, generally non-positive operator $(ρ\otimes\mathbf{1})\star J_\mathcal{E}$. Characterizing the convex cone $\widehat{\mathcal{Q}}$ these operators generate was posed as an open problem in Hoogsteder-Riera, Calsamiglia and Winter (2026). We exhibit a linear copy of the bipartite separable cone as an exposed face of $\widehat{\mathcal{Q}}$: for output systems of the form $B = A'R$ with $A'$ a copy of the input, there is an explicit witness $W_0\in\widehat{\mathcal{Q}}^*$ and an explicit injective linear map $L$ with $σ\in \mathrm{SEP}_{+}(A{:}R)\iff L(σ)\in\widehat{\mathcal{Q}}(A{:}A'R)$. Composing with the NP-hardness of separability shows that exact membership, weak membership, and weak optimization are NP-hard for $\widehat{\mathcal{Q}}$ and its dual. A quantitative stability bound makes the weak-membership reduction valid at inverse-polynomial accuracy. Thus polynomial-time membership tests do not exist unless $\mathrm{P}=\mathrm{NP}$. Independently of this complexity assumption, Fawzi's theorem implies that $\widehat{\mathcal{Q}}(A{:}A'R)$ admits no finite semidefinite representation when $d=\dim A\ge2$, $r=\dim R\ge2$, and $d+r>5$.

Comments
23 pages, 2 Figures

Related papers

Nonlocal sets of orthogonal product states with less members in multipartite quantum systems

Yongqi Zhang, Dong‐Huan Jiang, Yu‐Guang Yang +1 more

Quantum Information Processing•Dec 4, 2024•5 citations

Convex semidefinite tensor optimization and quantum entanglement

Liding Xu, Ye-Chao Liu, Sebastian Pokutta

The cone of positive-semidefinite (PSD) matrices is fundamental in convex optimization, and we extend this notion to tensors, defining PSD tensors, which correspond to separable quantum states. We study the convex optimization problem over the PSD tensor cone. While this convex cone admits a smooth reparameterization through tensor factorizations (analogous to the matrix case), it is not self-dual. Moreover, there are currently no efficient algorithms for projecting onto or testing membership in this cone, and the semidefinite tensor optimization problem, although convex, is NP-hard. To address these challenges, we develop methods for computing lower and upper bounds on the optimal value of the problem. We propose a general-purpose iterative refinement algorithm that combines a lifted alternating direction method of multipliers with a cutting-plane approach. This algorithm exploits PSD tensor factorizations to produce heuristic solutions and refine the solutions using cutting planes. Since the method requires a linear minimization oracle over PSD tensors, we design a spatial branch-and-bound algorithm based on convex relaxations and valid inequalities. Our framework allows us to study the white-noise mixing threshold, which characterizes the entanglement properties of quantum states. Numerical experiments on benchmark instances demonstrate the effectiveness of the proposed methods.

math.OCCross-listedarXiv:2511.05258•Nov 10, 2025•0 citations

Constructing a ball of separable and absolutely separable states for $$2\otimes d$$ quantum system

Satyabrata Adhikari

arXiv:2007.00891•The European Physical Journal D•Mar 1, 2021•1 citation

Polynomial-Time Algorithms for Nuclear Tensor Norms and Multipartite Separability

Martino Bernasconi, Giulio Malavolta

We study a multilinear optimization problem for tensors with bounded Frobenius norm, where each of the $k$ local factors of dimension $d$ is chosen from a convex set. We give a deterministic algorithm running in time $d^{O(k)}$ for constant additive approximations. As applications, we obtain the first polynomial-time algorithms at constant accuracy for weak membership in the nuclear-norm unit ball of high-order tensors and for multipartite quantum separability in Frobenius norm. Our approach views tensor optimization as a cooperative multiprover game and combines this perspective with a recursive spectral compression procedure. We then show that related ideas admit a quantum implementation when the input state is given through copies, rather than an explicit classical description. In these settings we obtain an algorithm to solve Frobenius-norm separability testing using $\text{poly}(k)$ copies and $\text{poly}(k\log d)$ time.

quant-pharXiv:2610.03637•Oct 5, 2026•0 citations

On the Chvátal-Gomory Closure of Integer Quadratic Programs

Linchuan Wei, Tong Xu, Kim Yu

The integer quadratic moment hull is the closed convex hull of the pairs $(z,zz^{\top})$ with $z\in\mathbb{Z}^n$. We prove that one round of Chvátal-Gomory (CG) cuts applied to its basic semidefinite relaxation recovers this hull exactly if and only if $n\le6$. Our approach identifies its facets with perfect Delaunay polyhedra and characterizes their recovery through depth, the gap between lattice and continuous minima of a defining quadratic after normalization. A facet inequality is valid for the rank-one CG closure exactly when its depth is less than one. We also analyze the complexity of deciding membership in the CG closure and finding violated inequalities. Every rational point outside the CG closure admits a violated CG inequality whose encoding length is polynomial in the input length. Membership is strongly coNP-complete and exact separation is strongly NP-hard. The same reduction proves strong NP-hardness of quadratic split-inequality separation, resolving a conjecture of Burer and Letchford.

arXiv:2610.34053•Oct 25, 2026•0 citations

Special unitary algebras underlying bipartite qubit and qutrit systems

P. Dasgupta, Debashis Gangopadhyay

Pramana•Aug 20, 2026•0 citations
A state over time (stote) pairs a state ρρρ with a channel E\mathcal{E}E as the Hermitian, generally non-positive operator (ρ⊗1)⋆JE(ρ\otimes\mathbf{1})\star J_\mathcal{E}(ρ⊗1)⋆JE​. Characterizing the convex cone Q^\widehat{\mathcal{Q}}Q​ these operators generate was posed as an open problem in Hoogsteder-Riera, Calsamiglia and Winter (2026). We exhibit a linear copy of the bipartite separable cone as an exposed face of Q^\widehat{\mathcal{Q}}Q​: for output systems of the form B=A′RB = A'RB=A′R with A′A'A′ a copy of the input, there is an explicit witness W0∈Q^∗W_0\in\widehat{\mathcal{Q}}^*W0​∈Q​∗ and an explicit injective linear map LLL with σ∈SEP+(A:R)  ⟺  L(σ)∈Q^(A:A′R)σ\in \mathrm{SEP}_{+}(A{:}R)\iff L(σ)\in\widehat{\mathcal{Q}}(A{:}A'R)σ∈SEP+​(A:R)⟺L(σ)∈Q​(A:A′R). Composing with the NP-hardness of separability shows that exact membership, weak membership, and weak optimization are NP-hard for Q^\widehat{\mathcal{Q}}Q​ and its dual. A quantitative stability bound makes the weak-membership reduction valid at inverse-polynomial accuracy. Thus polynomial-time membership tests do not exist unless P=NP\mathrm{P}=\mathrm{NP}P=NP. Independently of this complexity assumption, Fawzi's theorem implies that Q^(A:A′R)\widehat{\mathcal{Q}}(A{:}A'R)Q​(A:A′R) admits no finite semidefinite representation when d=dim⁡A≥2d=\dim A\ge2d=dimA≥2, r=dim⁡R≥2r=\dim R\ge2r=dimR≥2, and d+r>5d+r>5d+r>5.
The cone of positive-semidefinite (PSD) matrices is fundamental in convex optimization, and we extend this notion to tensors, defining PSD tensors, which correspond to separable quantum states. We study the convex optimization problem over the PSD tensor cone. While this convex cone admits a smooth reparameterization through tensor factorizations (analogous to the matrix case), it is not self-dual. Moreover, there are currently no efficient algorithms for projecting onto or testing membership in this cone, and the semidefinite tensor optimization problem, although convex, is NP-hard. To address these challenges, we develop methods for computing lower and upper bounds on the optimal value of the problem. We propose a general-purpose iterative refinement algorithm that combines a lifted alternating direction method of multipliers with a cutting-plane approach. This algorithm exploits PSD tensor factorizations to produce heuristic solutions and refine the solutions using cutting planes. Since the method requires a linear minimization oracle over PSD tensors, we design a spatial branch-and-bound algorithm based on convex relaxations and valid inequalities. Our framework allows us to study the white-noise mixing threshold, which characterizes the entanglement properties of quantum states. Numerical experiments on benchmark instances demonstrate the effectiveness of the proposed methods.
Constructing a ball of separable and absolutely separable states for 2⊗d2\otimes d2⊗d quantum system
We study a multilinear optimization problem for tensors with bounded Frobenius norm, where each of the kkk local factors of dimension ddd is chosen from a convex set. We give a deterministic algorithm running in time dO(k)d^{O(k)}dO(k) for constant additive approximations. As applications, we obtain the first polynomial-time algorithms at constant accuracy for weak membership in the nuclear-norm unit ball of high-order tensors and for multipartite quantum separability in Frobenius norm. Our approach views tensor optimization as a cooperative multiprover game and combines this perspective with a recursive spectral compression procedure. We then show that related ideas admit a quantum implementation when the input state is given through copies, rather than an explicit classical description. In these settings we obtain an algorithm to solve Frobenius-norm separability testing using poly(k)\text{poly}(k)poly(k) copies and poly(klog⁡d)\text{poly}(k\log d)poly(klogd) time.
The integer quadratic moment hull is the closed convex hull of the pairs (z,zz⊤)(z,zz^{\top})(z,zz⊤) with z∈Znz\in\mathbb{Z}^nz∈Zn. We prove that one round of Chvátal-Gomory (CG) cuts applied to its basic semidefinite relaxation recovers this hull exactly if and only if n≤6n\le6n≤6. Our approach identifies its facets with perfect Delaunay polyhedra and characterizes their recovery through depth, the gap between lattice and continuous minima of a defining quadratic after normalization. A facet inequality is valid for the rank-one CG closure exactly when its depth is less than one. We also analyze the complexity of deciding membership in the CG closure and finding violated inequalities. Every rational point outside the CG closure admits a violated CG inequality whose encoding length is polynomial in the input length. Membership is strongly coNP-complete and exact separation is strongly NP-hard. The same reduction proves strong NP-hardness of quadratic split-inequality separation, resolving a conjecture of Burer and Letchford.