Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Minimum Bell-Setting Complexity for Qubit POVM–PVM Separation

Alec Kriebel

Published Jul 30, 2026• 0 citations
Publisher

Abstract

This unreviewed preprint establishes a minimum-setting classification for fixed-qubit POVM–PVM separation in bipartite Bell experiments. For every two-input-per-party architecture with arbitrary finite, input-dependent output alphabets, the shared-randomness convex hull of qubit POVM behaviors equals the shared-randomness convex hull of fixed-qubit PVM behaviors. The paper also gives an explicit rational 3×2 Bell functional with an exact qubit-POVM strategy whose value exceeds a global analytic qubit-PVM upper bound. Consequently, 3×2, up to exchanging the parties, is the minimum input architecture for such a linear Bell-functional separation. The equality concerns convexified behavior sets. It does not assert equality of the raw nonconvex strategy images, same-state simulation, or operator-level projective simulability of individual POVMs. Generative-AI systems were used substantively throughout the mathematical exploration, derivation, adversarial proof analysis, software development, literature support, and manuscript preparation. The human author accepts responsibility for all claims, citations, and released artifacts. At the time of this version’s initial release, the manuscript had not undergone independent expert peer review. Source release: https://github.com/AlecKriebel/Math/releases/tag/qubit-povm-pvm-minimum-settings-v1.1.0

DOI
10.5281/zenodo.21699068

Related papers

Minimum Bell-Setting Complexity for Qubit POVM–PVM Separation

Alec Kriebel

This unreviewed preprint establishes a minimum-setting classification for fixed-qubit POVM–PVM separation in bipartite Bell experiments. For every two-input-per-party architecture with arbitrary finite, input-dependent output alphabets, the shared-randomness convex hull of qubit POVM behaviors equals the shared-randomness convex hull of fixed-qubit PVM behaviors. The paper also gives an explicit rational 3×2 Bell functional with an exact qubit-POVM strategy whose value exceeds a global analytic qubit-PVM upper bound. Consequently, 3×2, up to exchanging the parties, is the minimum input architecture for such a linear Bell-functional separation. The equality concerns convexified behavior sets. It does not assert equality of the raw nonconvex strategy images, same-state simulation, or operator-level projective simulability of individual POVMs. Generative-AI systems were used substantively throughout the mathematical exploration, derivation, adversarial proof analysis, software development, literature support, and manuscript preparation. The human author accepts responsibility for all claims, citations, and released artifacts. At the time of this version’s initial release, the manuscript had not undergone independent expert peer review. Source release: https://github.com/AlecKriebel/Math/releases/tag/qubit-povm-pvm-minimum-settings-v1.1.0

•Jul 30, 2026•0 citations

Analytic Qubit Separation between POVMs and Projective Measurements

Lin Zhu, Ranyiliu Chen, Xin Wang +1 more

Generalized measurements can be implemented projectively after enlarging the Hilbert space, but this dilation changes the available local dimension. We construct a Bell functional with rational coefficients that separates the two measurement models at local dimension two. An explicit three-outcome qubit positive-operator-valued measure with rational matrix entries attains $2\sqrt2+1/100$. On the other hand, all qubit-projective strategies are bounded by $2\sqrt2+\sqrt5/250+\sqrt2/32400$, giving a fully analytic certified gap greater than $1/1000$. To our knowledge, this is the first fully analytic Bell-functional separation between qubit POVMs and qubit projective measurements over arbitrary shared two-qubit states. Lean certificate for the separation theorem is provided for completeness. Separately, an exact level-3 noncommutative sum-of-squares certificate proves that the explicit qubit strategy attains the unrestricted finite-dimensional tensor-product quantum optimum.

quant-pharXiv:2608.01317•Aug 4, 2026•0 citations

Minimum Bell-Setting Complexity for Qubit POVM–PVM Separation LaTeX Source

Alec Kriebel

