We address two sets of long-standing open questions in linear algebra and probability theory, from a computational complexity perspective: stochastic matrix divisibility, and divisibility and decomposability of probability distributions. We prove that finite divisibility of stochastic matrices is an NP-complete problem, and extend this result to nonnegative matrices, and completely-positive trace-preserving maps, i.e. the quantum analogue of stochastic matrices. We further prove a complexity hierarchy for the divisibility and decomposability of probability distributions, showing that finite distribution divisibility is in P, but decomposability is NP-hard. For the former, we give an explicit polynomial-time algorithm. All results on distributions extend to weak-membership formulations, proving that the complexity of these problems is robust to perturbations.
We address two sets of long-standing open questions in linear algebra and probability theory, from a computational complexity perspective: stochastic matrix divisibility, and divisibility and decomposability of probability distributions. We prove that finite divisibility of stochastic matrices is an NP-complete problem, and extend this result to nonnegative matrices, and completely-positive trace-preserving maps, i.e. the quantum analogue of stochastic matrices. We further prove a complexity hierarchy for the divisibility and decomposability of probability distributions, showing that finite distribution divisibility is in P, but decomposability is NP-hard. For the former, we give an explicit polynomial-time algorithm. All results on distributions extend to weak-membership formulations, proving that the complexity of these problems is robust to perturbations.
We connect both discrete and algebraic complexity theory with the satisfiability problem in certain non-Boolean lattices. Specifically, quantum logic was introduced in 1936 by Garrett Birkhoff and John von Neumann as a framework for capturing the logical peculiarities of quantum observables: in the 1D case it coincides with Boolean propositional logic but, starting with dimension two, violates the distributive law. We introduce the weak and strong satisfiability problem for quantum logic propositional formulae. It turns out that in dimension two, both are also NP --complete. For higher-dimensional spaces ℝ d and ℂ d with d ≥ 3 fixed, on the other hand, we show both problems to be complete for the nondeterministic Blum-Shub-Smale (BSS) model of real computation. This provides a unified view on both Turing and real BSS complexity theory, and extends the (still relatively scarce) list of problems established NP ℝ --complete with one, perhaps, closest in spirit to the classical Cook-Levin Theorem. More precisely, strong satisfiability of ∧ ∨ ∧ --terms is complete, while that of ∧ ∨--terms (i.e., those in conjunctive form) can be decided in polynomial time in dimensions d ≥ 2. The decidability of the infinite-dimensional case being still open, we proceed to investigate the case of indefinite finite dimensions. Here, weak satisfiability still belongs to NP R and strong satisfiability is still hard; the latter, in fact, turns out as polynomial-time equivalent to the feasibility of noncommutative integer polynomial equations over matrix rings.
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or \emph{separable}, state. This paper gives the first systematic and comprehensive treatment of this (bipartite) quantum separability problem, focusing on its deterministic (as opposed to randomized) computational complexity. First, I review the one-sided tests for separability, paying particular attention to the semidefinite programming methods. Then, I discuss various ways of formulating the quantum separability problem, from exact to approximate formulations, the latter of which are the paper's main focus. I then give a thorough treatment of the problem's relationship with NP, NP-completeness, and co-NP. I also discuss extensions of Gurvits' NP-hardness result to strong NP-hardness of certain related problems. A major open question is whether the NP-contained formulation (QSEP) of the quantum separability problem is Karp-NP-complete; QSEP may be the first natural example of a problem that is Turing-NP-complete but not Karp-NP-complete. Finally, I survey all the proposed (deterministic) algorithms for the quantum separability problem, including the bounded search for symmetric extensions (via semidefinite programming), based on the recent quantum de Finetti theorem \cite{DPS02,DPS04,qphCKMR06}; and the entanglement-witness search (via interior-point algorithms and global optimization) \cite{ITCE04,IT06}. These two algorithms have the lowest complexity, with the latter being the best under advice of asymptotically optimal point-coverings of the sphere.
In this work, we study the computational complexity of quantum determinants, a q-deformation of matrix permanents: Given a complex number q on the unit circle in the complex plane and an n×n matrix X, the q-permanent of X is defined as Perq(X)=∑σ∈Snqℓ(σ)X1,σ(1)…Xn,σ(n), where ℓ(σ) is the inversion number of permutation σ in the symmetric group Sn on n elements. The function family generalizes determinant and permanent, which correspond to the cases q=−1 and q=1 respectively. For worst-case hardness, by Liouville's approximation theorem and facts from algebraic number theory, we show that for primitive m-th root of unity q for odd prime power m=pk, exactly computing q-permanent is ModpP-hard. This implies that an efficient algorithm for computing q-permanent results in a collapse of the polynomial hierarchy. Next, we show that computing q-permanent can be achieved using an oracle that approximates to within a polynomial multiplicative error and a membership oracle for a finite set of algebraic integers. From this, an efficient approximation algorithm would also imply a collapse of the polynomial hierarchy. By random self-reducibility, computing q-permanent remains to be hard for a wide range of distributions satisfying a property called the strong autocorrelation property. Specifically, this is proved via a reduction from 1-permanent to q-permanent for O(1/n2) points z on the unit circle. Since the family of permanent functions shares common algebraic structure, various techniques developed for the hardness of permanent can be generalized to q-permanents.
Given the density matrix ρ of a bipartite quantum state, the quantum separability problem asks whether ρ is entangled or separable. In 2003, Gurvits showed that this problem is NP-hard if ρ 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 P=NP), and (2) NP-hardness for the problem of determining whether a completely positive trace-preserving linear map is entanglement-breaking.
A state over time (stote) pairs a state ρ with a channel E as the Hermitian, generally non-positive operator (ρ⊗1)⋆JE. Characterizing the convex cone 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: for output systems of the form B=A′R with A′ a copy of the input, there is an explicit witness W0∈Q∗ and an explicit injective linear map L with σ∈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 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. Independently of this complexity assumption, Fawzi's theorem implies that Q(A:A′R) admits no finite semidefinite representation when d=dimA≥2, r=dimR≥2, and d+r>5.
The concept of divisibility of dynamical maps is used to introduce an analogous concept for quantum channels by analyzing the simulability of channels by means of dynamical maps. In particular, this is addressed for Lindblad divisible, completely positive divisible and positive divisible dynamical maps. The corresponding L-divisible, CP-divisible and P-divisible subsets of channels are characterized (exploiting the results by Wolf et al. \cite{cirac}) and visualized for the case of qubit channels. We discuss the general inclusions among divisibility sets and show several equivalences for qubit channels. To this end we study the conditions of L-divisibility for finite dimensional channels, especially the cases with negative eigenvalues, extending and completing the results of Ref.~\cite{Wolf2008}. Furthermore we show that transitions between every two of the defined divisibility sets are allowed. We explore particular examples of dynamical maps to compare these concepts. Finally, we show that every divisible but not infinitesimal divisible qubit channel (in positive maps) is entanglement breaking, and open the question if something similar occurs for higher dimensions.