CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing Apr 13, 2026

Complexity-Aware Theory Testing from Bell Witnesses

arXiv Quantum Archived Apr 13, 2026 ✓ Full text saved

arXiv:2604.08918v1 Announce Type: new Abstract: Bell statistical-strength analyses and complexity-based model selection are usually treated separately. Here we relate them by showing that a witness obtained from a coarse-graining of full Bell trials yields, through data processing, a lower bound on the Kullback-Leibler (KL) distance to a competitor class in terms of the induced witness distribution. For binary Bell-game witnesses this reduces to a Bernoulli bound, and in the CHSH scenario the lo

Full text archived locally
✦ AI Summary · Claude Sonnet


    Quantum Physics [Submitted on 10 Apr 2026] Complexity-Aware Theory Testing from Bell Witnesses Jianshuo Gao Bell statistical-strength analyses and complexity-based model selection are usually treated separately. Here we relate them by showing that a witness obtained from a coarse-graining of full Bell trials yields, through data processing, a lower bound on the Kullback-Leibler (KL) distance to a competitor class in terms of the induced witness distribution. For binary Bell-game witnesses this reduces to a Bernoulli bound, and in the CHSH scenario the local image collapses to a single threshold, giving the closed-form expression D_KL(Bern(omega) || Bern(3/4)) under uniform inputs, with a corresponding extension to known nonuniform designs. A finite-sample Hoeffding argument gives a lower confidence bound under independent trials. We also include a non-CHSH example based on the three-party Mermin-GHZ game. Because the bound is measured in bits per trial, it can be compared directly with an MDL/BIC-type complexity penalty and thereby yields a conservative crossover criterion for when a more expressive competitor becomes worthwhile. For the reproducible four-photon data of Wang et al., the witness certifies a positive information gap against locality, while a full-table comparison across local, no-signaling, saturated, and two compact nonlocal families favors low-dimensional nonlocal descriptions once complexity is charged. A four-parameter unbiased-correlator control shows that the data support compact nonlocality over locality, while only weakly distinguishing the specific cosine structure of the two-parameter model; an AIC comparison instead favors broader nonlocal controls. We also report witness-based benchmarks from additional published CHSH experiments and discuss the interpretational scope of BIC for constrained or non-regular model classes. Comments: 9 pages, 4 figures Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2604.08918 [quant-ph]   (or arXiv:2604.08918v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2604.08918 Focus to learn more Submission history From: Jianshuo Gao [view email] [v1] Fri, 10 Apr 2026 03:28:10 UTC (61 KB) Access Paper: HTML (experimental) view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-04 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Quantum
    Category
    ◌ Quantum Computing
    Published
    Apr 13, 2026
    Archived
    Apr 13, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