Polycategorical Constructions for Unitary Supermaps of Arbitrary Dimension

Giulio Chiribella; Matt Wilson

arxiv: 2207.09180 · v2 · submitted 2022-07-19 · 🪐 quant-ph

Polycategorical Constructions for Unitary Supermaps of Arbitrary Dimension

Matt Wilson , Giulio Chiribella This is my paper

Pith reviewed 2026-05-24 11:26 UTC · model grok-4.3

classification 🪐 quant-ph

keywords polyslot constructionunitary supermapssymmetric monoidal categoriespolycategorical semanticsquantum switchpath-contraction groupoidslocally-applicable transformations

0 comments

The pith

Polyslot constructions allow unitary supermaps to be reconstructed directly from the monoidal structure of the category of unitaries.

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

The paper introduces the polyslot construction, which equips an abstract symmetric monoidal category with slots into which morphisms can be inserted, along with a subclass of single-party representable polyslots. These objects strengthen an earlier notion of locally applicable transformations so that unitary supermaps can be recovered from the monoidal data of unitaries alone. The same constructions freely generate the enriched polycategorical rules for sequential and parallel composition that prohibit time-loops. In the finite-dimensional case the constructions recover the usual quantum supermaps, while the abstract setting is offered as a route to infinite-dimensional generalizations that still include standard examples such as the quantum switch. The two constructions coincide on a broader class of path-contraction groupoids.

Core claim

The polyslot construction pslot[C] and its single-party representable subclass srep[C] provide holes for morphisms inside symmetric monoidal categories; when applied to the category of unitaries they suffice to reconstruct unitary supermaps and to generate freely the enriched polycategorical semantics that supports sequential and parallel composition while forbidding time-loops.

What carries the argument

The polyslot construction pslot[C], which equips a symmetric monoidal category with insertion slots for morphisms, together with the single-party representable subclass srep[C].

If this is right

Unitary supermaps are recovered directly from the monoidal structure of the category of unitaries.
The constructions generate the polycategorical rules for sequential and parallel composition without time-loops.
The same objects characterize quantum supermaps in the finite-dimensional case.
The constructions extend to infinite dimensions and contain the quantum switch.
On path-contraction groupoids the polyslot and single-party representable constructions coincide.

Where Pith is reading between the lines

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

The approach may supply a uniform language for supermaps in any symmetric monoidal category that satisfies the path-contraction condition.
It could be tested by checking whether known higher-order quantum maps outside finite dimensions arise as polyslots.
The free reconstruction of composition rules suggests that similar slot constructions might organize other forms of higher-order maps.

Load-bearing premise

An abstract symmetric monoidal category whose unitaries admit the polyslot construction is enough to recover the full enriched polycategorical semantics without any further data.

What would settle it

Exhibit a unitary supermap on a symmetric monoidal category of unitaries that cannot be obtained as an instance of the polyslot or single-party representable construction.

read the original abstract

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.

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.

Desk Editor's Note private letter to a colleague

The polyslot and srep constructions reconstruct unitary supermaps from the monoidal structure of unitaries and extend the framework to arbitrary dimensions via path-contraction groupoids.

read the letter

This paper defines the polyslot construction pslot[C] on symmetric monoidal categories to create insertion points for morphisms, plus the srep[C] subclass that is single-party representable. These recover unitary supermaps directly from the monoidal data of unitaries and freely generate the enriched polycategorical semantics for sequential and parallel composition without time loops. It also introduces path-contraction groupoids where the two constructions coincide. The finite-dimensional case matches known examples like the quantum switch. That is the core new material. The work is clean on the finite side and the definitions look self-contained. The extension to arbitrary dimension is the part that needs checking, since the abstract presents it as following from the free constructions but does not spell out whether infinite-dimensional unitaries introduce extra technical requirements. No circularity or hidden fitting is visible in the claims. This is for readers already working in categorical quantum mechanics who want explicit compositional models for supermaps. A serious referee should see it because the constructions are specific enough to verify and the generalization claim is testable against the finite case.

Referee Report

0 major / 2 minor

Summary. The paper introduces the polyslot construction pslot[C] on abstract symmetric monoidal categories, along with the single-party representable subclass srep[C]. These strengthen the notion of locally-applicable transformations to reconstruct unitary supermaps directly from the monoidal structure of the category of unitaries, freely recover the enriched polycategorical semantics for sequential and parallel composition without time-loops, characterize the finite-dimensional case (recovering examples such as the quantum switch), and are proposed as a generalization to arbitrary dimension. The paper also defines path-contraction groupoids on which pslot[C] and srep[C] coincide.

