SearcharxivSearch

arXiv · 2607.13774

A phase transition in the exactness of the NPA hierarchy at the critical doubly-tilted CHSH functional

Abstract

Gigena et al. [npj Quantum Inf. 11, 82 (2025)] proved the exact quantum maximum of the doubly-tilted CHSH functional $B_{\alpha\beta}=\alpha\langle A_0\rangle+\beta\langle B_0\rangle+\mathrm{CHSH}$ and observed that the NPA level required to reach it grows without evident bound toward the critical line $\alpha+\beta=2$. We quantify the mechanism on the symmetric slice $s=2-\alpha-\beta$: (i) the quantum value leaves the local bound cubically, $c_Q=4-s+s^3/6-s^4/36+O(s^5)$; (ii) each NPA level overshoots quadratically, $c_k(s)=4-s+a_k s^2+O(s^3)$, with the almost-quantum coefficient computed exactly, $a_{1+AB}=3/64$; (iii) the divergence of the required exact level is equivalent to positivity of the single sequence $(a_k)$ - proven for every $k$ in the companion paper. We prove the supercritical side completely: for all $\alpha,\beta\ge 1$ and every level the hierarchy is exact, via three explicit rational certificates realizing an affine identity. The hierarchy's exactness thus undergoes a phase transition at the critical line. On the subcritical side we certify the first four levels in exact arithmetic (rational pseudo-moments beating $c_Q$, confirmed by Sturm's theorem). We identify the exact mechanism: rescaled to the critical corner, the limiting obstruction is the Motzkin polynomial, the classical nonnegative-but-not-sum-of-squares form, so the finite-level failure sits in the restricted-certificate regime. The phase boundary has a precise geometric reading via Nie's finite-convergence theorem and Marshall's boundary Hessian condition: a self-tested optimum is finitely NPA-certifiable whenever its boundary Hessian is nondegenerate (contact order two), which holds for the single tilt and fails exactly at the doubly-tilted cubic touch. Three verified errata in the published polynomial system of Gigena et al. are documented.

Explore related subjects

Keep this discovery

BibTeXRIS

Anton Pakhunov. 2026-07-15. A phase transition in the exactness of the NPA hierarchy at the critical doubly-tilted CHSH functional. https://arxiv.org/abs/2607.13774

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph