Results · Line of research

Quantum correlations

Bell inequalities, graph capacities and contextuality: which correlations finite systems can produce, certified exactly.

Ten works in thirty-five archived versions · latest release

The question

The papersin reading order, with what each settled

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

    Seth Douglas · version 4.1.0 · · 25 pages · arXiv:2609.05555

    No finite-dimensional quantum strategy attains the quantum maximum of the I3322 Bell functional, mixed states and binary measurements included; a strategy on ℓ2(ℤ)⊗ℓ2(ℤ) does; approaching it needs local dimension Θ(log⁡(1/ε)).

    The paperPDFDOICode

  2. The Lovász number is not alone: a continuum of Rényi points in the entanglement-assisted spectrum of graphs

    Nidhal Mghirbi and Seth Douglas · version 1.2.1 · · arXiv:2610.20775

    Minimizing Petz–Rényi information radii over classical–quantum channels compatible with a graph gives a continuum of points between known graph parameters; a 1440-vertex graph has Σ(G) strictly below the projective rank of its complement.

    The paperPDFDOICode

  3. How much dimension does an ε-approximation to a non-attained quantum correlation cost? A Diophantine answer for K5

    Seth Douglas · version 1.0.2 ·

    The dimension cost of approximating a non-attained correlation for K5 follows a Diophantine law. Version 1.0.2 shows that an open lemma conjectured in earlier versions is false and settles the drifted case.

    The paperDOICode

  4. Exact rational certification of upper and lower quantum bounds for the I3322 Bell inequality

    Nidhal Mghirbi · Zenodo, ; first version , titled “Proof-carrying exact quantum bounds for the I3322 Bell inequality”

    Finite rational proof objects for both sides of the I3322 quantum value: a Gram certificate on all words of length at most four proves Qc≤0.250875385012, and an explicit strategy of local dimension 499 with rational projectors has exact value 0.25087538451397653548…, so the two ends differ by less than 5×10−10. The lower certificate also proves Qt>1/4.

    The paperDOI

  5. Critical Bellman–Jacobi dynamics for reversible Bell functionals

    Nidhal Mghirbi · Zenodo, ; first version

    For a parameterized class of three-setting binary Bell functionals, a strict wall gap and an exactly certifiable endpoint barrier give finite-dimensional nonattainment, attainment by an infinite-dimensional spatial strategy, and nonclosure; for I3322 this proves the Pál–Vértesi nonattainment conjecture. The theory also gives the constructive bound D(ε)=O(log⁡(1/ε)).

    The paperDOI

  6. Alternating Bellman–Jacobi duality for three-setting binary Bell functionals

    Nidhal Mghirbi · Zenodo, ; first version

    An exact reduction, for a six-parameter class of three-setting binary Bell functionals that contains I3322 and the Gigena–Kaniewski family, of the operator optimization to an alternating one-dimensional Jacobi problem with a Bellman storage dual. It gives the exact rational bound ω(I3322)≤0.250875384626, a two-sided window of width about 1.12×10−10 with an independent lower certificate.

    The paperDOI

  7. The resource theory of complexness references in real quantum networks

    Seth Douglas · version 1.0.4 ·

    The resource theory in which the shared two-rebit reference of Weilenmann, Gisin and Sekatski is the unit. Version 1.0.4 proves that the unit copies itself exactly and corrects a false remark.

    The paperPDFDOICode

  8. The frame bus: exact amplification and catalysis of complexness references in real quantum networks

    Seth Douglas · version 1.0.0 ·

    How real network parties without a shared convention for the complex unit can establish one by consuming pairwise reference states.

    The paperPDFDOICode

  9. A repair price for contextuality, and its identity with Min-Rep

    Seth Douglas · version 1.0.0 ·

    The least number of outcome merges that restores a global section; on binary scenarios it is an affine reparametrization of a standard quantity in hardness of approximation.

    The paperDOICode

  10. Proof-Carrying Exact Bounds for the I3322 Bell Inequality

    Nidhal Mghirbi · release 2.0.0 · Zenodo, · a software record that carries the manuscript

    The first proof-carrying release: a rational certificate on the full word space of length at most four and an explicit dimension-499 strategy prove 0.25087538451 < Qt≤Qc≤0.2508753855, an exact window narrower than 10−9, about 265 times narrower than the preceding exact level-three enclosure. The paper above is the later, sharper account.

    The paperDOI

Posed by othersproblems printed by others that this line takes up

What is opentwo questions