Significance. If the constructions hold, the work supplies a parameter-free categorical framework that reconstructs unitary supermaps and their polycategorical semantics directly from monoidal data, without fitted parameters or invented entities beyond the defined polyslots and groupoids. This addresses the extension to infinite dimensions and provides a general class of path-contraction groupoids with potential use beyond quantum categories. The explicit reconstruction of composition rules and the inclusion of canonical examples strengthen the contribution.

minor comments (2)

The abstract and introduction would benefit from a brief explicit statement of the finite-dimensional characterization theorem (including the relevant section or proposition number) to make the scope of the generalization claim immediately clear.
Notation for the enriched polycategorical semantics reconstructed by pslot[C] could be cross-referenced more explicitly to prior work on locally-applicable transformations to aid readers familiar with that literature.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript, including the significance of the polyslot and srep constructions for reconstructing unitary supermaps and their polycategorical semantics. The recommendation for minor revision is noted. No major comments were provided in the report, so there are no specific points requiring point-by-point rebuttal.

Circularity Check

0 steps flagged

Minor self-citation not load-bearing; constructions independent

full rationale

The polyslot and srep constructions are defined directly from the monoidal structure of abstract symmetric monoidal categories (and path-contraction groupoids) and shown to reconstruct unitary supermaps and their polycategorical semantics without any reduction to fitted parameters, self-referential definitions, or unverified self-citations. The reference to a 'previously introduced notion' of locally-applicable transformations is used only as a baseline to be strengthened, not as a load-bearing premise whose validity depends on the present paper. All central claims remain self-contained within the explicit categorical definitions and finite-dimensional characterizations provided.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 3 invented entities

The paper relies on standard axioms of symmetric monoidal categories and introduces three new invented entities with no free parameters or ad-hoc fitted values.

axioms (1)

standard math Symmetric monoidal category axioms
Constructions are defined on abstract symmetric monoidal categories as stated in the abstract.

invented entities (3)

polyslot construction pslot[C] no independent evidence
purpose: Holes for inserting morphisms into abstract symmetric monoidal categories
Newly defined construction proposed as generalization of unitary supermaps.
single-party representable subclass srep[C] no independent evidence
purpose: Sub-class of polyslots that are single-party representable
Newly identified subclass in the paper.
path-contraction groupoids no independent evidence
purpose: Class of structures on which pslot[C] and srep[C] coincide
Newly defined class in the paper.

pith-pipeline@v0.9.0 · 5712 in / 1352 out tokens · 27542 ms · 2026-05-24T11:26:57.820211+00:00 · methodology

discussion (0)

Forward citations

Cited by 1 Pith paper

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

Supermaps on generalised theories
quant-ph 2026-02 unverdicted novelty 8.0

A Yoneda lemma for categorical supermaps gives a concrete representation via channel-state duality whenever the theory has it, yielding stable definitions for boxworld and real quantum theory.

Reference graph

Works this paper leans on

58 extracted references · 58 canonical work pages · cited by 1 Pith paper · 20 internal anchors

[1]

Quantum Circuits Architecture

G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Quantum circuit architecture,” Physical Review Letters 101 no. 6, (8, 2008) 060401, arXiv:0712.1325 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2008
[2]

Transforming quantum operations: quantum supermaps

G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Transforming quantum operations: Quantum supermaps,” EPL (Europhysics Letters) 83 no. 3, (7, 2008) 30004, arXiv:0804.0180 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2008
[4]

Normal completely positive maps on the space of quantum operations

