Pith. sign in

REVIEW 4 major objections 3 minor 59 references

A recursively defined parallel product unifies higher-order quantum transformations, and the resulting complete-positivity cones are convex at every level.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-04 11:36 UTC pith:LSHGBTAA

load-bearing objection Clear, well-motivated framework for higher-order quantum theory, but the central theorems are all deferred to companion papers, so the constructions are unverified in this preprint. the 4 major comments →

arxiv 2510.03622 v2 pith:LSHGBTAA submitted 2025-10-04 quant-ph

Towards the simulation of higher-order quantum resources: a general type-theoretic approach

Samuel B. Steakley , Elia Zanoni , Carlo Maria Scandolo This is my paper
classification quant-ph MSC 81P4581P68 PACS 03.67.-a
keywords higher-order quantum theoryparallel productcomplete positivityconvex conestype systemquantum resourcessuperchannelsChoi-free
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The paper proposes a uniform, Choi-free framework for higher-order quantum theory: a type system whose types label states, channels, superchannels, and all higher transformations, with a Hilbert space L(x) of linear maps for each type. Its central move is a recursively defined 'parallel product' that lets any two maps of arbitrary (and different) orders combine in parallel, generalizing the tensor product that works only for same-kind objects. To pick out physically admissible maps, the paper defines a family of cones K(x) that generalizes complete positivity to all orders, and claims each K(x) is a convex cone isomorphic to a positive-semidefinite cone. The significance is that static and dynamical resources—and eventually indefinite-causal-order processes like the quantum SWITCH—could be treated on a common footing with the same optimization and convex-geometric tools used for states and channels.

Core claim

The paper's central claim is that a recursively defined parallel product makes M ⊠ N : x ⊠ y a well-defined linear map for all types x and y, and that the family K(x) of 'completely K-preserving' maps is a convex cone in a real vector space H(x) for every type, isomorphic through a Choi isomorphism to a cone of positive semidefinite operators. The construction proceeds by induction on the order of a type: elementary types are words over system labels, arrow types are a→b; the parallel product concatenates elementary types, appends the lower-order map to the output in the unequal-order case, and factors input pairs in the equal-order case. The K-family sets K(x) to the positive semidefinite o

What carries the argument

The parallel product ⊠ is the central object: an inductive operation defined simultaneously on types and on linear maps, with three clauses—concatenation for elementary types, 'pass through the higher-order map and append the lower-order one' when orders differ, and 'factor the input into a parallel product and apply the two maps componentwise' when orders are equal. Its role is to make the tensor product's operational meaning (parallel application) valid for maps of arbitrary and distinct orders. The second piece of machinery is the K-family: K(a→b) is defined as the set of maps that preserve K under parallel product with identity maps of the same order, generalizing complete positivity; to

Load-bearing premise

The key load-bearing premise is that inputs of the form ρ ⊠ σ span the whole domain L(a ⊠ c) in the equal-order case, together with the companion bound ord(y ⊠ y') = max(ord(y), ord(y')) that ensures the recursion terminates; the present paper does not prove these, only states that they are shown in companion references.

What would settle it

A concrete check: take the smallest non-elementary example, e.g. types a = b = c = d = A→B over a one-qubit system, and compute the dimension of the span of {ρ ⊠ σ : ρ ∈ L(A), σ ∈ L(A)} in L((A→B) ⊠ (A→B)); if it is strictly less than dim L(a ⊠ c), the equal-order clause of Definition 3.2 does not specify a unique linear map and the central claim fails.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • If the construction is correct, every level of the quantum hierarchy—states, channels, superchannels, and beyond—can be combined in parallel with any other level, giving a single composition rule for all resources.
  • Complete positivity, currently defined only for states and channels, extends to a convex cone K(x) at every order, so conic programming and self-duality results apply to higher-order transformations.
  • Because the framework is built without basing the definitions on a Choi representation, the ambiguities associated with assigning physical systems to Choi-matrix entries are avoided, and the path toward infinite-dimensional settings is left open.
  • The uniform treatment of static and dynamical resources lays groundwork for resource theories of higher-order processes, in particular indefinite causal order.
  • The type system also supplies a compact notation and inductive proof principle applicable to all orders, which the authors argue is otherwise cumbersome.

