arXiv subjects

Matt Wilson

Publications and source records attributed to Matt Wilson.

At least 19 recordsLinked to original sources

arXiv2026

Full-field fluorescence computed tomography (F3CT) using a calibrated virtual cone-beam pinhole geometry

We present F3CT, a synchrotron-based hyperspectral full-field fluorescence computed tomography technique that avoids raster scanning by combining a pinhole aperture with an energy-resolving 2D detector. A virtual cone-beam model and two-stage calibration-reconstruction workflow enable 3D elemental mapping under full-field illumination. The method is demonstrated on biological and geological specimens, resolving silver-stain distributions in zebrafish tissue and high-energy fluorescence signatures in rock cores. Phase-contrast tomograms acquired sequentially under the same experimental geometry provide co-registered structural context. F3CT provides a high-throughput route to 3D XRF imaging and establishes a foundation for correlated structural and chemical tomography, with potential for future in-situ and operando implementations.

physics.ins-det↗

arXiv2026

Monoidal su-categories

We introduce monoidal su-categories, an abstract categorical notion of single-input higher-order process over a monoidal category. The definition separates a base category C of lower-order processes from a monoidal category V of holes or supermaps and axiomatizes the compatibility needed for partial application to bipartite processes. For a fixed monoidal base C, monoidal su-categories, monoidal su-functors, and monoidal su-natural transformations form a 2-category MonSuCatC. We then show that the category Optic[C] of coend optics is 2-initial in this 2-category, giving an alternative universal-property characterisation of coend optics as the minimal monoidal theory of single-hole contexts.

math.CT↗

arXiv2026

Categories of tagged lenses

To better understand the landscape of well-behavedness laws for lenses on strict Cartesian symmetric monoidal categories, we define tagged lenses. We prove that tagged lenses form a strict symmetric monoidal category equipped with a strict symmetric monoidal functor into the category of putget lenses. We then observe compositional entailment for the other two lens laws, identifying change-dependence and first-last dependence of tags as sufficient conditions for getput and putput, respectively.

math.CT↗

arXiv2026

Higher-Order Quantum Objects are Strong Profunctors

We explore the sense in which the existing constructions for higher-order maps on quantum theory based on causality constraints and compositionality constraints respectively, coincide. More precisely, we construct a functor F : Caus(C) -> StProf(C1) from higher-order causal categories to the category of strong profunctors over first-order causal processes that is lax-lax duoidal, full, faithful, and strongly closed whenever C is additive. When C = CP this embedding is furthermore strong on the sequencer for duoidal categories, expressing the possibility to interpret one-way signalling (but not general non-signalling) constraints in terms of the coend calculus for profunctors. We conclude that insofar as compositional constraints can be used to express causality constraints, the profunctorial approach generalises higher-order quantum theory to a construction over general symmetric monoidal categories.

quant-ph↗

arXiv2026

Supermaps on generalised theories

Categorical supermaps generalise higher-order quantum operations from finite-dimensional quantum theory to arbitrary circuit theories. In this paper, we establish the Yoneda lemma for categorical supermaps, which states that whenever a physical theory has a suitable notion of channel-state duality, then categorical supermaps on that theory can be concretely represented in terms of that duality. This lemma eliminates any guesswork or ambiguity when defining the appropriate notion of supermap for these theories. As a concrete application, we show that the categorical supermaps on Boxworld are in general characterised by a physically well-motivated weaking of the recently proposed NSWSE principle for higher-order processes on boxworld. Furthermore, via the same Yoneda lemma we put forward a stable definition for supermaps in real quantum theory.

quant-ph↗

arXiv2026

Higher-order circuits

We write down a series of basic laws for (strict) higher-order circuit diagrams. More precisely, we define higher-order circuit theories in terms of: (a) nesting, (b) temporal and spatial composition, and (c) equivalence between lower-order bipartite processes and higher-order bipartite states. In category-theoretic terms, these laws are expressed using enrichment and cotensors in symmetric polycategories, along with a frobenius-like coherence between them. We describe how these laws capture the salient features of higher-order quantum theory, and discover an upper bound for higher-order circuits: any higher-order circuit theory embeds into the theory of strong profunctors.

quant-ph↗

arXiv2025

Agent policies from higher-order causal functions