G. Chiribella, A. Toigo, and V. Umanit` a, “Normal completely positive maps on the space of quantum operations,” Open Systems and Information Dynamics 20 no. 1, (12, 2010) , arXiv:1012.3197 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2010
[5]

Theoretical framework for quantum networks

G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Theoretical framework for quantum networks,” Physical Review A - Atomic, Molecular, and Optical Physics 80 no. 2, (4, 2009) , arXiv:0904.4483 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2009
[6]

Quantum correlations with no causal order

O. Oreshkov, F. Costa, and ˆC. Brukner, “Quantum correlations with no causal order,” Nature Communications 3 (2012) , arXiv:1105.4464 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2012
[7]

Categories of Optics

M. Riley, “Categories of Optics,” arXiv:1809.00738

work page internal anchor Pith review Pith/arXiv arXiv
[8]

String Diagrams for Optics,

G. Boisseau, “String Diagrams for Optics,” Leibniz International Proceedings in Informatics, LIPIcs 167 (2, 2020) , arXiv:2002.11480

work page arXiv 2020
[9]

Cornering Optics,

G. Boisseau, C. Nester, and M. Roman, “Cornering Optics,” arXiv:2205.00842

work page arXiv
[10]

Coherence for lenses and open games

J. Hedges, “Coherence for lenses and open games,” arXiv:1704.02230

work page internal anchor Pith review Pith/arXiv arXiv
[11]

The game semantics of game theory,

J. Hedges, “The game semantics of game theory,” arXiv:1904.11287

work page arXiv 1904
[12]

Bayesian open games,

J. Bolt, J. Hedges, and P. Zahn, “Bayesian open games,” arXiv:1910.03656 [quant-ph]

work page arXiv 1910
[13]

Compositional game theory

N. Ghani, J. Hedges, V. Winschel, and P. Zahn, “Compositional game theory,” Proceedings - Symposium on Logic in Computer Science (3, 2016) 472–481, arXiv:1603.04641

work page internal anchor Pith review Pith/arXiv arXiv 2016
[14]

Categorical Foundations of Gradient-Based Learning,

G. S. Cruttwell, B. Gavranovi´ c, N. Ghani, P. Wilson, and F. Zanasi, “Categorical Foundations of Gradient-Based Learning,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artiﬁcial Intelligence and Lecture Notes in Bioinformatics) 13240 LNCS (3, 2021) 1–28, arXiv:2103.01931

work page arXiv 2021
[15]

Automatic Backward Filtering Forward Guiding for Markov processes and graphical models,

F. van der Meulen and M. Schauer, “Automatic Backward Filtering Forward Guiding for Markov processes and graphical models,” arXiv:2010.03509 [quant-ph]

work page arXiv 2010
[16]

Escrows are optics,

F. Genovese, F. Loregian, and D. Palombi, “Escrows are optics,” arXiv:2105.10028

work page arXiv
[17]

Comb Diagrams for Discrete-Time Feedback,

M. Rom´ an, “Comb Diagrams for Discrete-Time Feedback,” tech. rep., 2020. arXiv:2003.06214v1 [quant-ph]

work page arXiv 2020
[18]

Open Diagrams via Coend Calculus,

M. Rom´ an, “Open Diagrams via Coend Calculus,” arXiv:2004.04526

work page arXiv 2004
[19]

Coend Optics for Quantum Combs,

J. Heﬀord and C. Comfort, “Coend Optics for Quantum Combs,” arXiv:2205.09027. 37

work page arXiv
[20]

Quantum computations without definite causal structure

G. Chiribella, G. M. D’Ariano, P. Perinotti, and B. Valiron, “Quantum computations without deﬁnite causal structure,” Physical Review A - Atomic, Molecular, and Optical Physics 88 no. 2, (8, 2013) 022318, arXiv:0912.0195 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2013
[21]

Probabilistic theories with purification

G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Probabilistic theories with puriﬁcation,” Physical Review A - Atomic, Molecular, and Optical Physics 81 no. 6, (8, 2009) , arXiv:0908.1583v5 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2009
[22]

Quantum from principles

G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Quantum from Principles,” arXiv:1506.00398 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv
[23]

Indeﬁnite causal structures for continuous-variable systems,

F. Giacomini, E. Castro-Ruiz, and ˆC. Brukner, “Indeﬁnite causal structures for continuous-variable systems,” New Journal of Physics 18 no. 11, (10, 2015)

work page 2015
[24]

Quantum Supermaps are Characterized by Locality,

M. Wilson, G. Chiribella, and A. Kissinger, “Quantum Supermaps are Characterized by Locality,” arXiv:2205.09844 [quant-ph]

work page arXiv
[25]

Quantum Field Theory in Categorical Quantum Mechanics

S. Gogioso and F. Genovese, “Quantum ﬁeld theory in categorical quantum mechanics,” arXiv:1805.12087 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv
[26]

Towards Quantum Field Theory in Categorical Quantum Mechanics

S. Gogioso and F. Genovese, “Towards quantum ﬁeld theory in categorical quantum mechanics,” arXiv:1703.09594 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv
[27]

A categorical semantics for causal structure,

A. Kissinger and S. Uijlen, “A categorical semantics for causal structure,” Logical Methods in Computer Science 15 no. 3, (2019) , arXiv:1701.04732 [quant-ph]

work page arXiv 2019
[28]

Theoretical framework for Higher-Order Quantum Theory

A. Bisio and P. Perinotti, “Theoretical framework for higher-order quantum theory,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 475 no. 2225, (5, 2019) 20180706, arXiv:1806.09554 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2019
[29]

Higher-order causal theories are models of BV-logic,

W. Simmons and A. Kissinger, “Higher-order causal theories are models of BV-logic,” arXiv:2205.11219 [quant-ph]

work page arXiv
[30]

No-signalling constrains quantum computation with indeﬁnite causal structure,

L. Apadula, A. Bisio, and P. Perinotti, “No-signalling constrains quantum computation with indeﬁnite causal structure,” arXiv:2202.10214v1 [quant-ph]

work page arXiv
[31]

Towards Quantum Gravity: A Framework for Probabilistic Theories with Non-Fixed Causal Structure

L. Hardy, “Towards Quantum Gravity: A Framework for Probabilistic Theories with Non-Fixed Causal Structure,” Journal of Physics A: Mathematical and Theoretical 40 no. 12, (8, 2006) 3081–3099, arXiv:gr-qc/0608043v1 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2006
[32]

S. M. Lane, Categories for the Working Mathematician , vol. 5 of Graduate Texts in Mathematics. Springer New York, 1971. 10.1007/978-1-4612-9839-7

work page doi:10.1007/978-1-4612-9839-7 1971
[33]

Polycategories,

M. Szabo, “Polycategories,” Communications in Algebra 3 no. 8, (1975) 663–689

work page 1975
[34]

A Process-Theoretic Church of the Larger Hilbert Space

S. Gogioso, “A Process-Theoretic Church of the Larger Hilbert Space,” arXiv:1905.13117 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 1905
[35]

Causal structures and the classification of higher order quantum computations

P. Perinotti, “Causal structures and the classiﬁcation of higher order quantum computations,” arXiv:1612.05099 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv
[36]

Coecke and A

B. Coecke and A. Kissinger, Picturing quantum processes: A ﬁrst course in quantum theory and diagrammatic reasoning. Cambridge University Press, 3, 2017

work page 2017
[37]

Quantum Picturalism

B. Coecke, “Quantum picturalism,” Contemporary Physics 51 no. 1, (1, 2010) 59–83, arXiv:0908.1787 [quant-ph] . 38

work page internal anchor Pith review Pith/arXiv arXiv 2010
[38]

Kindergarten quantum mechanics: Lecture notes,

B. Coecke, “Kindergarten quantum mechanics: Lecture notes,”

work page
[39]

Wilde, Quantum Information Theory , 2nd ed

M. M. Wilde, “From Classical to Quantum Shannon Theory,” arXiv:arxiv:1106.1445 [quant-ph]

work page arXiv
[40]

Completely positive linear maps on complex matrices,

M. D. Choi, “Completely positive linear maps on complex matrices,” Linear Algebra and its Applications 10 no. 3, (6, 1975) 285–290

work page 1975
[41]

A Mathematical Framework for Transformations of Physical Processes,

M. Wilson and G. Chiribella, “A Mathematical Framework for Transformations of Physical Processes,” arXiv:2204.04319 [quant-ph]

work page arXiv
[42]

Semicausal operations are semilocalizable,

T. Eggeling, D. Schlingemann, and R. F. Werner, “Semicausal operations are semilocalizable,” Europhysics Letters 57 no. 6, (2002) 782–788

work page 2002
[43]

Enhanced Communication with the Assistance of Indeﬁnite Causal Order,

D. Ebler, S. Salek, and G. Chiribella, “Enhanced Communication with the Assistance of Indeﬁnite Causal Order,” Physical Review Letters 120 no. 12, (3, 2018) 120502

work page 2018
[44]

Quantum circuits cannot control unknown operations,

M. Ara´ ujo, A. Feix, F. Costa, and ˆC. Brukner, “Quantum circuits cannot control unknown operations,” New Journal of Physics 16 (9, 2014)

work page 2014
[45]

Perfect discrimination of no-signalling channels via quantum superposition of causal structures

G. Chiribella, “Perfect discrimination of no-signalling channels via quantum superposition of causal structures,” Physical Review A - Atomic, Molecular, and Optical Physics 86 no. 4, (10, 2012) 040301, arXiv:1109.5154 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2012
[46]

Quantum communication in a superposition of causal orders

S. Salek, D. Ebler, and G. Chiribella, “Quantum communication in a superposition of causal orders,” arXiv:1809.06655 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv
[47]

Indeﬁnite causal order enables perfect quantum communication with zero capacity channel,

G. Chiribella, M. Banik, S. S. Bhattacharya, T. Guha, M. Alimuddin, A. Roy, S. Saha, S. Agrawal, and G. Kar, “Indeﬁnite causal order enables perfect quantum communication with zero capacity channel,” arXiv:1810.10457v2 [quant-ph]

work page arXiv
[48]

A Diagrammatic Approach to Information Transmission in Generalised Switches,

M. Wilson and G. Chiribella, “A Diagrammatic Approach to Information Transmission in Generalised Switches,” arXiv:2003.08224 [quant-ph]

work page arXiv 2003
[49]

Quantum and Classical Data Transmission Through Completely Depolarising Channels in a Superposition of Cyclic Orders,

G. Chiribella, M. Wilson, and H. F. Chau, “Quantum and Classical Data Transmission Through Completely Depolarising Channels in a Superposition of Cyclic Orders,” arXiv (5,

work page
[50]

, arXiv:2005.00618 [quant-ph]

work page arXiv 2005
[51]

Classical Communications with Indeﬁnite Causal Order for N completely depolarizing channels,

S. Sazim, K. Singh, and A. K. Pati, “Classical Communications with Indeﬁnite Causal Order for N completely depolarizing channels,” arXiv:2004.14339 [quant-ph]

work page arXiv 2004
[52]

Consistent circuits for indeﬁnite causal order,

A. Vanrietvelde, N. Ormrod, H. Kristj´ ansson, and J. Barrett, “Consistent circuits for indeﬁnite causal order,” arXiv:2206.10042 [quant-ph]

work page arXiv
[53]

Routed quantum circuits,

A. Vanrietvelde, H. Kristj´ ansson, and J. Barrett, “Routed quantum circuits,” tech. rep. arXiv:2001.07774 [quant-ph]

work page arXiv 2001
[54]

Composable constraints,

M. Wilson and A. Vanrietvelde, “Composable constraints,” arXiv:2112.06818 [quant-ph]

work page arXiv
[55]

Causal Boxes: Quantum Information-Processing Systems Closed under Composition,

C. Portmann, C. Matt, U. Maurer, R. Renner, and B. Tackmann, “Causal Boxes: Quantum Information-Processing Systems Closed under Composition,” IEEE Transactions on Information Theory 63 no. 5, (12, 2015) 3277–3305

work page 2015
[56]

Embedding cyclic causal structures in acyclic spacetimes: no-go results for process matrices,

V. Vilasini and R. Renner, “Embedding cyclic causal structures in acyclic spacetimes: no-go results for process matrices,” arXiv:2203.11245 [quant-ph] . 39

work page arXiv
[57]

Higher Operads, Higher Categories,

T. Leinster, “Higher Operads, Higher Categories,” Higher Operads, Higher Categories (5,

work page
[58]

Lemma 10

Appendix A Polycategory of P-supermaps We will ﬁnd that when dealing with listed data naive diagrammatic representations become cum- bersome, so for readability, we adopt a convention analogous to the convention used for genuine lists in multi/polycategories, choosing for instance to represent the above diagram by: S B B′ φi X X′ Such a language is not fo...

work page
[59]

From now on we omit indices on natural transformations

to be natural transformations S : C(A1⊗− , A′ 1⊗ =)→ C(A2⊗− , A′ 2⊗ =) such that for every T : C(B1⊗− , B′ 1⊗ =)⇒ C(B2⊗− , B′ 2 =) then C(A1⊗ B1⊗ X, A′ 1⊗ B′ 1⊗ X′) C(A2⊗ B1⊗ X, A′ 2⊗ B′ 1⊗ X′) C(A1⊗ B2⊗ X, A′ 1⊗ B′ 2⊗ X′) C(A2⊗ B2⊗ X, A′ 2⊗ B′ 2⊗ X′) SB1⊗X,B′ 1⊗X′ βT βA1,X,A′ 1,X′ βT βA2 ,X,A′ 2 ,X′ SB2⊗X,B′ 2⊗X′ Proof. From now on we omit indices on nat...

work page

[1] [1]

Quantum Circuits Architecture

G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Quantum circuit architecture,” Physical Review Letters 101 no. 6, (8, 2008) 060401, arXiv:0712.1325 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2008

[2] [2]

Transforming quantum operations: quantum supermaps

G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Transforming quantum operations: Quantum supermaps,” EPL (Europhysics Letters) 83 no. 3, (7, 2008) 30004, arXiv:0804.0180 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2008

[3] [4]

Normal completely positive maps on the space of quantum operations

G. Chiribella, A. Toigo, and V. Umanit` a, “Normal completely positive maps on the space of quantum operations,” Open Systems and Information Dynamics 20 no. 1, (12, 2010) , arXiv:1012.3197 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2010

