The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
- URL: http://arxiv.org/abs/2605.16249v1
- Date: Fri, 15 May 2026 17:52:33 GMT
- Title: The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
- Abstract summary: Entanglement and interference are among the most fundamental properties of quantum mechanics.<n>We prove that entanglement gives no additional power to stoquastic verification.
- Score: 46.657699628769336
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Entanglement and interference are among the most fundamental properties of quantum mechanics. In this work, we investigate the role and power of interference in the context of detecting entanglement. We do so from a computational complexity lens by proving that unentanglement gives no additional power to stoquastic Merlin-Arthur verification. For every polynomial number of provers $k=k(n)$, \[ \text{StoqMa}(k)=\text{StoqMa} . \] Conceptually, the proof separates the role of entanglement from the role of interference: once destructive interference is ruled out by stoquasticity, the product-state constraint can be absorbed into a polynomially larger one-witness stoquastic verification. The main analytic ingredient is a positive, value-based de Finetti theorem for separately symmetric extensions. If $M$ is an entrywise nonnegative positive semidefinite contraction on $A_1\otimes\cdots\otimes A_k$, then the nonnegative product value of $M$ is approximated to additive error $ε$ by the largest eigenvalue of \[ Π_R^{<k} (M_{A_{1,1}\cdots A_{k-1,1}A_k}\otimes I) Π_R^{<k}, \qquad R=O\!\left(\frac{k^2\sum_i\log\dim A_i}{ε^3}\right), \] where $Π_R^{<k}$ is the operator on $A_1^{\otimes R} \otimes \cdots \otimes A_{k-1}^{\otimes R} \otimes A_k$ projecting to the subspace $\mathrm{Sym}^R(A_1) \otimes \cdots \otimes \mathrm{Sym}^{R}(A_{k-1}) \otimes A_k$. The spectral relaxation is then realized as an actual one-witness stoquastic verifier. After replacing the uniform permutation averages in the symmetric projectors by inverse-polynomially close dyadic inverse-invariant averages. Consequently, \[ \text{StoqMa}(k)=\text{StoqMa}\subseteq\text{AM}\cap\text{PP}\subseteq\text{PSPACE} . \] The positive de Finetti theorem is isolated as a standalone technique and may be useful in other nonnegative tensor-optimization and stoquastic-verification settings.
Related papers
- Simultaneous Pointwise Majorization for Mixed Tail Processes with Applications in Gaussian Chaos and Ergodic Diffusions [15.386375612838371]
Classical chaining controls an indexed process through a single worst-case bound.<n>We develop the first simultaneous pointwise majorization theory for Banach-valued processes.
arXiv Detail & Related papers (2026-09-01T17:42:38Z) - Weak Typicality of von Neumann Entanglement Entropy in Gaussian Boson Sampling [2.8224889996383395]
We study the von Neumann entanglement entropy generated by a Haar distributed passive interferometer acting on $n$ equally squeezed input modes with fixed nonzero squeezing strength $s$.<n>For subsystem of $k_n$ modes satisfying $k_n/nto rin(0,1)$, we prove that, for every $varepsilon>0$ and all sufficiently large $n$, $mathbbPleft(left|fracS_1,nmathbbES_1,n$ to $1$, a typical
arXiv Detail & Related papers (2026-08-18T02:04:28Z) - Exact Moments of Gaussian Gram Hafnians Reveal an $n^2/\log n$ Threshold for Weak Anticoncentration [2.8224889996383395]
Anticoncentration is central to hardness arguments for approximate sampling.<n> finite dimensional Haar moment transfer and high probability small ball anticoncentration remain separate problems.
arXiv Detail & Related papers (2026-08-17T19:12:22Z) - Spectral-angular parametrization of open qudit dynamics [0.0]
A generic density matrix $rho_mathbfr,pmb$, characterized by $n2-1$ real parameters, naturally decomposes into two sets.<n>A key observation is that the spectral parameters $mathbfr = (r_1, ldots, r_n-1)$ admit a natural Lie-algebraic interpretation.
arXiv Detail & Related papers (2026-04-13T16:02:24Z) - Optimal Scalar Quantization for Matrix Multiplication: Closed-Form Density and Phase Transition [50.36362492608702]
We study entrywise scalar quantization of two matrices prior to multiplication.<n>We obtain a closed-form optimal point density [ star(u) propto exp!left(-fracu26right)bigl( (1-2)+2u22bigr), qquad u=fracx_X,, and prove a correlation-driven phase transition.
arXiv Detail & Related papers (2026-03-20T01:53:44Z) - Wigner quasi-probability distribution for symmetric multi-quDit systems and their generalized heat kernel [0.0]
We analyze the phase-space structure of Schr"odinger $U(D)$-spin cat states.<n>We compute the generalized heat kernel relating two quasi-probability distributions $mathcalF(s)_rho$ and $mathcalF(s')_rho$.
arXiv Detail & Related papers (2025-07-20T08:26:28Z) - Dimension Independent Disentanglers from Unentanglement and Applications [55.86191108738564]
We construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input.
We show that to capture NEXP, it suffices to have unentangled proofs of the form $| psi rangle = sqrta | sqrt1-a | psi_+ rangle where $| psi_+ rangle has non-negative amplitudes.
arXiv Detail & Related papers (2024-02-23T12:22:03Z) - A Unified Framework for Uniform Signal Recovery in Nonlinear Generative
Compressed Sensing [68.80803866919123]
Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously.
Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples.
We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
arXiv Detail & Related papers (2023-09-25T17:54:19Z) - Finite-time High-probability Bounds for Polyak-Ruppert Averaged Iterates
of Linear Stochastic Approximation [22.51165277694864]
This paper provides a finite-time analysis of linear approximation (LSA) algorithms with fixed step size.
LSA is used to compute approximate solutions of a $d$-dimensional linear system.
arXiv Detail & Related papers (2022-07-10T14:36:04Z) - A Law of Robustness beyond Isoperimetry [84.33752026418045]
We prove a Lipschitzness lower bound $Omega(sqrtn/p)$ of robustness of interpolating neural network parameters on arbitrary distributions.
We then show the potential benefit of overparametrization for smooth data when $n=mathrmpoly(d)$.
We disprove the potential existence of an $O(1)$-Lipschitz robust interpolating function when $n=exp(omega(d))$.
arXiv Detail & Related papers (2022-02-23T16:10:23Z) - The ODE Method for Asymptotic Statistics in Stochastic Approximation and Reinforcement Learning [3.8098187557917464]
The paper concerns the $d$-dimensional recursion approximation, $$theta_n+1= theta_n + alpha_n + 1 f(theta_n, Phi_n+1)
The main results are established under additional conditions on the mean flow and a version of the Donsker-Varadhan Lyapunov drift condition known as (DV3)
An example is given where $f$ and $barf$ are linear in $theta$, and $Phi$ is a geometrical
arXiv Detail & Related papers (2021-10-27T13:38:25Z) - Spectral properties of sample covariance matrices arising from random
matrices with independent non identically distributed columns [50.053491972003656]
It was previously shown that the functionals $texttr(AR(z))$, for $R(z) = (frac1nXXT- zI_p)-1$ and $Ain mathcal M_p$ deterministic, have a standard deviation of order $O(|A|_* / sqrt n)$.
Here, we show that $|mathbb E[R(z)] - tilde R(z)|_F
arXiv Detail & Related papers (2021-09-06T14:21:43Z) - Stochastic behavior of outcome of Schur-Weyl duality measurement [45.41082277680607]
We focus on the measurement defined by the decomposition based on Schur-Weyl duality on $n$ qubits.
We derive various types of distribution including a kind of central limit when $n$ goes to infinity.
arXiv Detail & Related papers (2021-04-26T15:03:08Z) - A Concentration of Measure and Random Matrix Approach to Large
Dimensional Robust Statistics [45.24358490877106]
This article studies the emphrobust covariance matrix estimation of a data collection $X = (x_1,ldots,x_n)$ with $x_i = sqrt tau_i z_i + m$.
We exploit this semi-metric along with concentration of measure arguments to prove the existence and uniqueness of the robust estimator as well as evaluate its limiting spectral distribution.
arXiv Detail & Related papers (2020-06-17T09:02:26Z) - Linear Time Sinkhorn Divergences using Positive Features [51.50788603386766]
Solving optimal transport with an entropic regularization requires computing a $ntimes n$ kernel matrix that is repeatedly applied to a vector.
We propose to use instead ground costs of the form $c(x,y)=-logdotpvarphi(x)varphi(y)$ where $varphi$ is a map from the ground space onto the positive orthant $RRr_+$, with $rll n$.
arXiv Detail & Related papers (2020-06-12T10:21:40Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.