No finite level of the NPA hierarchy is exact for the doubly-tilted CHSH functional near the critical tilt

• URL: http://arxiv.org/abs/2607.13762v1
• Date: Wed, 15 Jul 2026 12:22:23 GMT
• Title: No finite level of the NPA hierarchy is exact for the doubly-tilted CHSH functional near the critical tilt
• Abstract summary: We prove that for every NPA level $kge 2$ there are an explicit rational $g_k>0$ and an $s*_k>0$ with $c_k(s)ge 4-s+g_k s2$ on $(0,s*_k)$.<n>For $kge 3$ no quantum state and no smooth curve of quantum models can realize the gain direction, so the overshoot lives strictly in the non-quantum part of the NPA cone.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Gigena, Panwar, Scala, Araujo, Farkas and Chaturvedi [npj Quantum Inf. 11, 82 (2025)] determined the quantum maximum of the doubly-tilted CHSH functionals, observed that the Navascues-Pironio-Acin level needed for exactness grows without evident bound toward the critical tilt, and asked whether any finite level suffices. We answer this in the negative. For the symmetric critical family $B_s=(1-s/2)(\langle A_0\rangle+\langle B_0\rangle)+\mathrm{CHSH}$ we prove: for every NPA level $k\ge 2$ there are an explicit rational $g_k>0$ and an $s^*_k>0$ with $c_k(s)\ge 4-s+g_k s^2$ on $(0,s^*_k]$; since the quantum value leaves the local bound only cubically, every finite level strictly overshoots on an interval: no finite level is exact on any neighbourhood of the critical point. Unconditionally $a_2>1/39$, $a_3>1/188$, $a_4>1/641$. The proof is a primal construction: an exactly feasible moment curve at each level, built from level-uniform structural laws and one level-independent signed witness -- a closed-form class function $y^*$ with $N_k^TΓ(y^*)N_k=u_k u_k^T$ at every level. The mechanism forces the sign: for $k\ge 3$ no quantum state and no smooth curve of quantum models can realize the gain direction, so the overshoot lives strictly in the non-quantum part of the NPA tangent cone. The proof is computer-assisted in the strict sense: finite exact-integer verifications with proven degree bounds are constituent parts of the argument; the chain has been re-verified against independent implementations, including a symbolic per-regime proof of the witness identity and a clean-room implementation written from the paper text alone. The one external input is the published quantum value of Gigena et al., cross-checked to twelve digits.

Related papers