[4] [5]

Theoretical framework for quantum networks

G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Theoretical framework for quantum networks,” Physical Review A - Atomic, Molecular, and Optical Physics 80 no. 2, (4, 2009) , arXiv:0904.4483 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2009

[5] [6]

Quantum correlations with no causal order

O. Oreshkov, F. Costa, and ˆC. Brukner, “Quantum correlations with no causal order,” Nature Communications 3 (2012) , arXiv:1105.4464 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2012

[6] [7]

Categories of Optics

M. Riley, “Categories of Optics,” arXiv:1809.00738

work page internal anchor Pith review Pith/arXiv arXiv

[7] [8]

String Diagrams for Optics,

G. Boisseau, “String Diagrams for Optics,” Leibniz International Proceedings in Informatics, LIPIcs 167 (2, 2020) , arXiv:2002.11480

work page arXiv 2020

[8] [9]

Cornering Optics,

G. Boisseau, C. Nester, and M. Roman, “Cornering Optics,” arXiv:2205.00842

work page arXiv

[9] [10]

Coherence for lenses and open games

J. Hedges, “Coherence for lenses and open games,” arXiv:1704.02230

work page internal anchor Pith review Pith/arXiv arXiv

[10] [11]

The game semantics of game theory,

J. Hedges, “The game semantics of game theory,” arXiv:1904.11287

work page arXiv 1904

[11] [12]

Bayesian open games,

J. Bolt, J. Hedges, and P. Zahn, “Bayesian open games,” arXiv:1910.03656 [quant-ph]

work page arXiv 1910

[12] [13]

Compositional game theory

N. Ghani, J. Hedges, V. Winschel, and P. Zahn, “Compositional game theory,” Proceedings - Symposium on Logic in Computer Science (3, 2016) 472–481, arXiv:1603.04641

work page internal anchor Pith review Pith/arXiv arXiv 2016

[13] [14]

Categorical Foundations of Gradient-Based Learning,

G. S. Cruttwell, B. Gavranovi´ c, N. Ghani, P. Wilson, and F. Zanasi, “Categorical Foundations of Gradient-Based Learning,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artiﬁcial Intelligence and Lecture Notes in Bioinformatics) 13240 LNCS (3, 2021) 1–28, arXiv:2103.01931

work page arXiv 2021

[14] [15]

Automatic Backward Filtering Forward Guiding for Markov processes and graphical models,

F. van der Meulen and M. Schauer, “Automatic Backward Filtering Forward Guiding for Markov processes and graphical models,” arXiv:2010.03509 [quant-ph]

work page arXiv 2010

[15] [16]

Escrows are optics,

F. Genovese, F. Loregian, and D. Palombi, “Escrows are optics,” arXiv:2105.10028

work page arXiv

[16] [17]

Comb Diagrams for Discrete-Time Feedback,

M. Rom´ an, “Comb Diagrams for Discrete-Time Feedback,” tech. rep., 2020. arXiv:2003.06214v1 [quant-ph]

work page arXiv 2020

[17] [18]

Open Diagrams via Coend Calculus,

M. Rom´ an, “Open Diagrams via Coend Calculus,” arXiv:2004.04526

work page arXiv 2004

[18] [19]

Coend Optics for Quantum Combs,

J. Heﬀord and C. Comfort, “Coend Optics for Quantum Combs,” arXiv:2205.09027. 37

work page arXiv

[19] [20]

Quantum computations without definite causal structure

G. Chiribella, G. M. D’Ariano, P. Perinotti, and B. Valiron, “Quantum computations without deﬁnite causal structure,” Physical Review A - Atomic, Molecular, and Optical Physics 88 no. 2, (8, 2013) 022318, arXiv:0912.0195 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2013

[20] [21]

Probabilistic theories with purification

G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Probabilistic theories with puriﬁcation,” Physical Review A - Atomic, Molecular, and Optical Physics 81 no. 6, (8, 2009) , arXiv:0908.1583v5 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2009

[21] [22]

Quantum from principles

G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Quantum from Principles,” arXiv:1506.00398 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv

[22] [23]

Indeﬁnite causal structures for continuous-variable systems,

F. Giacomini, E. Castro-Ruiz, and ˆC. Brukner, “Indeﬁnite causal structures for continuous-variable systems,” New Journal of Physics 18 no. 11, (10, 2015)

work page 2015

[23] [24]

Quantum Supermaps are Characterized by Locality,

M. Wilson, G. Chiribella, and A. Kissinger, “Quantum Supermaps are Characterized by Locality,” arXiv:2205.09844 [quant-ph]

work page arXiv

[24] [25]

Quantum Field Theory in Categorical Quantum Mechanics

S. Gogioso and F. Genovese, “Quantum ﬁeld theory in categorical quantum mechanics,” arXiv:1805.12087 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv

[25] [26]

Towards Quantum Field Theory in Categorical Quantum Mechanics

