This record contains the manuscript and complete verification artifact for the Bell inequality J62_4422 of Pál and Vértesi.It certifies the exact rational bracket750075557472719639 / 10^18 ≤ β_Q ≤ 750091086083765047288227625 / 10^27,and exact attainment of 3/4 by the stated two-qubit strategy. The lower endpoint is an exact rational strategy. The upper endpoint is certified by a sum-of-squares chain for the retained 365-word relaxation level.The Krawczyk certificate localizes the underlying KKT zero and establishes a strict local maximum, including negativity of the border form in all 256 boundary strata; it does not establish global optimality of that localized point. Accordingly, this work does not claim the exact quantum value, qubit-restricted optimality, minimum optimizer dimension, or global optimality of the localized KKT point.The archive includes SHA-256 manifests, standard-library replay programs, independently written certificate checks, mutation controls, and pinned full Krawczyk replays. The acceptance programs are fail-closed under optimized Python. The manuscript and certificates are licensed CC BY 4.0; verification code is licensed MIT.Version 1.1 is a hygiene-only update: it replaces one machine-local default path in a helper with the portable repository root ".", updates the corresponding checker and certificate source bindings, and leaves the mathematical calculation, inputs, claims, and replay outputs unchanged.
This record contains the manuscript and complete verification artifact for the Bell inequality J62_4422 of Pál and Vértesi.It certifies the exact rational bracket750075557472719639 / 10^18 ≤ β_Q ≤ 750091086083765047288227625 / 10^27,and exact attainment of 3/4 by the stated two-qubit strategy. The lower endpoint is an exact rational strategy. The upper endpoint is certified by a sum-of-squares chain for the retained 365-word relaxation level.The Krawczyk certificate localizes the underlying KKT zero and establishes a strict local maximum, including negativity of the border form in all 256 boundary strata; it does not establish global optimality of that localized point. Accordingly, this work does not claim the exact quantum value, qubit-restricted optimality, minimum optimizer dimension, or global optimality of the localized KKT point.The archive includes SHA-256 manifests, standard-library replay programs, independently written certificate checks, mutation controls, and pinned full Krawczyk replays. The acceptance programs are fail-closed under optimized Python. The manuscript and certificates are licensed CC BY 4.0; verification code is licensed MIT.Version 1.1 is a hygiene-only update: it replaces one machine-local default path in a helper with the portable repository root ".", updates the corresponding checker and certificate source bindings, and leaves the mathematical calculation, inputs, claims, and replay outputs unchanged.
This preprint constructs finite rational proof objects for both sides of the quantum value of I3322 Bell inequality. Let 𝑄t denote the supremum over finite-dimensional tensor-product binary measurements and𝑄c the commuting-operator value. On the complete word space of total length at most four, we construct a rational Gram certificate. The full signed setting-relabeling stabilizer is the dihedral group of order eight, reducing the certificate to five rational blocks. Ex-act affine reconstruction and a uniform diagonal shift of certified positive interior prove: 𝑄c (𝐼3322) ≤ 62718846253/250000000000 = 0.250875385012. Independently, a local-dimension-499 strategy specified by rational projectors and a nonzero unnormalized rational Schmidt vector has exact normalized value 𝐿499 = 0.25087538451397653548 . . .. Con-sequently, 𝐿499 ≤ 𝑄t(𝐼3322) ≤ 𝑄c (𝐼3322) ≤ 0.250875385012, with endpoint difference below 5 × 10−10. The lower certificate also proves 𝑄t(𝐼3322) > 1/4. Every theorem is checked using exact rational or integer arithmetic; floating-point computation is used only to discover candidates. Complete certificates, source code, tests, and reproducibility materials are archived at: doi:10.5281/zenodo.21462892.
We give exact rational certificates for two results in the bipartite Bell scenario with three two-outcome measurements per party. First, the maximum of the I3322 (Froissart) functional over the almost-quantum set -- the 1+AB level of the Navascues-Pironio-Acin (NPA) hierarchy -- is certified to lie between 0.2514708838 and 0.2514709016 (width <2×10−8), in the normalization with classical bound 0 and quantum maximum ≈0.2508754; to our knowledge no value for this landmark had been published. Second, we exhibit a single exact rational behavior T∗ carrying certificates in both directions: a rational moment matrix proving T∗ almost-quantum, and a rational dual object proving that every NPA level-2 completion of T∗ requires slack at least q=4.5934×10−4, so that T∗ is not quantum. The strict inclusion Q⊊Q~ in the minimal three-setting scenario is thereby established end-to-end with no reliance on floating-point computation. Anatomically, the witness is locally quantum: all nine of its 2×2 correlator subtables pass the Tsirelson-Landau-Masanes criterion, so its non-quantumness is irreducibly a three-setting phenomenon, concentrated in ordering-dependent pseudo-moments coupling each party's third setting to the other's first two; the level-2 certificate is equivalently an exact sum-of-squares identity that any quantum state values nonnegatively and the witness is forced to value at −q. The certificates follow the rational rounding-projection-lifting programme recently developed for noncommutative optimization; for NPA moment matrices in canonical form the required projection reduces to a per-moment uniform shift, making certification essentially free at these sizes, and we work the programme in both the feasibility and infeasibility directions on one witness. Machine-checkable certificates and verifiers requiring only the Python standard library accompany the paper. Files in this record: the paper (PDF); exact rational certificates for both theorems (i3322_1AB_certificate.json, i3322_level2_infeasibility_certificate.json); standalone verifiers requiring only the Python 3 standard library (verify_i3322_certificate.py, verify_level2_certificate.py); and the generating scripts (certify_landmark.py, certify_level2.py). See README_ancillary.txt for which artifact proves which theorem and how to run the verifiers. v2: corrects the mechanism attribution in Sec. 5 (anatomy) and adds the archive reference to Data Availability; theorems, certificates, and verifiers unchanged.
A post-release exact-arithmetic audit found a load-bearing global-amplitude gap in the Bellman upper-bound assembly of the earlier releases (v1.0.0-v1.2.0). Those releases are preserved as historical records; their exact-optimum, nonattainment, spatial-separation, and nonclosure claims are under correction and are not asserted by this version. What this version rigorously and unconditionally certifies: 0.2508753845015185 < omega_tensor <= omega_commuting <= 0.250875388108398 (window width 3.61e-9), with the lower endpoint an explicit 255-dimensional rational tensor-product strategy verified in exact arithmetic and independently reconstructed at 160-digit interval precision, and the upper endpoint an exact rational Bellman subsolution with an endpoint-clustered 25,601-knot witness, independently reconstructed cell by cell. The certificate stack, the audit that found the gap, a structural explanation (Bellman contact versus amplitude-normalization duality), and one recorded failed quantitative prediction are all included. Every load-bearing claim maps to replayable source and a frozen receipt.
Which properties of a quantum state are determined by two global observables and the outcomes of specified measurement sequences? On a calibrated four-level system, the marked observables determine two complementary qubit factor algebras without prior local qubit labels. For each measurement protocol, the paper asks how much entanglement every state compatible with its data must possess. For a single sequential measurement, retaining the complete outcome record gives sharp lower bounds on concurrence and negativity. A second measurement can be recorded either as a parity or as four resolved outcomes. The parity record gives a rank-five measurement space with explicit attainable bounds. Retaining individual population differences within a parity class can strengthen those bounds without further measurement runs. In an explicit example, the guaranteed concurrence rises from zero to one half. The paper identifies which population difference produces that gain and when the resulting certificate is exact. Further results include an exact rank formula for pulse sampling, a four-duration minimum within the specified pulse family, and explicit states for which rank-ten and rank-fourteen protocols certify entanglement in opposite directions. The manuscript gives finite-sample and calibration bounds and distinguishes reconstruction on the assumed system from identification of a physical realisation solely from probabilities. The accompanying archive contains fifteen Python verification scripts, run logs and a SHA-256 manifest. All numerical data are synthetic.
The noise threshold below which the qubit depolarizing channel retains positive quantum capacity has been studied since 1996. The classic constructions come with exact finite formulae, but in every reported threshold to date -- most recently the record of Agarwal et al. -- the final step, the sign of the coherent information at the reported point, is a floating-point evaluation. We give the first exact-arithmetic, independently machine-checkable positivity proofs in this regime: an explicit 45-copy rank-two input state A, published as a 1,472-byte witness, with certified Ic>0 at the exact rational p=16239/250000=0.064956 (per-Pauli convention; total error rate 3p=0.194868) -- beyond both the best value printed in the Agarwal et al. paper (0.064657) and the strongest state in the same authors' public repository (≈0.064911), both numerical. Because the depolarizing family is a semigroup under composition, fixed-input coherent information is nonincreasing in p on [0,1/4], so a single certified point extends to the entire interval below it. The same machinery confines the positivity boundaries of A and of the strongest public state of Agarwal et al. to disjoint rational intervals separated by more than 1/25000 -- to our knowledge the first proven ordering of the positivity boundaries of two explicit competing code states. Every computational claim in the paper reduces to a finite list of big-integer comparisons, checkable by a dependency-free few-hundred-line verifier whose soundness rests on three self-contained half-page lemmas. Payloads, certificates, and verifier accompany the paper as a supplementary artifact.
This record contains the preprint and complete machine-verifiable artifacts for CERTLIB, a solver-agnostic trust layer for quantum many-body and quantum chemistry computations. CERTLIB provides:a JSON-based schema for representing operator problems and exact rational certificates;a deterministic Python verifier that checks ncSOS and 2-RDM/PQG identities exactly over \mathbb{Q};a symbolic–numeric extraction pipeline for converting approximate floating-point solutions into exact rational algebraic identities.CERTLIB targets two widely used classes of operator statements:Noncommutative sum-of-squares (ncSOS) identitiesof the form H^{2} - \alpha H = \sum_{r} W_{r}^{\dagger} W_{r}, used in positivity and spectral-gap analysis.2-RDM dual certificates aligned with the PQG conerepresented via exact rational LDL^{\mathrm T} factorizations of dual matricesS = A - tI with D \succeq 0.All numeric entries in the JSON artifacts are encoded as{ "num": p, "den": q } with exact integer pairs, ensuring that verification requires no floating-point arithmetic.The reference verifier reconstructs each operator from JSON and checks the identities symbolically using Python’s fractions.Fraction.This package includes three case studies:L=20 ncSOS spin chain:An exact certificate for H^2 - H in a Pauli-bitset basis, sufficient to apply the Gosset–Mozgunov finite-size criterion for a bulk spectral gap under standard assumptions.O_3 active-space PQG examples (n = 66 and n = 153):2-RDM dual matrices derived from rationalized FCIDUMP data, each with an exact rational LDL^{\mathrm T} certificateS = A - tI = L D L^{\mathrm T}.Minimal PQG example with nonzero multipliers Y \neq 0:A hand-auditable 3×3 wedge-space problem demonstrating full CERTLIB support for adjoint mapsA = H - \mathcal{L}^*(Y) and nontrivial PQG multipliers.Contents of this Figshare record include:The PDF of the manuscript;JSON files for all ncSOS and PQG problems and certificates(spin chain, O_3 active spaces, and minimal PQG example with Y\neq 0);A Python reference verifier (verify_certificates.py) that re-checks every certificate exactly over \mathbb{Q};CERTLIB is intended as a lightweight reproducibility standard that journals, researchers, and software stacks can adopt to make numerical claims in quantum science auditable, portable, and verifiable by construction.