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

arXiv:2608.01317

Analytic Qubit Separation between POVMs and Projective Measurements

Lin Zhu, Ranyiliu Chen, Xin Wang, Shenggen Zheng

quant-phmath.OASubmitted Aug 2, 2026• Announced Aug 4, 2026• 0 citations• Revised Aug 31, 2026 (v2)
v1 · Aug 2, 2026v2 · Aug 31, 2026
arXivHTMLPDF

Abstract

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.

Comments
9 pages. Comments are welcome

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

Robust certification of non-projective measurements: theory and experiment

Raphael Brinster, Peter Tirler, Shishir Khandelwal +7 more

Determining the conditions under which positive operator-valued measures (POVMs), the most general class of quantum measurements, outperform projective measurements remains a challenging and largely unresolved problem. Of particular interest are projectively simulable POVMs, which can be realized through probabilistic mixtures of projective measurements, and therefore offer no advantage over projective schemes. Characterizing the boundary between simulable and non-simulable POVMs is, however, a difficult task, and existing tools either fail to scale efficiently, provide limited experimental feasibility or work only for specific POVMs. Here, we introduce and demonstrate a general method to certify non-simulability of a POVM by introducing a complete hierarchy of semidefinite programs. It provides upper bounds on the non-simulability measure of critical visibility of arbitrary POVMs which are tight in many cases and outperform previously known criteria. We experimentally certify the non-simulability of two- and three-dimensional POVMs using a trapped-ion qudit quantum processor by constructing non-simulability witnesses and introduce a modification of our framework that makes them robust against state preparation errors. Finally, we extend our results to the setting where an additional ancilla system is available.

quant-pharXiv:2511.04446•PRX Quantum•Nov 7, 2025•4 citations

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

Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space

Laurin E. Fischer, Daniel Miller, Francesco Tacchino +3 more

Informationally complete (IC) positive operator-valued measures (POVMs) are generalized quantum measurements that offer advantages over the standard computational basis readout of qubits. For instance, IC-POVMs enable efficient extraction of operator expectation values, a crucial step in many quantum algorithms. POVM measurements are typically implemented by coupling one additional ancilla qubit to each logical qubit, thus imposing high demands on the device size and connectivity. Here, we show how to implement a general class of IC-POVMs without ancilla qubits. We exploit the higher-dimensional Hilbert space of a qudit in which qubits are often encoded. POVMs can then be realized by coupling each qubit to two of the available qudit states, followed by a projective measurement. We develop the required control pulse sequences and numerically establish their feasibility for superconducting transmon qubits through pulse-level simulations. Finally, we present an experimental demonstration of a qudit-space POVM measurement on IBM Quantum hardware. This paves the way to making POVM measurements broadly available to quantum computing applications.

arXiv:2203.07369•Physical Review Research•Jul 11, 2022•52 citations

A Machine-Verified Separation of the Quantum and Almost-Quantum Sets in the 3322 Bell Scenario

Caleb Weiner

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 $I_{3322}$ (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\times10^{-8}$), in the normalization with classical bound $0$ and quantum maximum $\approx0.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\times10^{-4}$, so that $T^{*}$ is not quantum. The strict inclusion $Q\subsetneq\tilde{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\times2$ 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.

•Jul 24, 2026•3 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
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
Determining the conditions under which positive operator-valued measures (POVMs), the most general class of quantum measurements, outperform projective measurements remains a challenging and largely unresolved problem. Of particular interest are projectively simulable POVMs, which can be realized through probabilistic mixtures of projective measurements, and therefore offer no advantage over projective schemes. Characterizing the boundary between simulable and non-simulable POVMs is, however, a difficult task, and existing tools either fail to scale efficiently, provide limited experimental feasibility or work only for specific POVMs. Here, we introduce and demonstrate a general method to certify non-simulability of a POVM by introducing a complete hierarchy of semidefinite programs. It provides upper bounds on the non-simulability measure of critical visibility of arbitrary POVMs which are tight in many cases and outperform previously known criteria. We experimentally certify the non-simulability of two- and three-dimensional POVMs using a trapped-ion qudit quantum processor by constructing non-simulability witnesses and introduce a modification of our framework that makes them robust against state preparation errors. Finally, we extend our results to the setting where an additional ancilla system is available.
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
Informationally complete (IC) positive operator-valued measures (POVMs) are generalized quantum measurements that offer advantages over the standard computational basis readout of qubits. For instance, IC-POVMs enable efficient extraction of operator expectation values, a crucial step in many quantum algorithms. POVM measurements are typically implemented by coupling one additional ancilla qubit to each logical qubit, thus imposing high demands on the device size and connectivity. Here, we show how to implement a general class of IC-POVMs without ancilla qubits. We exploit the higher-dimensional Hilbert space of a qudit in which qubits are often encoded. POVMs can then be realized by coupling each qubit to two of the available qudit states, followed by a projective measurement. We develop the required control pulse sequences and numerically establish their feasibility for superconducting transmon qubits through pulse-level simulations. Finally, we present an experimental demonstration of a qudit-space POVM measurement on IBM Quantum hardware. This paves the way to making POVM measurements broadly available to quantum computing applications.
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 I3322I_{3322}I3322​ (Froissart) functional over the almost-quantum set -- the 1+AB1{+}AB1+AB level of the Navascues-Pironio-Acin (NPA) hierarchy -- is certified to lie between 0.25147088380.25147088380.2514708838 and 0.25147090160.25147090160.2514709016 (width <2×10−8<2\times10^{-8}<2×10−8), in the normalization with classical bound 000 and quantum maximum ≈0.2508754\approx0.2508754≈0.2508754; to our knowledge no value for this landmark had been published. Second, we exhibit a single exact rational behavior T∗T^{*}T∗ carrying certificates in both directions: a rational moment matrix proving T∗T^{*}T∗ almost-quantum, and a rational dual object proving that every NPA level-2 completion of T∗T^{*}T∗ requires slack at least q=4.5934×10−4q=4.5934\times10^{-4}q=4.5934×10−4, so that T∗T^{*}T∗ is not quantum. The strict inclusion Q⊊Q~Q\subsetneq\tilde{Q}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×22\times22×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-q−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.
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