Where Pith is reading between the lines

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

  • A natural testable extension: define an order-by-order generalization of trace preservation and check whether deterministic maps at each order form subsets of K(x) that are closed under the parallel product; if they do, the framework would reproduce known characterizations of channels and superchannels and predict a similar characterization at order three.
  • If the deferred proofs (especially the spanning argument for ρ ⊠ σ) hold, the framework's Choi-free parallel product may provide a bridge between the operational 'extended event' approach and categorical/causal-structure approaches, by algebraically encoding parallel composition without reference to wiring diagrams.
  • The claimed isomorphism of each K(x) to a PSD cone suggests that a canonical, type-relative Choi isomorphism could be derived within the framework itself, possibly yielding a hierarchy of Choi representations rather than relying on a single matrix picture.
  • Concrete low-order calculations—e.g., writing out K(A→B) for a qubit and K((A→B)→(C→D))—should recover the known CP and CCPP cones, which would serve as a check of the inductive definition and of the cone-isomorphism claim before higher orders are trusted.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

4 major / 3 minor

Summary. The paper proposes a type-theoretic framework for higher-order quantum theory. Types are generated from elementary words over a base alphabet plus arrow types, each type x is assigned a finite-dimensional Hilbert space L(x) of linear maps, and a 'parallel product' ⊠ is introduced to combine maps of arbitrary and possibly different orders. The paper then defines a family K(x) of 'completely K-preserving' maps intended to generalize complete positivity to all orders, and claims that each K(x) is a convex cone isomorphic to a positive-semidefinite cone. The main technical results are not proved in the manuscript: the spanning property needed to define the parallel product map, the order formula used for well-founded induction, and the convexity/Choi-type isomorphism of the K-family are all deferred to the authors' companion works [52–54].

Significance. If the deferred results are correct, the framework would provide a clean, Choi-free treatment of higher-order quantum transformations, unifying static and dynamical resources and potentially enabling resource-theoretic applications at all orders. The type system and tree representation are clear, and the low-order examples match standard notions of states, channels, and superchannels. However, as submitted, the paper does not establish its central mathematical claims; it reads as a programmatic announcement rather than a self-contained proof. The central construction and the K-family are conditional on unavailable references, so the significance cannot yet be assessed on the basis of this manuscript alone.

major comments (4)
  1. [§3.2, Def. 3.2 (Eq. (33))] The equal-order clause defines (M⊠N)(ρ⊠σ)=M(ρ)⊠N(σ) and then invokes linear extension. This is well-defined only if {ρ⊠σ} spans L(a⊠c) and the assignment respects all linear dependencies among inputs. The manuscript states only that the spanning property 'is indeed the case' and refers to [52–54]. Spanning alone is not sufficient: one must also prove that the recursively defined products ρ⊠σ are compatible with linear relations, e.g. that ∑λ_i ρ_i⊠σ_i=0 in L(a⊠c) implies ∑λ_i M(ρ_i)⊠N(σ_i)=0. Without this, the central map M⊠N is not established.
  2. [Def. 3.1 and §4.1] Both the type-level parallel product and the K-family induction rely on the assertion ord(y⊠y')=max{ord(y),ord(y')}. This is first stated in §4.1 and deferred to [52–54]. Without it, the recursive clauses of Def. 3.1 do not form a well-founded induction: for example, in the equal-order case x=a→b, y=c→d, one needs ord(a⊠c)<ord(x), which follows only from the max formula. Similarly, Def. 4.1 requires that a⊠z and b⊠z have order strictly less than x; the text explicitly says 'This fact is proven in our fuller result' rather than proving it. This is a load-bearing missing step.
  3. [Def. 3.2, asymmetric cases] The unequal-order clauses of Eq. (33) are also recursive, e.g. (M⊠N)(σ)=M⊠N(σ), where the right-hand side involves a parallel product of M with N(σ). Well-definedness requires an ordering argument that is not supplied. The text only addresses the spanning issue in the equal-order case; the asymmetric cases need the same ord-lemma and a proof of termination. This is part of the central existence claim for ⊠.
  4. [§4.2] The headline properties of the K-family—convexity of each K(x) and its isomorphism to a positive-semidefinite cone—are asserted but not demonstrated. The text says 'we are able to show' and delegates to [52–54], without giving an argument or even a precise statement of the Choi-type isomorphism in this manuscript. Since the abstract and introduction present these as main contributions, the current text does not prove them.
