SearcharxivSearch

arXiv · 2609.05555

The I3322 quantum value is attained spatially but not in finite dimension

Abstract

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). From a certified window $S\in(0.2508753845015185,0.250875388108398]$ (independently and more tightly enclosed by Mghirbi's prior certificates) and a certified equality of the tensor-product and commuting-operator suprema, we prove: (i) no finite-dimensional quantum strategy attains $S$ -- any finite local dimensions, pure or mixed states, projective or POVM measurements -- proving the conjecture of Pal and Vertesi (2010); (ii) $S$ is attained by a spatial strategy on $\ell^2(\mathbb{Z})\otimes\ell^2(\mathbb{Z})$, the infinite-dimensional attainment those authors asserted, on an independent route. So $C_q(3,3;2,2)$ is not closed -- the smallest two-outcome bipartite scenario by input count where nonclosure is known -- and $C_{qs}(3,3;2,2)\setminus C_q(3,3;2,2)$ is nonempty, settling the attainment question raised by Dykema, Paulsen and Prakash. Nonattainment is proved via a concave critical Bellman storage, exact rational endpoint-exclusion certificates, reflection-gluing and a convex-envelope theorem: finiteness forces an exact maximizer's two equality transports to coincide, capping its value at $1/4<S$. Attainment is proved by disintegrating a commuting maximizer's spectral measure over the orbits of its two response transports, yielding an $\ell^2$ Jacobi eigenvector with inherited normalizability. We also determine the dimension complexity: with $S_d$ the optimum at local dimension $\le d$ and $D(\epsilon)=\min\{d:S-S_d\le\epsilon\}$, $D(\epsilon)=\Theta(\log(1/\epsilon))$ -- the upper half constructively, with $D(\epsilon)\le 23.9010650\log(1/\epsilon)$; the lower half in a certificate chain in the accompanying repository. Cores of both halves are machine-checked in Lean 4.

Explore related subjects

Keep this discovery

BibTeXRIS

Seth Douglas. 2026-09-03. The I3322 quantum value is attained spatially but not in finite dimension. https://arxiv.org/abs/2609.05555

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