This unreviewed preprint establishes a minimum-setting classification for fixed-qubit POVM–PVM separation in bipartite Bell experiments. For every two-input-per-party architecture with arbitrary finite, input-dependent output alphabets, the shared-randomness convex hull of qubit POVM behaviors equals the shared-randomness convex hull of fixed-qubit PVM behaviors. The paper also gives an explicit rational 3×2 Bell functional with an exact qubit-POVM strategy whose value exceeds a global analytic qubit-PVM upper bound. Consequently, 3×2, up to exchanging the parties, is the minimum input architecture for such a linear Bell-functional separation. The equality concerns convexified behavior sets. It does not assert equality of the raw nonconvex strategy images, same-state simulation, or operator-level projective simulability of individual POVMs. Generative-AI systems were used substantively throughout the mathematical exploration, derivation, adversarial proof analysis, software development, literature support, and manuscript preparation. The human author accepts responsibility for all claims, citations, and released artifacts. At the time of this version’s initial release, the manuscript had not undergone independent expert peer review. Source release: https://github.com/AlecKriebel/Math/releases/tag/qubit-povm-pvm-minimum-settings-v1.1.0

•Jul 30, 2026•0 citations

A Qubit–Qutrit Equivalence for Centrally Symmetric Two-Query Quantum Correlations

Vasily Psykovsky

We establish a qubit–qutrit equivalence for centrally symmetric prepare-and-measure correlations involving two fixed binary queries and no shared randomness between preparation and measurement devices. For arbitrary pairs of Hermitian contractions on a three-dimensional Hilbert space, we prove a spectral-domination result that implies the following: any centrally symmetric family of target expectation pairs approximable by two binary POVMs on a qutrit, within a common compact convex centrally symmetric tolerance, is equally approximable using two fixed projective measurements on a qubit. As an exact consequence, for the four rectangular targets (±a, ±b), the optimal worst-cell total-variation error in dimensions two and three is ε₂ = ε₃ = max{0, [a + b − √(2 − (a − b)²)] / 4}, whereas dimension four permits exact reproduction. In particular, a qutrit with arbitrary binary POVMs cannot improve upon the optimal qubit worst-case success probability of (1 + 1/√2)/2 for the 2-to-1 random-access code without shared randomness. The proof uses spectral subspace intersection in dimension three and does not require the measurement operators to possess common reducing subspaces. Explicit counterexamples establish the importance of the dimensional and operational assumptions. The results provide a mathematical characterization of quantum carrier-dimension constraints, with applications to prepare-and-measure correlations and operationally recoverable historical information. Status: Research preprint, prepared for independent peer review. Not peer-reviewed. Reproducibility: Supplementary proofs, exact symbolic certificates, verification scripts and a SHA-256 manifest accompany the manuscript.

•Nov 8, 2026•4 citations

Exact and certified bounds for the Bell inequality J62 of Pál and Vértesi

Artus Krohn-Grimberghe

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.

•Aug 28, 2026•0 citations

Bell-Nonlocal Quantum Entanglement as Boundary-Level Compatibility

Amos Jay Maley Maley

