pith. sign in

arxiv: quant-ph/0406166 · v3 · pith:M3HEWYPMnew · submitted 2004-06-23 · 🪐 quant-ph

Contextuality for preparations, transformations, and unsharp measurements

classification 🪐 quant-ph
keywords proceduresappliescontextualityjustmodelsratherthreearbitrary
0
0 comments X
read the original abstract

An operational definition of contextuality is introduced which generalizes the standard notion in three ways: (1) it applies to arbitrary operational theories rather than just quantum theory, (2) it applies to arbitrary experimental procedures, rather than just sharp measurements, and (3) it applies to a broad class of ontological models of quantum theory, rather than just deterministic hidden variable models. We derive three no-go theorems for ontological models, each based on an assumption of noncontextuality for a different sort of experimental procedure; one for preparation procedures, another for unsharp measurement procedures (that is, measurement procedures associated with positive-operator valued measures), and a third for transformation procedures. All three proofs apply to two-dimensional Hilbert spaces, and are therefore stronger than traditional proofs of contextuality.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The Physical and Contextual Limits of Quantum Speedup

    quant-ph 2026-05 unverdicted novelty 3.0

    Quantum speedups arise from engineered interference in high-dimensional Hilbert spaces rather than classical branchwise parallelism, constrained by no unitary garbage erasure, contextuality, and absence of absorbing h...

  2. The Physical and Contextual Limits of Quantum Speedup

    quant-ph 2026-05 unverdicted novelty 3.0

    Quantum speedups come from reversible embeddings and engineered interference that identify solution classes rather than from branchwise classical parallelism, subject to limits like impossible unitary garbage erasure ...