REVIEW 5 cited by
Contextuality for preparations, transformations, and unsharp measurements
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Contextuality for preparations, transformations, and unsharp measurements
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.
Forward citations
Cited by 5 Pith papers
-
Which Classicality? Incidence, Simplex, and Product-Rule Tests in Finite Quantum Logics
Classicality of finite quantum logics is bookkeeping-dependent: incidence, simplex-embedding, and product-rule tests diagnose different retained structures, with GHZ classical as one Boolean context and fragment-speci...
-
Answer Partitions and Oracle Access Determine Quantum Query Complexity
The abstract and full text of arXiv:2605.12675 describe different papers; the abstract's partition-query classification is absent from the v3 text, which is a clarificatory essay with a correct but routine which-path-...
-
Answer Partitions and Oracle Access Determine Quantum Query Complexity
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...
-
Answer Partitions and Oracle Access Determine Quantum Query Complexity
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 ...
-
Answer Partitions and Oracle Access Determine Quantum Query Complexity
Quantum speedup stems from matching problem structure to interference patterns under constraints of measurement contexts, thermodynamic irreversibility, and contextuality, rather than from parallel computation.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.