minor comments (3)
  1. [§2.1, Lemma 2.3] This elementary lemma is deferred to [52] or [53]. Since it is a simple consequence of free inductive generation, it should be proved in the text to make the paper more self-contained.
  2. [§3.2, Eq. (33)] In the first asymmetric clause, the expression M⊠N(σ) is ambiguous; write M⊠(N(σ)) to avoid reading it as (M⊠N)(σ).
  3. [Throughout] There are minor wording issues, e.g. 'For a elementary-type map' in PM3, and 'fully unentangled state' is informal. The references [52–54] are listed as 'Forthcoming'; any published version should make the companion results accessible or include them.

Circularity Check

3 steps flagged

Well-definedness of the parallel product and the K-family's cone/isomorphism theorems are delegated to same-author refs [52–54]; the central claims are therefore unproven in this preprint, though the framework itself is not definitionally circular.

specific steps
  1. self citation load bearing [Section 3.2, Definition 3.2 (well-definedness of M ⊠ N)]
    "It is non-trivial, but we are able to prove that the latter specification gives a well-defined linear map M ⊠ N : x ⊠ y in all cases. ... What must be shown then is that the subset of elements of the form ρ ⊠ σ is a spanning subset of L(a ⊠ c). This is indeed the case, as we demonstrate in our full results which may be found in [52–54]."

    The paper's core construction M ⊠ N is only shown to be well-defined by deferring the spanning lemma to [52–54], all of which are the authors' own works. Even the stated condition (spanning) is weaker than what a linear extension requires: one must also show that the assignment respects linear dependencies in L(a) ⊗ L(c) before the formula extends to a linear map. No such argument appears in the manuscript, so the central definition rests entirely on an unstated, same-author proof.

  2. self citation load bearing [Section 4.1, Definition 4.1 (inductive well-foundedness of K)]
    "There is a general fact that the order ord(y ⊠ y′) of a parallel product type is equal to the maximum of the orders of the operands, i.e. we have ord(y ⊠y′) = max{ord(y),ord(y′)}. This fact is proven in our fuller result, which can be found in [52–54]."

    The recursive definition of K(x) is valid only if a ⊠ z and b ⊠ z have order strictly less than ord(x); the paper derives this from the order lemma, but the lemma itself is not proved here and is referenced only to the authors' companion works [52–54]. Thus the well-foundedness of the K-family induction is imported from same-author citations rather than established in the preprint.

  3. self citation load bearing [Section 4.2, properties of the K-family]
    "In [54] and in forthcoming work [52, 53], we consider several properties of the Kfamily ... we show that K(x) forms a convex cone for each x∈Types A ... Moreover, by defining an appropriate form of the Choi isomorphism in our framework, we are able to show that there is an isomorphism of convex cones between each K(x) and a cone of positive semidefinite operators Pos(H) ..."

    The headline theorem that each K(x) is a convex cone isomorphic to a positive-semidefinite cone is asserted only by reference to [52–54]. The Choi isomorphism is said to be introduced in those same works, and no proof of the isomorphism or of the cone property is given here. The paper's main advertised result is therefore not self-contained; it is a summary of same-author companion results rather than a derivation in this text.

full rationale

This is not a case of fitted parameters renamed as predictions, nor of a definition that equals its conclusion by construction. The type system, the parallel-product recursion, and the K-family definition are all stated with enough precision for a reader to see what is being claimed, and the low-order examples (states, channels, state-channel parallel product) are worked out. However, the load-bearing theorems that would make those definitions valid — the spanning/consistency lemma for the linear extension in Definition 3.2, the order identity ord(y⊠y′)=max{ord(y),ord(y′)} used to justify the induction in Definition 4.1, and the convex-cone/PSD-isomorphism results for K(x) — are all deferred to [52–54], which are the authors' own forthcoming thesis/full-result works. By Rule 3 this is load-bearing self-citation: the central claims are justified only by same-author references that are not included in the manuscript and are not independently machine-checked or externally benchmarked. This warrants a score around 5: the framework is not logically circular in the sense of reducing to its inputs, but the paper's advertised first-principles results are unproven here and are imported from an author-internal citation chain. I did not flag the comparison with the extended events of [39] as circular, since the paper explicitly generalizes that notion and provides its own examples.

Axiom & Free-Parameter Ledger

0 free parameters · 6 axioms · 0 invented entities

