pith. sign in

arxiv: 2606.27805 · v1 · pith:2JUVTEE4new · submitted 2026-06-26 · 💻 cs.LO · cs.PL· math.CT· quant-ph

The quantum instrument monad

Tobias Fritz This is my paper

Pith reviewed 2026-06-29 02:31 UTC · model grok-4.3

classification 💻 cs.LO cs.PLmath.CTquant-ph
keywords quantum instrument monadquantum observable algebrasnoncommutative state monadquantum computational effectsvon Neumann algebrasstrong monadscategorical semanticsmeasurable spaces
0
0 comments X

The pith

The quantum instrument monad models computations interacting with a quantum system with observable algebra A as a noncommutative generalization of the state monad.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines a new monad that captures how a computation can interact with a quantum system whose observables form an algebra A. This structure is built as a direct noncommutative analogue of the state monad from functional programming. Two constructions are given: one finitary version on the category of sets and one measure-theoretic version on measurable spaces. The second version rests on a newly introduced integral that takes a quantum-operation-valued function and integrates it against a state-valued measure. If the construction succeeds, it supplies a categorical account of quantum computational effects that can be used in the same way state is used in classical programming.

Core claim

The quantum instrument monad I_A is introduced as a strong monad that models the effect of a computation interacting with a quantum system whose algebra of observables is A. It is constructed in a finitary version on sets and, under the assumption that A is a type I von Neumann algebra with separable predual, in a measure-theoretic version on measurable spaces. The latter construction relies on a new integral of a quantum-operation-valued function against a state-valued measure. Both versions are strong monads and serve as a noncommutative generalization of the state monad.

What carries the argument

The quantum instrument monad I_A itself, which encodes the interaction of computations with the quantum observable algebra A via instruments and supplies the monadic structure.

If this is right

  • The finitary version on sets requires no extra assumptions on A and directly yields a strong monad.
  • The measure-theoretic version supplies a concrete integral operation that combines quantum operations with state measures over measurable spaces.
  • Both versions preserve the monadic laws and the strength property needed for modeling effects in a programming-language setting.
  • The construction gives a uniform way to treat quantum interaction as a computational effect parallel to classical state.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The monad could be used to give semantics to quantum extensions of functional programming languages that already use the state monad.
  • Similar integral constructions might be attempted on other base categories such as topological spaces or domains.
  • The approach may link to existing work on quantum channels and instruments by providing an explicit monadic composition rule.

Load-bearing premise

The measure-theoretic version of the monad requires that the observable algebra A is a type I von Neumann algebra with separable predual.

What would settle it

An explicit counterexample on some type I von Neumann algebra with separable predual where either the proposed integral fails to be well-defined or the resulting structure violates one of the strong monad axioms.

read the original abstract

Monads are a ubiquitous structure in functional programming used for modelling computational effects. For example, the state monad models the effect of a computation interacting with a memory system. Here we introduce the quantum instrument monad $\mathcal{I}_\mathcal{A}$, which models the effect of a computation interacting with a quantum system with algebra of observables $\mathcal{A}$. It can be thought of as a noncommutative generalization of the state monad. We construct this quantum instrument monad in two versions: a finitary version on the category of sets and a measure-theoretic version on the category of measurable spaces (the latter under the assumption that $\mathcal{A}$ is a type I von Neumann algebra with separable predual). Both versions are strong monads. The construction of the measure-theoretic version is based on a new notion of integral of a quantum-operation-valued function against a state-valued measure.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper introduces the quantum instrument monad τ_A as a noncommutative generalization of the state monad, modeling computations that interact with a quantum system whose observables form the algebra A. It constructs a finitary version on the category of sets and a measure-theoretic version on measurable spaces (the latter requiring A to be a type I von Neumann algebra with separable predual). Both are shown to be strong monads, with the measure-theoretic construction relying on a newly defined integral of quantum-operation-valued functions against state-valued measures.