We establish a correspondence between equivalence classes of agent-state policies for deterministic POMDPs and one-input process functions (the classical-deterministic limit of higher-order quantum operations). We use this correspondence to build a bridge between the agent-environment interaction in artificial intelligence, causal structure in the foundations of physics, and logic in computer science. We construct a *-autonomous category PF of types which supports an interpretation of one-step evaluation of policies, and multi-agent observation constraints, into cuts and monoidal products. In terms of types, we develop the correspondence further by identifying observation-independent decentralised POMDPs as the natural domain for the multi-input process functions used to model indefinite causality. We then prove a strict separation between general multi-input process function and definite-ordered process function performance on such dec-POMDPs, by finding an instance for which policies utilizing an indefinite causal structure can achieve greater finite-horizon rewards than policies which are restricted to a fixed background causal structure.

cs.AI↗

arXiv2025

Deriving the Generalised Born Rule from First Principles

A basic postulate of modern compositional approaches to generalised physical theories is the generalised Born rule, in which probabilities are postulated to be computable from the composition of states and effects. In this paper we consider whether this postulate, and the strength of the identification between scalars and probabilities, can be argued from basic principles. To this end, we first consider the most naive possible process- theoretic interpretation of textbook quantum theory, in which physical processes (unitaries) along with states and effects (kets and bras) and a probability function from states and effects satisfying just some basic compatibility axioms are identified. We then show that any process theory equipped with such structure is equivalent to an alternative process theory in which the generalised Born rule holds. We proceed to consider introduction of noise into any such theory, and observe that the result of doing so is a strengthening of the identification between scalars and probabilities; from bare monoid homomorphisms to semiring isomorphisms.

quant-ph↗

arXiv2025

Picturing general quantum subsystems

We extend the usual process-theoretic view on locality and causality in subsystems (based on the tensor product case) to general quantum systems (i.e.\ possibly non-factor, finite-dimensional von Neumann algebras). To do so, we introduce a primitive notion of splitting maps within dagger symmetric monoidal categories. Splitting maps give rise to subsystems that admit comparison via a preorder called comprehension, and support an adaptation of the usual categorical trace. We show that the comprehension preorder precisely captures the inclusion partial order between von Neumann algebras, and that the splitting map trace captures the natural notion of von Neumann algebra trace. As a consequence of the development of these diagrammatic tools, we prove that the known equivalence between semi-causality and semi-localisability for factor subsystems extends to all (including non-factor) subsystems.

quant-ph↗

arXiv2025

Decoherence to quantum theory from a causally-indefinite post-quantum theory

We find a process satisfying the axioms of hyper-decoherence which produces standard quantum theory from the theory of quantum boxes (higher-order quantum theory with the non-signalling tensor product). This hyper-decoherence map evades the no-go theorem of Lee and Selby by relaxing constraints on signalling to the past and the uniqueness of purifications. We discuss some natural opposing conclusions: that the existence of this map might be evidence of a genuine hyper-decoherence process producing causal quantum theory from its causally-indefinite higher-order theory; or that it serves as an indication that the axioms of hyper-decoherence might need careful re-consideration, especially regarding the subtle albeit central role that purity plays.

quant-ph↗

arXiv2025

A BV-Category of Spacetime Interventions

We use the Chu construction to functorially build BV-categories from duoidal categories, demonstrating that candidate models of BV-logic can be cofreely constructed from a fragment of a model of Retor\'e's sequencing operator. By using this construction to show that the strong Hyland envelope is a BV-category, we find a way to build a canonical model of spatio-temporal relationships between agents in spacetime from any symmetric monoidal category. The concrete physical interpretation of spacetime events in this model as intervention-context pairs resolves deficiencies in previous attempts to give a general categorical semantics to quantum supermaps.

quant-ph↗

arXiv2025

Generalised Process Theories

Process theories provide a powerful framework for describing compositional structures across diverse fields, from quantum mechanics to computational linguistics. Traditionally, they have been formalized using symmetric monoidal categories (SMCs). However, various generalizations, including time-neutral, higher-order, and enriched process theories, do not naturally conform to this structure. In this work, we propose an alternative formalization using operad algebras, motivated by recent results connecting SMCs to operadic structures, which captures a broader class of process theories. By leveraging the string-diagrammatic language, we provide an accessible yet rigorous formulation that unifies and extends traditional process-theoretic approaches. Our operadic framework not only recovers standard process theories as a special case but also enables new insights into quantum foundations and compositional structures. This work paves the way for further investigations into the algebraic and operational properties of generalised process theories within an operadic setting.

math.CT↗

arXiv2024

A Profunctorial Semantics for Quantum Supermaps