A Kernel-Role Determinacy Theorem for Bell-Witness Fixation, No-Signaling, and Tensor-Level Compatibility This manuscript develops a fixed-domain AASC analysis of Bell-nonlocal quantum entanglement as a theorem of reusable witness determinacy. It does not introduce hidden variables, modify quantum mechanics, derive Hilbert-space formalism from below, or propose a new signaling mechanism. Instead, it asks a prior structural question: once a Bell-type operational family is used as the same non-degenerate witness across settings, lawful transformations, retained records, comparison, and later classification, what admissible same-domain standing form is forced? The governing claim is that AASC is not an optional interpretive overlay on physics. Once an operational Bell family is asserted as a determinate reusable witness, admissibility, standing, reference, and irreversibility are already active as minimal necessity conditions of same-witness objecthood. Target instantiation therefore carries governance occupancy: an alleged determinate Bell witness with no admissible governance realization is not an empty alternative, but a refusal or retyping of the target. The manuscript defines finite operational Bell objects with explicit setting carriers, outcome families, channel/interface data, standing-token valuations, continuation and report/reuse structure, comparison profiles, and act-time status. It then defines object-indexed query sorts, dependent response families, exactly recoverable operational simulations, lawful Bell groupoids, six governance-effect functors, and target-active extensional governance equivalence. The result is a typed interface in which arbitrary native formalisms can be compared by their target-bearing governance effects rather than by their internal syntax. The central Bell-specific theorem states that every same-target candidate-admissible Bell-governance construction is forced component by component into the certified boundary-compatible standing form on the complete target-active practice. Candidate admissibility does not assume the canonical form at the outset. Instead, target occupancy, lawful transport, standing-flow exclusion, compatibility certification, coordinate-deviation exhaustion, and componentwise closure force exact target-bearing realization and governance equivalence to the canonical representative CP∗C^{*}_{P}CP∗. The target-induced governance quotient therefore has exactly one element. The Bell carrier is treated as a compatible empirical model on a finite measurement cover. Bell-local completion is identified with the existence of a global section, and Bell nonlocality is the obstruction to such a section. The manuscript separates operational marginal invariance, absence of controllable communication, and exclusion of same-domain standing transport. No-signaling is therefore preserved without retyping Bell nonlocality as superluminal communication, metric transport, distant repair, or hidden standing transfer. The finite-dimensional quantum specialization uses the standard bipartite tensor-product and local-POVM carrier. Every separable realization in that carrier is Bell-local; therefore, if the fixed Bell-nonlocal empirical model has such a finite-dimensional quantum realization, every realizing state in that carrier is entangled. Post-quantum Bell-nonlocal no-signaling models remain within the general witness theorem but outside the quantum-entanglement corollary. The accompanying Lean 4 development, release v0.8.0, directly verifies the finite Bell-side witness carrier: denominator-32 vector/Born weights, structural no-signaling, CHSH numerator 808080, all sixteen deterministic local extrema, finite denominator-32 Bell-local-envelope exclusion, and conditional endpoint routing. Its direct witness certificate is vectorBorn_flagship_spine, and its deepest released endpoint is reasonableDeepestFiniteEntanglement_spine. The manuscript-level typed governance interface, empirical lawful groupoid, compatibility equivalence, coordinate-deviation exhaustion, completed role collapse, candidate-to-canonical derivation, and finite-dimensional quantum specialization are not attributed to the released Lean layer. This paper is the Bell-witness member of the paired AASC quantum determinacy arc. The record-side manuscript, Admissible Record Construction in Physically Non-Selective Quantum Regimes, fixes when local physical record occurrences stand as the same evidential record objects. The present manuscript fixes when the Bell operational family sampled by such records stands as the same reusable witness. The paired endpoint is therefore: record-role fixation+Bell-witness compatibility.\text{record-role fixation} + \text{Bell-witness compatibility}.record-role fixation+Bell-witness compatibility. The manuscript is classificatory and eliminative rather than mechanistic. It does not claim that AASC generates the Bell probabilities or supplies a hidden physical influence. Its claim is that reusable Bell-witness determinacy strongly constrains how Bell-nonlocal correlations may be coherently classified on a fixed domain: not as independently complete local states later connected by a mechanism, not as Bell-local hidden-variable value assignments, not as superluminal signaling, and not as same-act repair, but as boundary-level compatibility carried by one standing-preserving Bell witness.

