Interference visibility as a witness of preparation contextuality via overlap inequalities

• URL: http://arxiv.org/abs/2605.14395v2
• Date: Fri, 15 May 2026 13:39:24 GMT
• Title: Interference visibility as a witness of preparation contextuality via overlap inequalities
• Abstract summary: We show that standard multi-path interferometry, using only pairwise visibility measurements, provides an operational route to tests of preparation noncontextuality.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We show that standard multi-path interferometry, using only pairwise visibility measurements, provides an operational route to tests of preparation noncontextuality. Under ideal symmetric conditions, interference visibility directly encodes state overlaps, without requiring tomography or SWAP tests. For three paths, any jointly diagonalizable (coherence-free) description must satisfy $V_{12}^2+V_{23}^2-V_{13}^2\le 1$, where $V_{ij}$ are two-path visibilities. Pure qubit detector states violate this bound, achieving a maximal value of $5/4$. We generalize to arbitrary $n$-path interferometers and derive the tight qubit bound $S_n^{\max}=n\cos^2(π/2n)-1$ for all $n\ge3$, achieved by coplanar pure qubit states with uniform angular separation $π/n$. A robustness analysis yields explicit experimental thresholds. Under the operational equivalences used in overlap-based generalized noncontextuality frameworks, violations of these visibility inequalities also witness preparation contextuality. For $n$-cycle inequalities, only the pairwise visibilities appearing in the cycle need to be measured.

Related papers

• Common-Center Geometry and Certified Radial Reconstruction for Energy-Form Full Conformal Regions [5.188221150628459]
  This note focuses on the geometry of conformal prediction (FullCP) regions generated by an empirical energy-form pairwise score.<n>For $12$ and $mge2$, explicit data-checkable derivative bounds give Lipschitz control of the radial exits and exact conformal radial function.
  arXiv  Detail & Related papers  (2026-08-25T07:38:04Z)
• The geometry of AI validation: Exact certification limits for iid best-of-N search [0.0]
  We represent validation and deployment rules as kernels over a reliability surface.<n>Knowing best-of-$n$ reliability through $n=m$ leaves exact ambiguity width $B_m,N=1+2sum_r=1m(-1)rcos2Nr/[(m+1)]$.
  arXiv  Detail & Related papers  (2026-08-21T15:18:11Z)
• AI-Assisted Discovery of Convex Relaxations via Dual Agents [56.60366723277675]
  We show that a lower bound holds for every admissible function and follows from a convex relaxation giving stronger bounds.<n>A theory verifies each agent one and searches for counterexamples, and every reported bound is certified by an explicit dual-feasible point in the interval.
  arXiv  Detail & Related papers  (2026-06-30T06:10:25Z)
• Optimal Dimension-Free Sampling for Regularized Classification [56.72526267755301]
  We prove optimal sampling bounds achieving $(1pmvarepsilon)$-relative error for a broad class of Lipschitz continuous classification loss functions.<n>This includes important functions such as logistic and sigmoid loss, hinge loss, and ReLU loss, as prominent and popular representative examples.
  arXiv  Detail & Related papers  (2026-05-22T15:05:33Z)
• Third-Order Local Randomized Measurements for Finite-size Entanglement Certification [0.0]
  Entanglement is certified when its minimum eigenvalue $mathcalE_4()$ becomes negative.<n>We prove that all separable states satisfy $barmathfrakM()succeq0$, and that the sign of $mathcalE_4()$ can be inferred from single-copy randomized measurements.
  arXiv  Detail & Related papers  (2026-04-14T18:00:02Z)
• Tight Convergence Rates for Online Distributed Linear Estimation with Adversarial Measurements [66.94250413799232]
  We study mean estimation of a random vector $X$ in a distributed parameter-server-worker setup.<n>Key challenges are adversarial measurements and asynchrony.<n>Results provide a unified finite-time characterization of robustness, identifiability, and statistical efficiency in distributed linear estimation with adversarial workers.
  arXiv  Detail & Related papers  (2026-04-07T11:45:55Z)
• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• On the Sparsifiability of Correlation Clustering: Approximation Guarantees under Edge Sampling [6.908972852063454]
  Correlation Clustering (CC) is a fundamental unsupervised learning primitive.<n>We study how much edge information is needed to retain LP-based guarantees.<n>We show via Yao's minimax principle that without pseudometric structure, any algorithm observing $o(n)$ uniformly random edges incurs an approximation ratio.
  arXiv  Detail & Related papers  (2026-02-14T09:12:15Z)
• Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under $(L_0, L_1)$-Smoothness [74.18546828528298]
  We show that SignSGD with Majority Voting can robustly work on the whole range of complexity with $kappakappakappakappa-1right, kappakappakappa-1right, kappakappakappa-1right, kappakappakappa-1right, kappakappakappa-1right, kappakappakappa-1right, kappakappakappa-1right, kappa
  arXiv  Detail & Related papers  (2025-02-11T19:54:11Z)
• Towards a Sharp Analysis of Offline Policy Learning for $f$-Divergence-Regularized Contextual Bandits [49.96531901205305]
  We analyze $f$-divergence-regularized offline policy learning.<n>For reverse Kullback-Leibler (KL) divergence, we give the first $tildeO(epsilon-1)$ sample complexity under single-policy concentrability.<n>We extend our analysis to dueling bandits, and we believe these results take a significant step toward a comprehensive understanding of $f$-divergence-regularized policy learning.
  arXiv  Detail & Related papers  (2025-02-09T22:14:45Z)
• $su(d)$-squeezing and many-body entanglement geometry in finite-dimensional systems [0.0]
  Generalizing the well-known spin-squeezing inequalities, we study the relation between squeezing of collective $N$-particle $su(d)$ operators and many-body entanglement geometry in multi-particle systems.
  arXiv  Detail & Related papers  (2024-06-19T08:40:11Z)
• Collaborative non-parametric two-sample testing [55.98760097296213]
  The goal is to identify nodes where the null hypothesis $p_v = q_v$ should be rejected. We propose the non-parametric collaborative two-sample testing (CTST) framework that efficiently leverages the graph structure. Our methodology integrates elements from f-divergence estimation, Kernel Methods, and Multitask Learning.
  arXiv  Detail & Related papers  (2024-02-08T14:43:56Z)
• 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)
• A universal tripartite entanglement signature of ungappable edge states [0.0]
  Gapped two-dimensional topological phases can feature ungappable edge states which are robust even in the absence of protecting symmetries. We show that a multipartite entanglement measure recently proposed in the context of holography, the Markov gap, provides a universal diagnostic of ungappable edge states.
  arXiv  Detail & Related papers  (2021-10-22T18:00:01Z)

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.