No numerical parameters are fitted; the framework is definitional. The central assumptions are standard induction on types, the operational choice of the parallel-product rules, the higher-order complete-positivity postulate, and two unproved technical lemmas (spanning subset and order-max identity) that the paper defers to the authors’ own companion works. No new physical entities are postulated.

axioms (6)
  • standard math Types_A is freely inductively generated by rules R1/R2; every type is either elementary or a unique arrow type.
    Used to justify Lemma 2.3, Definition 2.5 (order), and all inductive constructions; standard formal-language fact cited to [51–53].
  • standard math Finite-dimensional Hilbert-space identities, including L(H1,H2) ⊗ L(H3,H4) = L(H1⊗H3, H2⊗H4) and Hilbert-Schmidt inner products.
    Invoked in Section 3.1 (Eq. 26) to argue the tensor product fails for mixed-order maps; standard linear algebra.
  • ad hoc to paper The correct operational parallel product is: equal-order maps combine like the tensor product, and for unequal orders the input is passed to the higher-order map while the lower-order map is appended to the output (desiderata PT1–PT3/PM1–PM3).
    This is the defining design choice of ⊔ (Defs. 3.1–3.2), not derived from a more basic principle.
  • ad hoc to paper The set {ρ ⊔ σ : ρ ∈ L(a), σ ∈ L(c)} spans L(a ⊔ c) in the equal-order case.
    Needed for Def. 3.2 to define M ⊔ N by linear extension; paper states it is proven only in [52–54].
  • ad hoc to paper For all types y, y', ord(y ⊔ y') = max{ord(y), ord(y')}.
    Needed to show the inductive definition of K (Def. 4.1) is well-founded; proof deferred to [52–54].
  • domain assumption Physically admissible maps of every order should be completely K-preserving, generalizing CP/CCPP; trace preservation is deferred.
    Def. 4.1 postulates K as the positivity-like subset; the paper states the full physical characterization is future work.

pith-pipeline@v1.3.0-alltime-deepseek · 18868 in / 16479 out tokens · 130563 ms · 2026-08-04T11:36:49.329800+00:00 · methodology

0 comments
read the original abstract

Quantum resources exist in a hierarchy of multiple levels. At order zero, quantum states are transformed by linear maps (channels, or gates) in order to perform computations or simulate other states. At order one, gates and channels are transformed by linear maps (superchannels) in order to simulate other gates. To develop a full hierarchy of quantum resources, beyond those first two orders, and to account for the fact that quantum protocols can interconvert resources of different orders, we need a theoretical framework that addresses all orders in a uniform manner. We introduce a framework based on a system of types, which label the different kinds of objects that are present at different orders. We equip the framework with a parallel product operation that modifies and generalizes the tensor product so as to be operationally meaningful for maps of distinct and arbitrary orders. Finally, we introduce a family of convex cones that generalize the notion of complete positivity to all orders, with the aim of characterizing the objects that are physically admissible, facilitating an operational treatment of quantum objects at any order.

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

59 extracted references · 14 canonical work pages · 1 internal anchor

  1. [1]

    Quantum Sci

    Knight, P., Walmsley, I.: UK national quantum technology programme. Quantum Sci. Technol.4(4), 040502 (2019) https://doi.org/10.1088/2058-9565/ab4346

    work page doi:10.1088/2058-9565/ab4346 2019

  2. [2]

    Quantum Sci

    Raymer, M.G., Monroe, C.: The US National Quantum Initiative. Quantum Sci. Technol.4(2), 020504 (2019) https://doi.org/10.1088/2058-9565/ab0441

    work page doi:10.1088/2058-9565/ab0441 2019

  3. [3]

    Quantum Sci

    Sussman, B., Corkum, P., Blais, A., Cory, D., Damascelli, A.: Quantum Canada. Quantum Sci. Technol.4(2), 020503 (2019) https://doi.org/10.1088/2058-9565/ ab029d

    doi:10.1088/2058-9565/ 2019

  4. [4]

    Strategic report on current status, vi- sions and goals for research in Europe

    Koch, C.P., Boscain, U., Calarco, T., Dirr, G., Filipp, S., Glaser, S.J., Kosloff, R., Montangero, S., Schulte-Herbr¨ uggen, T., Sugny, D., Wilhelm, F.K.: Quantum optimal control in quantum technologies. Strategic report on current status, vi- sions and goals for research in Europe. EPJ Quantum Technol.9(1), 19 (2022) https://doi.org/10.1140/epjqt/s40507-...

    doi:10.1140/epjqt/s40507-022-00138-x 2022

  5. [5]

    Dowling, J.P., Milburn, G.J.: Quantum technology: The second quantum revolu- tion. Philos. Trans. R. Soc. A, 1655–1674 (2003) https://doi.org/10.1098/rsta.2 003.1227

    work page doi:10.1098/rsta.2 2003

  6. [6]

    Degen, C.L.: Quantum sensing. Rev. Mod. Phys.89(3), 035002 (2017) https: //doi.org/10.1103/RevModPhys.89.035002

    doi:10.1103/revmodphys.89.035002 2017

  7. [7]

    arXiv:2506.19232 [quant-ph] (2025)

    Aaronson, S., Childs, A.M., Farhi, E., Harrow, A.W., Sanders, B.C.: Future of Quantum Computing. arXiv:2506.19232 [quant-ph] (2025). https://doi.org/10.4 8550/arXiv.2506.19232

    doi:10.48550/arxiv.2506.19232 2025

  8. [8]

    Sanders, B.C.: The success and failure of quantum computing start-ups. Nat. Electron.8(1), 5–7 (2025) https://doi.org/10.1038/s41928-025-01337-x

    work page doi:10.1038/s41928-025-01337-x 2025

  9. [9]

    IET Quantum Commun.2(4), 182– 217 (2021) https://doi.org/10.1049/qtc2.12015

    Sidhu, J.S., Joshi, S.K., G¨ undo˘ gan, M., Brougham, T., Lowndes, D., Mazzarella, L., Krutzik, M., Mohapatra, S., Dequal, D., Vallone, G., Villoresi, P., Ling, A., Jennewein, T., Mohageg, M., Rarity, J.G., Fuentes, I., Pirandola, S., Oi, D.K.L.: Advances in space quantum communications. IET Quantum Commun.2(4), 182– 217 (2021) https://doi.org/10.1049/qtc2.12015

    doi:10.1049/qtc2.12015 2021

  10. [10]

    Chitambar, E., Gour, G.: Quantum resource theories. Rev. Mod. Phys.91(2), 025001 (2019) https://doi.org/10.1103/RevModPhys.91.025001

    doi:10.1103/revmodphys.91.025001 2019

  11. [11]

    Cambridge University Press, Cambridge (2025)

    Gour, G.: Quantum Resource Theories. Cambridge University Press, Cambridge (2025). https://doi.org/10.1017/9781009560870

    work page doi:10.1017/9781009560870 2025

  12. [13]

    Streltsov, A., Adesso, G., Plenio, M.B.:Colloquium: Quantum coherence as a resource. Rev. Mod. Phys.89(4), 041003 (2017) https://doi.org/10.1103/RevM odPhys.89.041003

    work page doi:10.1103/revm 2017

  13. [14]

    arXiv quant-ph/9807006 (1998)

    Gottesman, D.: The Heisenberg Representation of Quantum Computers. arXiv quant-ph/9807006 (1998). https://doi.org/10.48550/arXiv.quant-ph/9807006

    Pith/arXiv arXiv doi:10.48550/arxiv.quant-ph/9807006 1998

  14. [15]

    Veitch, V., Mousavian, S.A.H., Gottesman, D., Emerson, J.: The resource theory of stabilizer quantum computation. New J. Phys.16(1), 013009 (2014) https: //doi.org/10.1088/1367-2630/16/1/013009

    doi:10.1088/1367-2630/16/1/013009 2014

  15. [16]

    Quantum Sci

    Heyfron, L.E., Campbell, E.T.: An efficient quantum compiler that reduces T count. Quantum Sci. Technol.4(1), 015004 (2018) https://doi.org/10.1088/2058 -9565/aad604

    work page doi:10.1088/2058 2018

  16. [17]

    Europhys

    Chiribella, G., D’Ariano, G.M., Perinotti, P.: Transforming quantum operations: Quantum supermaps. Europhys. Lett.83(3), 30004 (2008) https://doi.org/10.1 209/0295-5075/83/30004

    2008

  17. [18]

    IEEE Trans

    Gour, G.: Comparison of Quantum Channels by Superchannels. IEEE Trans. Inf. Theory65(9), 5880–5904 (2019) https://doi.org/10.1109/TIT.2019.2907989

    arXiv 2019

  18. [19]

    arXiv:2101.01552 [quant-ph] (2020)

    Gour, G., Scandolo, C.M.: Dynamical Resources. arXiv:2101.01552 [quant-ph] (2020). https://doi.org/10.48550/arXiv.2101.01552

    Pith/arXiv arXiv doi:10.48550/arxiv.2101.01552 2020

  19. [20]

    Gour, G., Winter, A.: How to Quantify a Dynamical Quantum Resource. Phys. Rev. Lett.123(15), 150401 (2019) https://doi.org/10.1103/PhysRevLett.123.15 0401

    work page doi:10.1103/physrevlett.123.15 2019

  20. [21]

    arXiv:1904.04201 [quant-ph] (2019)

    Liu, Z.-W., Winter, A.: Resource Theories of Quantum Channels and the Uni- versal Role of Resource Erasure. arXiv:1904.04201 [quant-ph] (2019). https: //doi.org/10.48550/arXiv.1904.04201

    Pith/arXiv arXiv doi:10.48550/arxiv.1904.04201 1904

  21. [22]

    Liu, Y., Yuan, X.: Operational resource theory of quantum channels. Phys. Rev. Res.2(1), 012035 (2020) https://doi.org/10.1103/PhysRevResearch.2.012035

    doi:10.1103/physrevresearch.2.012035 2020

  22. [23]

    One-shot dynamical resource theory

    Yuan, X., Zeng, P., Gao, M., Zhao, Q.: One-Shot Dynamical Resource Theory. arXiv:2012.02781 [quant-ph] (2020). https://doi.org/10.48550/arXiv.2012.02781

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.2012.02781 2012

  23. [24]

    Bennett, C.H., Brassard, G., Cr´ epeau, C., Jozsa, R., Peres, A., Wootters, W.K.: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky- Rosen channels. Phys. Rev. Lett.70(13), 1895–1899 (1993) https://doi.org/10.1 103/PhysRevLett.70.1895

    1993

  24. [25]

    IEEE Trans

    Devetak, I., Winter, A.: Distilling Common Randomness From Bipartite Quan- tum States. IEEE Trans. Inf. Theory50, 3183–3196 (2004) https://doi.org/10.1 109/TIT.2004.838115 25

    arXiv 2004

  25. [26]

    IEEE Trans

    Devetak, I., Harrow, A.W., Winter, A.J.: A Resource Framework for Quantum Shannon Theory. IEEE Trans. Inf. Theory54(10), 4587–4618 (2008) https://do i.org/10.1109/TIT.2008.928980

    arXiv 2008

  26. [27]

    Chiribella, G., D’Ariano, G.M., Perinotti, P., Valiron, B.: Quantum computations without definite causal structure. Phys. Rev. A88(2), 022318 (2013) https://do i.org/10.1103/PhysRevA.88.022318

    doi:10.1103/physreva.88.022318 2013

  27. [28]

    Colnaghi, T., D’Ariano, G.M., Facchini, S., Perinotti, P.: Quantum computation with programmable connections between gates. Phys. Lett. A376(45), 2940–2943 (2012) https://doi.org/10.1016/j.physleta.2012.08.028

    doi:10.1016/j.physleta.2012.08.028 2012

  28. [29]

    Chiribella, G.: Perfect discrimination of no-signalling channels via quantum su- perposition of causal structures. Phys. Rev. A86(4), 040301 (2012) https: //doi.org/10.1103/PhysRevA.86.040301

    work page doi:10.1103/physreva.86.040301 2012

  29. [30]

    Chiribella, G., Kristj´ ansson, H.: Quantum Shannon theory with superpositions of trajectories. Proc. R. Soc. A475(2225), 20180903 (2019) https://doi.org/10.1 098/rspa.2018.0903

    arXiv 2019

  30. [31]

    Kristj´ ansson, H., Chiribella, G., Salek, S., Ebler, D., Wilson, M.: Resource theories of communication. New J. Phys.22(7), 073014 (2020) https://doi.org/10.1088/ 1367-2630/ab8ef7

    2020

  31. [32]

    PhD thesis, University of Oxford (2022)

    Kristj´ ansson, H.: A second-quantised Shannon theory. PhD thesis, University of Oxford (2022)

    2022

  32. [33]

    Oreshkov, O., Costa, F., Brukner, ˇC.: Quantum correlations with no causal order. Nat. Commun.3(1), 1092 (2012) https://doi.org/10.1038/ncomms2076

    doi:10.1038/ncomms2076 2012

  33. [34]

    Oreshkov, O., Giarmatzi, C.: Causal and causally separable processes. New J. Phys.18(9), 093020 (2016) https://doi.org/10.1088/1367-2630/18/9/093020

    doi:10.1088/1367-2630/18/9/093020 2016

  34. [35]

    Baumeler, ¨A., Wolf, S.: The space of logically consistent classical processes with- out causal order. New J. Phys.18(1), 013036 (2016) https://doi.org/10.1088/13 67-2630/18/1/013036

    doi:10.1088/13 2016

  35. [36]

    Wechs, J., Dourdent, H., Abbott, A.A., Branciard, C.: Quantum Circuits with Classical Versus Quantum Control of Causal Order. Phys. Rev. X Quantum2(3), 030335 (2021) https://doi.org/10.1103/PRXQuantum.2.030335

    doi:10.1103/prxquantum.2.030335 2021

  36. [37]

    Zhao, X., Yang, Y., Chiribella, G.: Quantum Metrology with Indefinite Causal Order. Phys. Rev. Lett.124(19), 190503 (2020) https://doi.org/10.1103/PhysRe vLett.124.190503

    doi:10.1103/physre 2020

  37. [38]

    In: Renner, R., Stupar, S

    Perinotti, P.: Causal Structures and the Classification of Higher Order Quantum Computations. In: Renner, R., Stupar, S. (eds.) Time in Physics, pp. 103–127. 26 Birkh¨ auser, Cham (2017). https://doi.org/10.1007/978-3-319-68655-47

    work page doi:10.1007/978-3-319-68655-47 2017

  38. [39]

    Bisio, A., Perinotti, P.: Theoretical framework for higher-order quantum theory. Proc. R. Soc. A475(2225), 20180706 (2019) https://doi.org/10.1098/rspa.2018. 0706

    doi:10.1098/rspa.2018 2019

  39. [40]

    Quantum8, 1241 (2024) https://doi.org/10 .22331/q-2024-02-05-1241 2202.10214

    Apadula, L., Bisio, A., Perinotti, P.: No-signalling constrains quantum computa- tion with indefinite causal structure. Quantum8, 1241 (2024) https://doi.org/10 .22331/q-2024-02-05-1241 2202.10214

    Pith/arXiv arXiv 2024

  40. [41]

    Kissinger, A., Uijlen, S.: A categorical semantics for causal structure. Log. Meth- ods Comput. Sci.15(3), 1–48 (2019) https://doi.org/10.23638/LMCS-15(3: 15)2019

    work page doi:10.23638/lmcs-15(3: 2019

  41. [42]

    In: 47th International Symposium on Mathematical Foundations of Com- puter Science (MFCS 2022), pp

    Simmons, W., Kissinger, A.: Higher-Order Causal Theories Are Models of BV- Logic. In: 47th International Symposium on Mathematical Foundations of Com- puter Science (MFCS 2022), pp. 80–18014. Schloss Dagstuhl – Leibniz-Zentrum f¨ ur Informatik, Vienna (2022). https://doi.org/10.4230/LIPIcs.MFCS.2022.80

    doi:10.4230/lipics.mfcs.2022.80 2022

  42. [43]

    arXiv:2403.09297 [cs.LO] (2024)

    Simmons, W., Kissinger, A.: A complete logic for causal consistency. arXiv:2403.09297 [cs.LO] (2024). https://doi.org/10.48550/arXiv.2403.09297

    Pith/arXiv arXiv doi:10.48550/arxiv.2403.09297 2024

  43. [44]

    In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science

    Hefford, J., Wilson, M.: A profunctorial semantics for quantum supermaps. In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS ’24, p. 43. Association for Computing Machinery, New York, NY, USA (2024). https://doi.org/10.1145/3661814.3662123 . https://doi.org/10.114 5/3661814.3662123

    arXiv 2024

  44. [45]

    PhD thesis, University of Oxford (2023)

    Wilson, M.: Compositional frameworks for supermaps and causality. PhD thesis, University of Oxford (2023)

    2023

  45. [46]

    arXiv:2207.09180 [quant-ph] (2022)

    Wilson, M., Chiribella, G.: Free Polycategories for Unitary Supermaps of Arbi- trary Dimension. arXiv:2207.09180 [quant-ph] (2022). https://doi.org/10.48550 /arXiv.2207.09180

    Pith/arXiv arXiv doi:10.48550/arxiv.2207.09180 2022

  46. [47]

    In: Heunen, C., Backens, M

    Wilson, M., Chiribella, G.: Causality in higher order process theories. In: Heunen, C., Backens, M. (eds.) Proceedings 18th International Conference on Quan- tum Physics and Logic, Gdansk, Poland, and online, 7-11 June 2021. Electronic Proceedings in Theoretical Computer Science, vol. 343, pp. 265–300 (2021). https://doi.org/10.4204/EPTCS.343.12

    doi:10.4204/eptcs.343.12 2021

  47. [48]

    arXiv:2205.09844 [quant-ph] (2022)

    Wilson, M., Chiribella, G., Kissinger, A.: Quantum Supermaps are Characterized by Locality. arXiv:2205.09844 [quant-ph] (2022). https://doi.org/10.48550/arXiv .2205.09844

    doi:10.48550/arxiv.2205.09844 2022

  48. [49]

    Zanoni, E., Scandolo, C.M.: Choi-defined resource theories. Phys. Rev. A111(6), 062407 (2025) https://doi.org/10.1103/PhysRevA.111.062407 27

    work page doi:10.1103/physreva.111.062407 2025

  49. [50]

    Burniston, J., Grabowecky, M., Scandolo, C.M., Chiribella, G., Gour, G.: Nec- essary and sufficient conditions on measurements of quantum channels. Proc. R. Soc. A476(2236), 20190832 (2020) https://doi.org/10.1098/rspa.2019.0832

    arXiv 2020

  50. [51]

    Cambridge University Press, Cambridge (2022)

    Avigad, J.: Mathematical Logic and Computation. Cambridge University Press, Cambridge (2022). https://doi.org/10.1017/9781108778756

    doi:10.1017/9781108778756 2022

  51. [52]

    Forthcoming

    Steakley, S., Zanoni, E., Scandolo, C.M.: Operational Higher-Order Quantum Theory from Types. Forthcoming

  52. [53]

    Master’s thesis, University of Calgary

    Steakley, S.: A type-based framework for higher-order quantum theory. Master’s thesis, University of Calgary. Forthcoming

  53. [54]

    PhD thesis, University of Calgary (2025)

    Zanoni, E.: Maps and Higher-Order Maps for the Manipulation of Quantum Resources. PhD thesis, University of Calgary (2025)

    2025

  54. [55]

    IOP Publishing, Bristol (2023)

    Skrzypczyk, P., Cavalcanti, D.: Semidefinite Programming in Quantum Informa- tion Science. IOP Publishing, Bristol (2023)

    2023

  55. [56]

    Girard, M.W., Gour, G., Friedland, S.: On convex optimization problems in quan- tum information theory. J. Phys. A47(50), 505302 (2014) https://doi.org/10.1 088/1751-8113/47/50/505302

    2014

  56. [57]

    Gour, G., Wilde, M.M.: Entropy of a quantum channel. Phys. Rev. Res.3(2), 023096 (2021) https://doi.org/10.1103/PhysRevResearch.3.023096

    doi:10.1103/physrevresearch.3.023096 2021

  57. [58]

    Gour, G., Kim, D., Nateeboon, T., Shemesh, G., Yoeli, G.: Inevitable negativity: Additivity commands negative quantum channel entropy. Phys. Rev. A111(5), 052424 (2025) https://doi.org/10.1103/PhysRevA.111.052424

    work page doi:10.1103/physreva.111.052424 2025

  58. [59]

    Yuan, X.: Hypothesis testing and entropies of quantum channels. Phys. Rev. A 99(3), 032317 (2019) https://doi.org/10.1103/PhysRevA.99.032317

    doi:10.1103/physreva.99.032317 2019

  59. [60]

    Chu, Y., Huang, F., Li, M.-X., Zheng, Z.-J.: An entropy function of a quantum channel. Quantum. Inf. Process.22(1), 27 (2022) https://doi.org/10.1007/s111 28-022-03778-1 28

    doi:10.1007/s111 2022