•Apr 3, 2026•3 citations
This unreviewed preprint establishes a minimum-setting classification for fixed-qubit POVM–PVM separation in bipartite Bell experiments. For every two-input-per-party architecture with arbitrary finite, input-dependent output alphabets, the shared-randomness convex hull of qubit POVM behaviors equals the shared-randomness convex hull of fixed-qubit PVM behaviors. The paper also gives an explicit rational 3×2 Bell functional with an exact qubit-POVM strategy whose value exceeds a global analytic qubit-PVM upper bound. Consequently, 3×2, up to exchanging the parties, is the minimum input architecture for such a linear Bell-functional separation. The equality concerns convexified behavior sets. It does not assert equality of the raw nonconvex strategy images, same-state simulation, or operator-level projective simulability of individual POVMs. Generative-AI systems were used substantively throughout the mathematical exploration, derivation, adversarial proof analysis, software development, literature support, and manuscript preparation. The human author accepts responsibility for all claims, citations, and released artifacts. At the time of this version’s initial release, the manuscript had not undergone independent expert peer review. Source release: https://github.com/AlecKriebel/Math/releases/tag/qubit-povm-pvm-minimum-settings-v1.1.0
This unreviewed preprint establishes a minimum-setting classification for fixed-qubit POVM–PVM separation in bipartite Bell experiments. For every two-input-per-party architecture with arbitrary finite, input-dependent output alphabets, the shared-randomness convex hull of qubit POVM behaviors equals the shared-randomness convex hull of fixed-qubit PVM behaviors. The paper also gives an explicit rational 3×2 Bell functional with an exact qubit-POVM strategy whose value exceeds a global analytic qubit-PVM upper bound. Consequently, 3×2, up to exchanging the parties, is the minimum input architecture for such a linear Bell-functional separation. The equality concerns convexified behavior sets. It does not assert equality of the raw nonconvex strategy images, same-state simulation, or operator-level projective simulability of individual POVMs. Generative-AI systems were used substantively throughout the mathematical exploration, derivation, adversarial proof analysis, software development, literature support, and manuscript preparation. The human author accepts responsibility for all claims, citations, and released artifacts. At the time of this version’s initial release, the manuscript had not undergone independent expert peer review. Source release: https://github.com/AlecKriebel/Math/releases/tag/qubit-povm-pvm-minimum-settings-v1.1.0
Generalized measurements can be implemented projectively after enlarging the Hilbert space, but this dilation changes the available local dimension. We construct a Bell functional with rational coefficients that separates the two measurement models at local dimension two. An explicit three-outcome qubit positive-operator-valued measure with rational matrix entries attains 22+1/1002\sqrt2+1/10022​+1/100. On the other hand, all qubit-projective strategies are bounded by 22+5/250+2/324002\sqrt2+\sqrt5/250+\sqrt2/3240022​+5​/250+2​/32400, giving a fully analytic certified gap greater than 1/10001/10001/1000. To our knowledge, this is the first fully analytic Bell-functional separation between qubit POVMs and qubit projective measurements over arbitrary shared two-qubit states. Lean certificate for the separation theorem is provided for completeness. Separately, an exact level-3 noncommutative sum-of-squares certificate proves that the explicit qubit strategy attains the unrestricted finite-dimensional tensor-product quantum optimum.
This unreviewed preprint establishes a minimum-setting classification for fixed-qubit POVM–PVM separation in bipartite Bell experiments. For every two-input-per-party architecture with arbitrary finite, input-dependent output alphabets, the shared-randomness convex hull of qubit POVM behaviors equals the shared-randomness convex hull of fixed-qubit PVM behaviors. The paper also gives an explicit rational 3×2 Bell functional with an exact qubit-POVM strategy whose value exceeds a global analytic qubit-PVM upper bound. Consequently, 3×2, up to exchanging the parties, is the minimum input architecture for such a linear Bell-functional separation. The equality concerns convexified behavior sets. It does not assert equality of the raw nonconvex strategy images, same-state simulation, or operator-level projective simulability of individual POVMs. Generative-AI systems were used substantively throughout the mathematical exploration, derivation, adversarial proof analysis, software development, literature support, and manuscript preparation. The human author accepts responsibility for all claims, citations, and released artifacts. At the time of this version’s initial release, the manuscript had not undergone independent expert peer review. Source release: https://github.com/AlecKriebel/Math/releases/tag/qubit-povm-pvm-minimum-settings-v1.1.0
We establish a qubit–qutrit equivalence for centrally symmetric prepare-and-measure correlations involving two fixed binary queries and no shared randomness between preparation and measurement devices. For arbitrary pairs of Hermitian contractions on a three-dimensional Hilbert space, we prove a spectral-domination result that implies the following: any centrally symmetric family of target expectation pairs approximable by two binary POVMs on a qutrit, within a common compact convex centrally symmetric tolerance, is equally approximable using two fixed projective measurements on a qubit. As an exact consequence, for the four rectangular targets (±a, ±b), the optimal worst-cell total-variation error in dimensions two and three is ε₂ = ε₃ = max{0, [a + b − √(2 − (a − b)²)] / 4}, whereas dimension four permits exact reproduction. In particular, a qutrit with arbitrary binary POVMs cannot improve upon the optimal qubit worst-case success probability of (1 + 1/√2)/2 for the 2-to-1 random-access code without shared randomness. The proof uses spectral subspace intersection in dimension three and does not require the measurement operators to possess common reducing subspaces. Explicit counterexamples establish the importance of the dimensional and operational assumptions. The results provide a mathematical characterization of quantum carrier-dimension constraints, with applications to prepare-and-measure correlations and operationally recoverable historical information. Status: Research preprint, prepared for independent peer review. Not peer-reviewed. Reproducibility: Supplementary proofs, exact symbolic certificates, verification scripts and a SHA-256 manifest accompany the manuscript.
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.
A Kernel-Role Determinacy Theorem for Bell-Witness Fixation, No-Signaling, and Tensor-Level Compatibility This manuscript develops a fixed-domain AASC analysis of Bell-nonlocal quantum entanglement as a theorem of reusable witness determinacy. It does not introduce hidden variables, modify quantum mechanics, derive Hilbert-space formalism from below, or propose a new signaling mechanism. Instead, it asks a prior structural question: once a Bell-type operational family is used as the same non-degenerate witness across settings, lawful transformations, retained records, comparison, and later classification, what admissible same-domain standing form is forced? The governing claim is that AASC is not an optional interpretive overlay on physics. Once an operational Bell family is asserted as a determinate reusable witness, admissibility, standing, reference, and irreversibility are already active as minimal necessity conditions of same-witness objecthood. Target instantiation therefore carries governance occupancy: an alleged determinate Bell witness with no admissible governance realization is not an empty alternative, but a refusal or retyping of the target. The manuscript defines finite operational Bell objects with explicit setting carriers, outcome families, channel/interface data, standing-token valuations, continuation and report/reuse structure, comparison profiles, and act-time status. It then defines object-indexed query sorts, dependent response families, exactly recoverable operational simulations, lawful Bell groupoids, six governance-effect functors, and target-active extensional governance equivalence. The result is a typed interface in which arbitrary native formalisms can be compared by their target-bearing governance effects rather than by their internal syntax. The central Bell-specific theorem states that every same-target candidate-admissible Bell-governance construction is forced component by component into the certified boundary-compatible standing form on the complete target-active practice. Candidate admissibility does not assume the canonical form at the outset. Instead, target occupancy, lawful transport, standing-flow exclusion, compatibility certification, coordinate-deviation exhaustion, and componentwise closure force exact target-bearing realization and governance equivalence to the canonical representative CP∗C^{*}_{P}CP∗. The target-induced governance quotient therefore has exactly one element. The Bell carrier is treated as a compatible empirical model on a finite measurement cover. Bell-local completion is identified with the existence of a global section, and Bell nonlocality is the obstruction to such a section. The manuscript separates operational marginal invariance, absence of controllable communication, and exclusion of same-domain standing transport. No-signaling is therefore preserved without retyping Bell nonlocality as superluminal communication, metric transport, distant repair, or hidden standing transfer. The finite-dimensional quantum specialization uses the standard bipartite tensor-product and local-POVM carrier. Every separable realization in that carrier is Bell-local; therefore, if the fixed Bell-nonlocal empirical model has such a finite-dimensional quantum realization, every realizing state in that carrier is entangled. Post-quantum Bell-nonlocal no-signaling models remain within the general witness theorem but outside the quantum-entanglement corollary. The accompanying Lean 4 development, release v0.8.0, directly verifies the finite Bell-side witness carrier: denominator-32 vector/Born weights, structural no-signaling, CHSH numerator 808080, all sixteen deterministic local extrema, finite denominator-32 Bell-local-envelope exclusion, and conditional endpoint routing. Its direct witness certificate is vectorBorn_flagship_spine, and its deepest released endpoint is reasonableDeepestFiniteEntanglement_spine. The manuscript-level typed governance interface, empirical lawful groupoid, compatibility equivalence, coordinate-deviation exhaustion, completed role collapse, candidate-to-canonical derivation, and finite-dimensional quantum specialization are not attributed to the released Lean layer. This paper is the Bell-witness member of the paired AASC quantum determinacy arc. The record-side manuscript, Admissible Record Construction in Physically Non-Selective Quantum Regimes, fixes when local physical record occurrences stand as the same evidential record objects. The present manuscript fixes when the Bell operational family sampled by such records stands as the same reusable witness. The paired endpoint is therefore: record-role fixation+Bell-witness compatibility.\text{record-role fixation} + \text{Bell-witness compatibility}.record-role fixation+Bell-witness compatibility. The manuscript is classificatory and eliminative rather than mechanistic. It does not claim that AASC generates the Bell probabilities or supplies a hidden physical influence. Its claim is that reusable Bell-witness determinacy strongly constrains how Bell-nonlocal correlations may be coherently classified on a fixed domain: not as independently complete local states later connected by a mechanism, not as Bell-local hidden-variable value assignments, not as superluminal signaling, and not as same-act repair, but as boundary-level compatibility carried by one standing-preserving Bell witness.