S. Gogioso and F. Genovese, “Towards quantum ﬁeld theory in categorical quantum mechanics,” arXiv:1703.09594 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv

[26] [27]

A categorical semantics for causal structure,

A. Kissinger and S. Uijlen, “A categorical semantics for causal structure,” Logical Methods in Computer Science 15 no. 3, (2019) , arXiv:1701.04732 [quant-ph]

work page arXiv 2019

[27] [28]

Theoretical framework for Higher-Order Quantum Theory

A. Bisio and P. Perinotti, “Theoretical framework for higher-order quantum theory,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 475 no. 2225, (5, 2019) 20180706, arXiv:1806.09554 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2019

[28] [29]

Higher-order causal theories are models of BV-logic,

W. Simmons and A. Kissinger, “Higher-order causal theories are models of BV-logic,” arXiv:2205.11219 [quant-ph]

work page arXiv

[29] [30]

No-signalling constrains quantum computation with indeﬁnite causal structure,

L. Apadula, A. Bisio, and P. Perinotti, “No-signalling constrains quantum computation with indeﬁnite causal structure,” arXiv:2202.10214v1 [quant-ph]

work page arXiv

[30] [31]

Towards Quantum Gravity: A Framework for Probabilistic Theories with Non-Fixed Causal Structure

L. Hardy, “Towards Quantum Gravity: A Framework for Probabilistic Theories with Non-Fixed Causal Structure,” Journal of Physics A: Mathematical and Theoretical 40 no. 12, (8, 2006) 3081–3099, arXiv:gr-qc/0608043v1 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2006

[31] [32]

S. M. Lane, Categories for the Working Mathematician , vol. 5 of Graduate Texts in Mathematics. Springer New York, 1971. 10.1007/978-1-4612-9839-7

work page doi:10.1007/978-1-4612-9839-7 1971

[32] [33]

Polycategories,

M. Szabo, “Polycategories,” Communications in Algebra 3 no. 8, (1975) 663–689

work page 1975

[33] [34]

A Process-Theoretic Church of the Larger Hilbert Space

S. Gogioso, “A Process-Theoretic Church of the Larger Hilbert Space,” arXiv:1905.13117 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 1905

[34] [35]

Causal structures and the classification of higher order quantum computations

P. Perinotti, “Causal structures and the classiﬁcation of higher order quantum computations,” arXiv:1612.05099 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv

[35] [36]

Coecke and A

B. Coecke and A. Kissinger, Picturing quantum processes: A ﬁrst course in quantum theory and diagrammatic reasoning. Cambridge University Press, 3, 2017

work page 2017

[36] [37]

Quantum Picturalism

B. Coecke, “Quantum picturalism,” Contemporary Physics 51 no. 1, (1, 2010) 59–83, arXiv:0908.1787 [quant-ph] . 38

work page internal anchor Pith review Pith/arXiv arXiv 2010

[37] [38]

Kindergarten quantum mechanics: Lecture notes,

B. Coecke, “Kindergarten quantum mechanics: Lecture notes,”

work page

[38] [39]

Wilde, Quantum Information Theory , 2nd ed

M. M. Wilde, “From Classical to Quantum Shannon Theory,” arXiv:arxiv:1106.1445 [quant-ph]

work page arXiv

[39] [40]

Completely positive linear maps on complex matrices,

M. D. Choi, “Completely positive linear maps on complex matrices,” Linear Algebra and its Applications 10 no. 3, (6, 1975) 285–290

work page 1975

[40] [41]

A Mathematical Framework for Transformations of Physical Processes,

M. Wilson and G. Chiribella, “A Mathematical Framework for Transformations of Physical Processes,” arXiv:2204.04319 [quant-ph]

work page arXiv

[41] [42]

Semicausal operations are semilocalizable,

T. Eggeling, D. Schlingemann, and R. F. Werner, “Semicausal operations are semilocalizable,” Europhysics Letters 57 no. 6, (2002) 782–788

work page 2002

[42] [43]

Enhanced Communication with the Assistance of Indeﬁnite Causal Order,

D. Ebler, S. Salek, and G. Chiribella, “Enhanced Communication with the Assistance of Indeﬁnite Causal Order,” Physical Review Letters 120 no. 12, (3, 2018) 120502

work page 2018

[43] [44]

Quantum circuits cannot control unknown operations,

M. Ara´ ujo, A. Feix, F. Costa, and ˆC. Brukner, “Quantum circuits cannot control unknown operations,” New Journal of Physics 16 (9, 2014)

work page 2014

[44] [45]

Perfect discrimination of no-signalling channels via quantum superposition of causal structures

