Pith. sign in

REVIEW 1 cited by

Coarse-graining and compounding as monads

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

arxiv 2410.08818 v1 pith:IKDP7YBB submitted 2024-10-11 quant-ph

classification quant-ph
keywords formationmonadssequentialcoarse-grainingconstructionseffectsexperimentsinterference
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Two very basic constructions involving experimental procedures are the formation of coarse-grained versions of experiments, and the formation of branching sequential experiments. The latter allow for the conditioning of states on the results of previous measurements. When one conditions on the results of different coarse-grainings of the same previous experiment, the possibility of interference effects arises. Here, I show how to formulate both constructions in terms of monads on a suitable category of (general) probabilistic models. Moreover, I show that these are connected by distributive law, allowing for a composite monad describing the closure of a probabilistic model under both coarse-graining and sequential measurement. Algebras for all three monads are characterized; lessons are drawn regarding the possibility of interference and also regarding the formation of sequential products of effects; and connections are made with some themes from the older quantum-logical literature.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Generalized Probability Theory: notes for a short course

    quant-ph 2025-01 unverdicted novelty 3.0 of 10

    An expert survey presenting GPTs as generalized probability theory through Foulis-Randall test spaces and their linearized ordered-vector-space form.

Pith tools