Significance. If the constructions and monad laws hold, the work supplies a categorical semantics tool for quantum effects in programming, extending classical monadic effect modeling to noncommutative settings. The new integral notion may prove useful beyond this application in operator-algebraic probability. Explicit verification that both versions are strong monads is a concrete, checkable contribution.

major comments (2)
  1. [§3.2] §3.2, Definition 3.4: the finitary monad multiplication is defined via composition of instruments; the verification that this satisfies the monad associativity axiom appears to rest on the finite-dimensional case only, and it is unclear whether the same argument extends without additional structure when A is infinite-dimensional.
  2. [§4.3] §4.3, Theorem 4.7: the claim that the measure-theoretic version is a strong monad uses the new integral to define the Kleisli extension; the proof sketch does not explicitly address whether the integral preserves the required measurability when the state-valued measure is only weakly continuous, which is load-bearing for the construction under the separable-predual hypothesis.
minor comments (2)
  1. [§2] Notation for the algebra A is introduced in the abstract but the precise category of objects (e.g., whether A is fixed or varies) is not restated at the beginning of §2; adding a short paragraph would improve readability.
  2. The paper cites several works on quantum instruments and monads in programming but omits recent references on noncommutative integration (e.g., works building on Takesaki or on quantum probability by Accardi et al.); a brief comparison would help situate the new integral.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading, positive assessment, and constructive comments. We address each major comment below. Both points can be resolved by expanding proofs and adding clarifications in a revised manuscript.

read point-by-point responses

  1. Referee: [§3.2] §3.2, Definition 3.4: the finitary monad multiplication is defined via composition of instruments; the verification that this satisfies the monad associativity axiom appears to rest on the finite-dimensional case only, and it is unclear whether the same argument extends without additional structure when A is infinite-dimensional.

    Authors: The finitary construction on Set in §3 applies to general von Neumann algebras A (no finite-dimensionality assumption is stated or used). Instrument composition is associative by the definition of instruments as normalized completely positive maps, which holds independently of dimension. The current proof sketch focuses on the finite case for brevity but extends verbatim to the infinite-dimensional setting. We will revise the manuscript to include an explicit general proof of associativity that makes no reference to dimension. revision: yes

  2. Referee: [§4.3] §4.3, Theorem 4.7: the claim that the measure-theoretic version is a strong monad uses the new integral to define the Kleisli extension; the proof sketch does not explicitly address whether the integral preserves the required measurability when the state-valued measure is only weakly continuous, which is load-bearing for the construction under the separable-predual hypothesis.

    Authors: We agree the proof sketch in Theorem 4.7 is concise and omits explicit verification of measurability preservation under weak continuity. The separable-predual hypothesis ensures the state space is metrizable in the weak* topology, allowing the integral (defined via the new operator-valued notion) to be shown measurable by approximation with countable dense sets. We will expand the proof in the revision to include this argument in full detail. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper introduces a new monad construction (quantum instrument monad) resting on an explicitly new integral notion for quantum-operation-valued functions against state-valued measures. Both the finitary and measure-theoretic versions are presented as direct constructions on the respective categories, with the measure-theoretic case conditioned on a stated assumption about the algebra A (type I von Neumann with separable predual). No load-bearing step reduces by definition, fitted parameter, or self-citation chain to the target result; the derivation chain is self-contained against external benchmarks and does not invoke prior author work to force uniqueness or smuggle an ansatz.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard category-theoretic definitions of monads and strong monads plus the domain-specific assumption on the von Neumann algebra A; no free parameters or invented entities are mentioned.

axioms (1)
  • domain assumption A is a type I von Neumann algebra with separable predual
    Explicitly required for the measure-theoretic version of the monad as stated in the abstract.

pith-pipeline@v0.9.1-grok · 5668 in / 1126 out tokens · 36756 ms · 2026-06-29T02:31:23.270076+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