We identify morphisms of strong profunctors as a categorification of quantum supermaps. These black-box generalisations of diagrams-with-holes are hence placed within the broader field of profunctor optics, as morphisms in the category of copresheaves on concrete networks. This enables the first construction of abstract logical connectives such as tensor products and negations for supermaps in a totally theory-independent setting. These logical connectives are found to be all that is needed to abstractly model the key structural features of the quantum theory of supermaps: black-box indefinite causal order, black-box definite causal order, and the factorisation of definitely causally ordered supermaps into concrete circuit diagrams. We demonstrate that at the heart of these factorisation theorems lies the Yoneda lemma and the notion of representability.

quant-ph↗

arXiv2023

On the Origin of Linearity and Unitarity in Quantum Theory

We reconstruct the transformations of quantum theory using a physically motivated postulate. This postulate states that transformations should be locally applicable, and recovers the linear isometries from pure quantum theory, as well as the completely positive, trace-preserving maps from mixed quantum theory. Notably, in the pure case, linearity with respect to the superposition rule and reversibility are both derived from this locality principle.

quant-ph↗

arXiv2022

Polycategorical Constructions for Unitary Supermaps of Arbitrary Dimension

We provide a construction for holes into which morphisms of abstract symmetric monoidal categories can be inserted, termed the polyslot construction pslot[C], and identify a sub-class srep[C] of polyslots that are single-party representable. These constructions strengthen a previously introduced notion of locally-applicable transformation used to characterize quantum supermaps in a way that is sufficient to re-construct unitary supermaps directly from the monoidal structure of the category of unitaries. Both constructions furthermore freely reconstruct the enriched polycategorical semantics for quantum supermaps which allows to compose supermaps in sequence and in parallel whilst forbidding the creation of time-loops. By freely constructing key compositional features of supermaps, and characterizing supermaps in the finite-dimensional case, polyslots are proposed as a suitable generalization of unitary-supermaps to infinite dimensions and are shown to include canonical examples such as the quantum switch. Beyond specific applications to quantum-relevant categories, a general class of categorical structures termed path-contraction groupoids are defined on which the srep[C] and pslot[C] constructions are shown to coincide.

quant-ph↗

arXiv2022

Quantum Supermaps are Characterized by Locality

We provide a new characterisation of quantum supermaps in terms of an axiom that refers only to sequential and parallel composition. Consequently, we generalize quantum supermaps to arbitrary monoidal categories and operational probabilistic theories. We do so by providing a simple definition of locally-applicable transformation on a monoidal category. The definition can be rephrased in the language of category theory using the principle of naturality, and can be given an intuitive diagrammatic representation in terms of which all proofs are presented. In our main technical contribution, we use this diagrammatic representation to show that locally-applicable transformations on quantum channels are in one-to-one correspondence with deterministic quantum supermaps. This alternative characterization of quantum supermaps is proven to work for more general multiple-input supermaps such as the quantum switch and on arbitrary normal convex spaces of quantum channels such as those defined by satisfaction of signaling constraints.

quant-ph↗

arXiv2022

A Mathematical Framework for Transformations of Physical Processes

We observe that the existence of sequential and parallel composition supermaps in higher order theories of transformations can be formalised using enriched category theory. Encouraged by relevant examples such as unitary supermaps and layers within higher order causal categories (HOCCs), we treat the modelling of higher order physical theories with enriched monoidal categories in analogy with the modelling of physical theories with monoidal categories. We use the enriched monoidal setting to construct a suitable definition of structure preserving map between higher order physical theories via the Grothendieck construction. We then show that the convenient feature of currying in higher order physical theories can be seen as a consequence of combining the primitive assumption of the existence of parallel and sequential composition supermaps with an additional feature of linking. We then use our definition of structure preserving map to show that categories containing infinite towers of enriched monoidal categories with full and faithful structure preserving maps between them inevitably lead to closed monoidal structures. The aim of the proposed definitions is to step towards providing a broad framework for the study and comparison of novel causal structures in quantum theory, and, more broadly, a paradigm of physical theory where static and dynamical features are treated in a unified way.

quant-ph↗

arXiv2022

Generalised tensors and traces

Tensors and traceouts are generalised, so that systems can be partitioned according to almost arbitrary logical predicates. One might have feared that the familiar interrelations between the notions of unitarity, complete positivity, trace-preservation, non-signalling causality, locality and localizability that are standard in quantum theory be jeopardized as the partitioning of systems becomes both logical and dynamical. Such interrelations in fact carry through, although a new notion, consistency, becomes instrumental.

quant-ph↗