G. Chiribella, “Perfect discrimination of no-signalling channels via quantum superposition of causal structures,” Physical Review A - Atomic, Molecular, and Optical Physics 86 no. 4, (10, 2012) 040301, arXiv:1109.5154 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2012

[45] [46]

Quantum communication in a superposition of causal orders

S. Salek, D. Ebler, and G. Chiribella, “Quantum communication in a superposition of causal orders,” arXiv:1809.06655 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv

[46] [47]

Indeﬁnite causal order enables perfect quantum communication with zero capacity channel,

G. Chiribella, M. Banik, S. S. Bhattacharya, T. Guha, M. Alimuddin, A. Roy, S. Saha, S. Agrawal, and G. Kar, “Indeﬁnite causal order enables perfect quantum communication with zero capacity channel,” arXiv:1810.10457v2 [quant-ph]

work page arXiv

[47] [48]

A Diagrammatic Approach to Information Transmission in Generalised Switches,

M. Wilson and G. Chiribella, “A Diagrammatic Approach to Information Transmission in Generalised Switches,” arXiv:2003.08224 [quant-ph]

work page arXiv 2003

[48] [49]

Quantum and Classical Data Transmission Through Completely Depolarising Channels in a Superposition of Cyclic Orders,

G. Chiribella, M. Wilson, and H. F. Chau, “Quantum and Classical Data Transmission Through Completely Depolarising Channels in a Superposition of Cyclic Orders,” arXiv (5,

work page

[49] [50]

, arXiv:2005.00618 [quant-ph]

work page arXiv 2005

[50] [51]

Classical Communications with Indeﬁnite Causal Order for N completely depolarizing channels,

S. Sazim, K. Singh, and A. K. Pati, “Classical Communications with Indeﬁnite Causal Order for N completely depolarizing channels,” arXiv:2004.14339 [quant-ph]

work page arXiv 2004

[51] [52]

Consistent circuits for indeﬁnite causal order,

A. Vanrietvelde, N. Ormrod, H. Kristj´ ansson, and J. Barrett, “Consistent circuits for indeﬁnite causal order,” arXiv:2206.10042 [quant-ph]

work page arXiv

[52] [53]

Routed quantum circuits,

A. Vanrietvelde, H. Kristj´ ansson, and J. Barrett, “Routed quantum circuits,” tech. rep. arXiv:2001.07774 [quant-ph]

work page arXiv 2001

[53] [54]

Composable constraints,

M. Wilson and A. Vanrietvelde, “Composable constraints,” arXiv:2112.06818 [quant-ph]

work page arXiv

[54] [55]

Causal Boxes: Quantum Information-Processing Systems Closed under Composition,

C. Portmann, C. Matt, U. Maurer, R. Renner, and B. Tackmann, “Causal Boxes: Quantum Information-Processing Systems Closed under Composition,” IEEE Transactions on Information Theory 63 no. 5, (12, 2015) 3277–3305

work page 2015

[55] [56]

Embedding cyclic causal structures in acyclic spacetimes: no-go results for process matrices,

V. Vilasini and R. Renner, “Embedding cyclic causal structures in acyclic spacetimes: no-go results for process matrices,” arXiv:2203.11245 [quant-ph] . 39

work page arXiv

[56] [57]

Higher Operads, Higher Categories,

T. Leinster, “Higher Operads, Higher Categories,” Higher Operads, Higher Categories (5,

work page

[57] [58]

Lemma 10

Appendix A Polycategory of P-supermaps We will ﬁnd that when dealing with listed data naive diagrammatic representations become cum- bersome, so for readability, we adopt a convention analogous to the convention used for genuine lists in multi/polycategories, choosing for instance to represent the above diagram by: S B B′ φi X X′ Such a language is not fo...

work page

[58] [59]

From now on we omit indices on natural transformations

to be natural transformations S : C(A1⊗− , A′ 1⊗ =)→ C(A2⊗− , A′ 2⊗ =) such that for every T : C(B1⊗− , B′ 1⊗ =)⇒ C(B2⊗− , B′ 2 =) then C(A1⊗ B1⊗ X, A′ 1⊗ B′ 1⊗ X′) C(A2⊗ B1⊗ X, A′ 2⊗ B′ 1⊗ X′) C(A1⊗ B2⊗ X, A′ 1⊗ B′ 2⊗ X′) C(A2⊗ B2⊗ X, A′ 2⊗ B′ 2⊗ X′) SB1⊗X,B′ 1⊗X′ βT βA1,X,A′ 1,X′ βT βA2 ,X,A′ 2 ,X′ SB2⊗X,B′ 2⊗X′ Proof. From now on we omit indices on nat...

work page