31 extracted references · 21 canonical work pages · 3 internal anchors

  1. [1]

    An operational approach to quantum probability,

    E. B. Davies and J. T. Lewis, “An operational approach to quantum probability,”Communi- cations in Mathematical Physics, vol. 17, no. 3, pp. 239–260, 1970.doi: 10.1007/BF01647093 (cit. on p. 1)

    work page doi:10.1007/bf01647093 1970

  2. [2]

    Quantum measuring processes of continuous observables,

    Masanao Ozawa, “Quantum measuring processes of continuous observables,”Journal of Mathematical Physics, vol. 25, no. 1, pp. 79–87, 1984.doi: 10.1063/1.526000 (cit. on pp. 1, 12)

    work page doi:10.1063/1.526000 1984

  3. [3]

    Cambridge University Press, 2012.doi: 10.1017/CBO9781139031103 (cit

    Teiko Heinosaari and M´ ario Ziman,The Mathematical Language of Quantum Theory: From Un- certainty to Entanglement. Cambridge University Press, 2012.doi: 10.1017/CBO9781139031103 (cit. on p. 1)

    work page doi:10.1017/cbo9781139031103 2012

  4. [4]

    Notions of computation and monads,

    Eugenio Moggi, “Notions of computation and monads,”Information and Computation, vol. 93, no. 1, pp. 55–92, 1991.doi:10.1016/0890-5401(91)90052-4(cit. on pp. 1, 2)

    work page doi:10.1016/0890-5401(91)90052-4(cit 1991

  5. [5]

    A brief survey of quantum programming languages,

    Peter Selinger, “A brief survey of quantum programming languages,” inProceedings of the 7th International Symposium on Functional and Logic Programming, Yukiyoshi Kameyama and Peter J. Stuckey, Eds., ser. Lecture Notes in Computer Science, vol. 2998, Springer, 2004, pp. 1–6.doi:10.1007/978-3-540-24754-8_1(cit. on p. 2)

    work page doi:10.1007/978-3-540-24754-8_1(cit 2004

  6. [6]

    Quantum programming languages: Survey and bibliography,

    Simon J. Gay, “Quantum programming languages: Survey and bibliography,”Mathemat- ical Structures in Computer Science, vol. 16, no. 4, pp. 581–600, 2006.doi: 10 . 1017 / S0960129506005378(cit. on p. 2)

    2006

  7. [7]

    Benoˆ ıt Valiron,On quantum programming languages, arXiv:2410.13337, 2024.doi: 10.48550/ arXiv.2410.13337(cit. on p. 2)

    arXiv 2024

  8. [8]

    Towards a quantum programming language,

    Peter Selinger, “Towards a quantum programming language,”Mathematical Structures in Computer Science, vol. 14, no. 4, pp. 527–586, 2004.doi: 10 . 1017 / S0960129504004256 (cit. on p. 2)

    2004

  9. [9]

    A functional quantum programming language,

    Thorsten Altenkirch and Jonathan Grattage, “A functional quantum programming language,” inProceedings of the 20th Annual IEEE Symposium on Logic in Computer Science, arXiv:quant- ph/0409065, IEEE Computer Society, 2005, pp. 249–258.doi: 10.1109/LICS.2005.1 (cit. on p. 2)

    work page doi:10.1109/lics.2005.1 2005

  10. [10]

    A lambda calculus for quantum computation with classical control,

    Peter Selinger and Benoit Valiron, “A lambda calculus for quantum computation with classical control,”Mathematical Structures in Computer Science, vol. 16, no. 3, pp. 527–552, 2006.doi: 10.1017/S0960129506005238(cit. on p. 2)

    work page doi:10.1017/s0960129506005238(cit 2006

  11. [11]

    The quantum IO monad,

    Thorsten Altenkirch and Alexander S. Green, “The quantum IO monad,” inSemantic Tech- niques in Quantum Computation, Simon J. Gay and Ian Mackie, Eds., Cambridge University Press, 2009, pp. 173–205.doi:10.1017/CBO9781139193313.006(cit. on p. 2)

    work page doi:10.1017/cbo9781139193313.006(cit 2009

  12. [12]

    Quipper: A Scalable Quantum Programming Language

    Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, and Benoit Valiron, “Quipper: A scalable quantum programming language,”ACM SIGPLAN Notices, vol. 48, no. 6, pp. 333–342, 2013, arXiv:1304.3390.doi:10.1145/2499370.2462177(cit. on p. 2)

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1145/2499370.2462177(cit 2013

  13. [13]

    Qwire: A core language for quantum circuits,

    Jennifer Paykin, Robert Rand, and Steve Zdancewic, “Qwire: A core language for quantum circuits,” inProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017, pp. 846–858.doi:10.1145/3093333.3009894(cit. on p. 2)

    work page doi:10.1145/3093333.3009894(cit 2017

  14. [14]

    arXiv: 2602.18898 (cit

    Tobias Fritz,Why measurements are made of effects, 2026. arXiv: 2602.18898 (cit. on pp. 2, 9)

    arXiv 2026

  15. [15]

    What makes a strong monad?

    Dylan McDermott and Tarmo Uustalu, “What makes a strong monad?”Electronic Proceedings in Theoretical Computer Science, vol. 360, pp. 113–133, 2022, arXiv:2207.00851.doi: 10.4204/ EPTCS.360.6arXiv:2207.00851(cit. on pp. 3, 19). 28 REFERENCES

    arXiv 2022

  16. [16]

    Booth, Dominik Leichtle, Alex Rice, and Kim Worrall,Composing quantum instru- ments, To appear (cit

    Robert I. Booth, Dominik Leichtle, Alex Rice, and Kim Worrall,Composing quantum instru- ments, To appear (cit. on p. 3)

  17. [17]

    The quantum monad on relational structures,

    Samson Abramsky, Rui Soares Barbosa, Nadish de Silva, and Octavio Zapata, “The quantum monad on relational structures,” inMFCS 2017, ser. Leibniz International Proceedings in Informatics (LIPIcs), vol. 83, 2017, pp. 1–35. arXiv:1705.07310(cit. on p. 3)

    arXiv 2017

  18. [18]

    The quantum monadology,

    Hisham Sati and Urs Schreiber, “The quantum monadology,”Quantum Studies: Mathematics and Foundations, vol. 12, p. 25, 2025. arXiv:2310.15735(cit. on p. 3)

    arXiv 2025

  19. [19]

    Algebraic effects, linearity, and quantum programming languages,

    Sam Staton, “Algebraic effects, linearity, and quantum programming languages,” inProceedings of the 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, 2015, pp. 395–406.doi: 10.1145/2676726.2676999 [Online]. Available: http://www. cs.ox.ac.uk/people/samuel.staton/papers/popl2015.pdf(cit. on p. 3)

    work page doi:10.1145/2676726.2676999 2015

  20. [20]

    Monads for functional programming,

    Philip Wadler, “Monads for functional programming,” inAdvanced Functional Programming, ser. Lecture Notes in Computer Science, Johan Jeuring and Erik Meijer, Eds., vol. 925, Springer, 1995, pp. 24–52.doi:10.1007/3-540-59451-5_2(cit. on p. 3)

    work page doi:10.1007/3-540-59451-5_2(cit 1995

  21. [21]

    On finitary functors and their presentations,

    Jiˇ r´ ı Ad´ amek, Stefan Milius, Lawrence S. Moss, and Henning Urbat, “On finitary functors and their presentations,”Journal of Computer and System Sciences, vol. 81, no. 5, pp. 813–833, 2015 (cit. on p. 7)

    2015

  22. [22]

    Linear usage of state

    Rasmus Ejlers Møgelberg and Sam Staton, “Linear usage of state,”Logical Methods in Computer Science, vol. 10, no. 1, 2014, arXiv:1403.1477.doi: 10.2168/LMCS-10(1:17)2014 arXiv:1403.1477(cit. on pp. 10, 11)

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.2168/lmcs-10(1:17)2014 2014

  23. [23]

    Monads need not be endofunctors

    Thorsten Altenkirch, James Chapman, and Tarmo Uustalu, “Monads need not be endofunctors,” Logical Methods in Computer Science, vol. 11, no. 1, pp. 1–40, 2015, arXiv:1412.7148.doi: 10.2168/LMCS-11(1:3)2015arXiv:1412.7148(cit. on p. 10)

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.2168/lmcs-11(1:3)2015arxiv:1412.7148(cit 2015

  24. [24]

    Classical control, quantum circuits and linear logic in enriched category theory,

    Mathys Rennela and Sam Staton, “Classical control, quantum circuits and linear logic in enriched category theory,”Logical Methods in Computer Science, vol. 16, no. 1, 2020, arXiv:1711.05159.doi:10.23638/LMCS-16(1:30)2020arXiv:1711.05159(cit. on p. 10)

    work page doi:10.23638/lmcs-16(1:30)2020arxiv:1711.05159(cit 2020

  25. [25]

    Parameterised notions of computation,

    Robert Atkey, “Parameterised notions of computation,”Journal of Functional Programming, vol. 19, no. 3–4, pp. 335–376, 2009.doi:10.1017/S095679680900728X(cit. on p. 11)

    work page doi:10.1017/s095679680900728x(cit 2009

  26. [26]

    A note on scattered C ∗-algebras and the Radon–Nikodym property,

    Cho-Ho Chu, “A note on scattered C ∗-algebras and the Radon–Nikodym property,”Journal of the London Mathematical Society, 2nd ser., vol. 24, no. 3, pp. 533–536, 1981.doi: 10.1112/ jlms/s2-24.3.533(cit. on p. 11)

    1981

  27. [27]

    Springer Berlin Heidelberg, 2002.isbn: 9783540459491

    Charalambos D. Aliprantis and Kim C. Border,Infinite Dimensional Analysis: A Hitchhiker’s Guide, 3rd ed. Berlin, Heidelberg: Springer, 2006.doi: 10.1007/3- 540- 29587- 9 (cit. on pp. 12, 23)

    work page doi:10.1007/3- 2006

  28. [28]

    Conditional expectations in generalized probability theory,

    H. Cycon and K.-E. Hellwig, “Conditional expectations in generalized probability theory,” Journal of Mathematical Physics, vol. 18, no. 6, pp. 1154–1161, 1977.doi: 10.1063/1.523385 (cit. on pp. 13, 21)

    work page doi:10.1063/1.523385 1977

  29. [29]

    Kechris,Classical Descriptive Set Theory(Graduate Texts in Mathematics)

    Alexander S. Kechris,Classical Descriptive Set Theory(Graduate Texts in Mathematics). New York: Springer, 1995, vol. 156.doi:10.1007/978-1-4612-4190-4(cit. on p. 14)

    work page doi:10.1007/978-1-4612-4190-4(cit 1995

  30. [30]

    Bimonoidal structure of probability monads,

    Tobias Fritz and Paolo Perrone, “Bimonoidal structure of probability monads,”Electronic Notes in Theoretical Computer Science, vol. 341, pp. 121–149, 2018, arXiv:1804.03527.doi: 10.1016/j.entcs.2018.11.007(cit. on p. 18)

    work page doi:10.1016/j.entcs.2018.11.007(cit 2018

  31. [31]

    Joe Diestel and Jr. Uhl J. J.,Vector Measures(Mathematical Surveys). Providence, RI: American Mathematical Society, 1977, vol. 15.doi:10.1090/surv/015(cit. on pp. 20, 21). Department of Mathematics, University of Innsbruck, Austria Email address:tobias.fritz@uibk.ac.at

    work page doi:10.1090/surv/015(cit 1977