• Sample-optimal learning of stabilizer states [0.20999222360659608]
  It is well-known that learning a pure $n$-qubit stabilizer state $|rangle$ both requires, and can be accomplished with, access to a number of copies of $|rangle$ linear in $n$.<n>Here we prove that $L_(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $01/8$.
  arXiv  Detail & Related papers  (2026-09-10T01:48:29Z)
• The I3322 quantum value is attained spatially but not in finite dimension [0.0]
  Let $S$ be the quantum supremum of the $I_3322$ Bell functional in the Collins-Gisin normalization (classical bound 0; two-qubit maximum exactly 1/4)<n>We prove: (i) no finite-dimensional quantum strategy attains $S$ -- any finite local dimensions, pure or mixed states, projective or POVM measurements -- proving Pal and Vertesi (2010)<n>We also determine the dimension complexity: with $S_d$ the optimum at local dimension $le d$ and $D()=mind:S-S_d
  arXiv  Detail & Related papers  (2026-09-03T15:48:01Z)
• The Condition-Number Barrier in Sparse Least Squares [77.64108812086542]
  In [AS21], Axiotis and Sviridenko conjectured that the linear dependence on the restricted condition number in convex optimization cannot be improved by a sparse-time algorithm.<n>We establish their conjectured lower bound for least-squares objectives, conditional on the randomized exact-volume Small-Set Expansion Hypothesis.
  arXiv  Detail & Related papers  (2026-08-03T17:57:01Z)
• The Kikuchi Hierarchy is Sharp for $k$XOR [46.26532142699448]
  We show that a normalized variant of the Kikuchi hierarchy achieves the sharp conjectured trade-off, with no logarithmic loss, at every arity $kge3$.<n>We also prove matching lower bounds in the same model. The inference and refutation upper bounds transfer to more general planting laws and predicates.
  arXiv  Detail & Related papers  (2026-07-31T17:54:11Z)
• No Finite NPA Level Characterizes the Complete Quantum Set in the Simplest Bell Scenario [0.0]
  We show that emphno finite level is exact.<n>Every standard NPA relaxation based on a fixed finite list of words in the measurement projectors strictly contains the complete quantum set.
  arXiv  Detail & Related papers  (2026-07-16T04:52:11Z)
• A phase transition in the exactness of the NPA hierarchy at the critical doubly-tilted CHSH functional [0.0]
  We prove the exact quantum maximum of the doubly-tilted CHSH functional $B_=langle A_0rangle+l B_0rangle+mathrmCHSH$.<n>For all $,ge 1$ and every level the hierarchy is exact, via three explicit rational certificates realizing an affine identity.<n>On the subcritical side we certify the first four levels in exact arithmetic.
  arXiv  Detail & Related papers  (2026-07-15T12:34:25Z)
• Passive spectral-admittance bounds and exact continuum certificates for multiresonator quantum-memory interfaces [0.0]
  We show that broadband quantum-memory obeys $0.064112 leq |_infty 0.0641125$, implying a conditional uniform write guarantee above $0.995889587$.<n>This is a reproducible certificate for a specified interface, not a claim of global movable-pole optimality or experimentally of an complete memory.
  arXiv  Detail & Related papers  (2026-07-12T10:55:35Z)
• The Exact Worst-Case Tail Probability under Bounded Kurtosis [39.91890433860882]
  We determine exactly what a kurtosis bound buys for one-sided tail control.<n>For the class $mathcalC()$ of real random variables with mean $0$, variance $1$, and fourth moment at most $$, the skewness left free.
  arXiv  Detail & Related papers  (2026-07-06T15:40:54Z)
• Quantum Colorings of Spheres [0.0]
  We show that if $Sn-1$ is quantumly $n$-colorable, then either $n=2$ or $n$ is a multiple of 4, and show that the converse holds whenever a Hadamard matrix of order $n$ exists.<n>It also follows from this equivalence that $Sn-1$ admits a rank-one quantum $n$-coloring if and only if $n in 2,4,8$, thereby settling a conjecture of Zeng and Zhang.
  arXiv  Detail & Related papers  (2026-06-09T13:49:08Z)
• Quantum Mechanics from Finite Graded Equality [0.40611352512781856]
  We propose that quantum mechanics follows from a single hypothesis: equality has finite resolution.<n>We formalize the first two axioms as axioms; a structural Leibniz condition within the saturation axiom forces permutation invariance of basis elements.<n>Local tomography follows from $mathbbF = mathbbC$ with tensor product composition.
  arXiv  Detail & Related papers  (2026-03-12T13:14:48Z)
• On the Relativity of Quantumness as Implied by Relativity of Arithmetic and Probability [0.0]
  hierarchical structure of isomorphic arithmetics.<n>Probabilities $p_k=gk(p)$, where $g$ is the restriction of $g_mathbbR$ to the interval $[0,1]$.<n>Quantum binary probabilities are defined by $g(p)=sin2fracpi2p$.
  arXiv  Detail & Related papers  (2025-10-01T08:13:14Z)
• Coherence in Property Testing: Quantum-Classical Collapses and Separations [42.44394412033434]
  We show that no tester can distinguish subset states of size $2n/8$ from $2n/4$ with probability better than $2-Theta(n)$.<n>We also show connections to disentangler and quantum-to-quantum transformation lower bounds.
  arXiv  Detail & Related papers  (2024-11-06T19:52:15Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• 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)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)

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.