arxiv: 2604.09192 · v1 · submitted 2026-04-10 · 🪐 quant-ph

Recognition: unknown

Order structure and signalling in higher order quantum maps

Anna Jen\v{c}ov\'a

Authors on Pith no claims yet

Pith reviewed 2026-05-10 17:14 UTC · model grok-4.3

classification 🪐 quant-ph

keywords higher-order quantum mapssignalling structurestructure posetstype functionsrank parity conditionnormal formscausal orderingdistributive lattice

0 comments

The pith

Signalling relations for higher-order quantum maps are determined by rank parity in their structure posets.

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

The paper develops an order-theoretic approach to signalling in higher-order quantum maps by representing types via boolean type functions and associated structure posets. It defines the distributive lattice of regular subtypes through a monotonicity condition on these functions, proving that the lattice is closed under the one-way signalling product and generated by causally ordered types. For any map belonging to a regular subtype, no-signalling conditions between an input and output system follow from a single evaluation of the type function. In the specific case of higher-order types, every signalling relation can be read directly from the structure poset by checking a rank parity condition. The framework further links the poset to normal-form expressions of the type, which can be built from maximal chains together with the signalling relations between them.

Core claim

Higher order quantum map types are represented by type functions characterized by structure posets. The regular subtypes form a distributive lattice under a monotonicity condition; this lattice is closed under one-way signalling and generated by causally ordered types. Signalling relations for maps in a subtype are fixed by a single function evaluation, and for higher-order types they are extracted from the poset via a rank parity condition. Normal forms are related to the poset through its maximal chains and the signalling relations among them.

What carries the argument

The structure poset of a type function, from which all signalling relations for higher-order types are extracted via a rank parity condition.

Load-bearing premise

That the types of higher-order maps are completely described by boolean type functions equipped with structure posets that obey the monotonicity condition defining regular subtypes.

What would settle it

A concrete higher-order quantum map whose observed signalling relations between input and output systems contradict the rank parity predictions obtained from its structure poset.

read the original abstract

We study the signalling structure of higher order quantum maps from an order-theoretic perspective, building on the combinatorial characterization of higher order types by Bisio and Perinotti. We have shown in a previous work arxiv:2411.09256 that types are represented by boolean functions called type functions, and that each such function is characterized by a related structure poset. We characterize the distributive lattice generated by all type functions with fixed indices of input and output systems - whose elements we call regular subtypes - by a monotonicity condition. Unlike the set of type functions, the lattice of regular subtypes is closed under the one-way signalling product, moreover, it is generated by a specific family of causally ordered types. We then study signalling relations for maps belonging to a regular subtype, showing that the no-signalling conditions between an input and an output system are determined by a single evaluation of the corresponding function. For higher order types specifically, we show that all signalling relations can be read off directly from the structure poset via a rank parity condition. Finally, we study relations between the structure poset of a type and its normal forms, that is, expressions of the type in terms of causally ordered types. We illustrate construction of normal forms on some examples, demonstrating the possibility that the normal form can be systematically derived from maximal chains of the poset and signalling relations between them.

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

Jenčová shows signalling relations for higher-order types can be read from the structure poset via rank parity, on top of her prior type-function representation.

read the letter

This paper gives a lattice view of signalling in higher-order quantum maps. The key new piece is that for these types, you can read all the signalling relations straight off the structure poset using a rank parity condition. It builds directly on the author's earlier arXiv:2411.09256, where types are boolean functions with associated posets. Here she defines regular subtypes as the distributive lattice closed under monotonicity, shows it's generated by causally ordered types, and proves closure under the one-way signalling product. The signalling extraction via single function evaluation and the poset parity rule are the main advances. The normal form construction from maximal chains is also new and illustrated with examples. The work is solid on the combinatorial side. The claims line up internally, and the separation between general type functions and the higher-order case is clear. No obvious circularity beyond the acknowledged prior paper, and the new parts like the parity condition and lattice generation stand on their own. The main limitation is that the full proofs aren't in the abstract, so I can't verify the lattice properties or the parity rule in detail from what's here. If the derivations hold, this is a useful organizational tool. If not, the rank parity claim could be the weak point. This is for quantum information people who deal with higher-order processes and want a systematic way to handle causal signalling. Someone already familiar with the type-function framework will find the extensions practical. I would send it for peer review. The ideas are focused, the math is combinatorial and checkable, and it adds concrete tools without overclaiming foundational impact.

Referee Report

2 major / 2 minor

Summary. The paper develops an order-theoretic framework for the signalling structure of higher-order quantum maps, extending the combinatorial characterization of types via boolean type functions and structure posets from prior work (arXiv:2411.09256). It defines regular subtypes as the distributive lattice of monotonic type functions with fixed input/output indices, proves closure under the one-way signalling product, and shows that this lattice is generated by causally ordered types. Signalling relations for maps in a regular subtype are determined by a single evaluation of the type function; for higher-order types specifically, all such relations follow from a rank parity condition on the structure poset. The work concludes by relating structure posets to normal forms expressed via causally ordered types, with examples derived from maximal chains and inter-chain signalling.

Significance. If the central derivations hold, the results supply a direct, poset-based method to extract signalling constraints in higher-order quantum maps without exhaustive function evaluations, strengthening the combinatorial approach to quantum causal structures. The explicit lattice characterization, closure property, and normal-form construction from maximal chains offer practical tools for classifying and constructing higher-order maps. The separation of the general function-evaluation result from the higher-order poset specialization is a clear organizational strength.

major comments (2)

[higher-order types section / rank parity claim] The rank parity condition for extracting all signalling relations from the structure poset (abstract and the section on higher-order types) is load-bearing for the main claim. The manuscript must state the precise rule as a theorem and demonstrate that it is equivalent to the general single-evaluation result for type functions, including a check that it does not introduce additional assumptions beyond the monotonicity defining regular subtypes.
[lattice of regular subtypes] § on lattice closure: the proof that the set of regular subtypes is closed under the one-way signalling product and generated by causally ordered types relies on the monotonicity condition. The argument should explicitly verify that the product of two monotonic functions remains monotonic and that the generated sublattice coincides with the full set of regular subtypes.

minor comments (2)

[abstract / introduction] The abstract and introduction should include a one-paragraph recap of the key definitions (type function, structure poset, monotonicity) from arXiv:2411.09256 so that the new results can be read without immediate reference to the prior paper.
[normal forms examples] In the normal-forms section, the examples would benefit from an explicit table or diagram showing the maximal chains, the derived signalling relations, and the resulting normal-form expression side by side.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading, positive evaluation, and constructive suggestions that will strengthen the manuscript. We address each major comment below and will incorporate the requested clarifications and explicit verifications in the revised version.

read point-by-point responses

Referee: [higher-order types section / rank parity claim] The rank parity condition for extracting all signalling relations from the structure poset (abstract and the section on higher-order types) is load-bearing for the main claim. The manuscript must state the precise rule as a theorem and demonstrate that it is equivalent to the general single-evaluation result for type functions, including a check that it does not introduce additional assumptions beyond the monotonicity defining regular subtypes.

Authors: We agree that elevating the rank parity condition to an explicit theorem will improve the presentation. In the revised manuscript we will formulate it as a numbered theorem in the higher-order types section. The proof will establish equivalence to the single-evaluation result by showing that, for any monotonic type function, the parity of the rank in the structure poset determines the sign of the corresponding type-function evaluation; the argument relies only on the definition of monotonicity and the construction of the structure poset from the type function, without introducing further assumptions. We will include a direct comparison of the two approaches on a representative example to confirm they yield identical signalling constraints. revision: yes
Referee: [lattice of regular subtypes] § on lattice closure: the proof that the set of regular subtypes is closed under the one-way signalling product and generated by causally ordered types relies on the monotonicity condition. The argument should explicitly verify that the product of two monotonic functions remains monotonic and that the generated sublattice coincides with the full set of regular subtypes.

Authors: We accept the suggestion to make the monotonicity preservation and generation arguments fully explicit. The revised proof will first verify closure by direct computation: if f and g are monotonic Boolean functions on the appropriate index sets, their one-way signalling product is shown to be monotonic by checking that any increase in an input coordinate cannot decrease the output value, using the monotonicity of f and g separately. We will then prove that the sublattice generated by the causally ordered types equals the full set of regular subtypes by exhibiting, for an arbitrary monotonic type function, a finite combination of causally ordered generators whose lattice operations recover it, thereby confirming that no monotonic functions lie outside the generated sublattice. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper explicitly builds on the author's prior arXiv:2411.09256 for the representation of types by boolean functions and structure posets, but the core new results—the monotonicity characterization of the distributive lattice of regular subtypes, its closure under one-way signalling products and generation by causally ordered types, the no-signalling conditions being fixed by a single function evaluation, and the rank-parity extraction of all signalling relations directly from the poset for higher-order types—are presented as independent derivations with explicit logical steps. No equation or claim reduces by construction to prior inputs, fitted parameters, or self-citations; the signalling-to-poset mapping is a fresh combinatorial argument rather than a renaming or definitional equivalence. The derivation chain therefore remains self-contained against external mathematical benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The framework rests on the prior combinatorial characterization of types and introduces the monotonicity condition and rank parity rule as new structural properties.

axioms (2)

domain assumption Higher-order types are represented by boolean type functions each characterized by a structure poset
Invoked throughout; taken from arXiv:2411.09256
ad hoc to paper Regular subtypes are exactly the monotonic type functions forming a distributive lattice
Central new characterization stated in the abstract

pith-pipeline@v0.9.0 · 5539 in / 1443 out tokens · 44212 ms · 2026-05-10T17:14:48.854557+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

25 extracted references · 23 canonical work pages · 1 internal anchor

[1]

Chiribella, G

G. Chiribella, G. M. D’Ariano, and P. Perinotti. “Transforming quantum operations: Quantum supermaps”. EPL (Europhysics Letters),8330004, arxiv:0804.0180 (2008). 23

work page arXiv 2008
[2]

Oreshkov, F

O. Oreshkov, F. Costa, and ˇC. Brukner. “Quantum correlations with no causal order”. Nature Communications,3, arxiv:1105.4464 (2012)

work page arXiv 2012
[3]

Chiribella, G

G. Chiribella, G. M. D’Ariano, and P. Perinotti. “Quantum circuit architecture”. Phys- ical Review Letters,101060401, arxiv:0712.1325 (2008)

work page arXiv 2008
[4]

Chiribella, G

G. Chiribella, G. M. D’Ariano, and P. Perinotti. “Theoretical framework for quantum networks”. Physical Review A,80022339, arxiv:0904.4483 (2009)

work page arXiv 2009
[5]

Quantum computa- tions without definite causal structure

G. Chiribella, G. M. D’Ariano, P. Perinotti, and B. Valiron. “Quantum computa- tions without definite causal structure”. Physical Review A,88022318, arxiv:0912.0195 (2013)

work page arXiv 2013
[6]

Higher-order quantum operations, 2025

P. Taranto, S. Milz, M. Murao, M. T. Quintino, and K. Modi. “Higher-order quantum operations”. arXiv:2503.09693 (2025)

work page arXiv 2025
[7]

Causal Structures and the Classification of Higher Order Quantum Com- putations

P. Perinotti. “Causal Structures and the Classification of Higher Order Quantum Com- putations”. Springer International Publishing, pages 103–127, arxiv:1612.05099 (2017)

work page arXiv 2017
[8]

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,47520180706, arxiv:1806.09554 (2019)

work page arXiv 2019
[9]

No-signalling constrains quantum computation with indefinite causal structure

L. Apadula, A. Bisio, and P. Perinotti. “No-signalling constrains quantum computation with indefinite causal structure”. Quantum,81241, arxiv:2202.10214 (2024)

work page arXiv 2024
[10]

A categorical semantics for causal structure

A. Kissinger and S. Uijlen. “A categorical semantics for causal structure”. Logical Methods in Computer Science,15, arxiv:1701.04732 (2019)

work page arXiv 2019
[11]

Higher-order causal theories are models of BV-logic

W. Simmons and A. Kissinger. “Higher-order causal theories are models of BV-logic”. 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), LIPIcs24180, arxiv:2205.11219 (2022)

work page arXiv 2022
[12]

A complete logic for causal consistency

W. Simmons and A. Kissinger. “A complete logic for causal consistency”. arXiv:2403.09297 (2024)

work page arXiv 2024
[13]

Projective characterization of higher-order quantum transformations

T. Hoffreumon and O. Oreshkov. “Projective characterization of higher-order quantum transformations”. Quantum,101978, arxiv:2206.06206 (2026)

work page arXiv 2026
[14]

Characterising transformations between quantum objects, completeness of quantum properties, and transformations without a fixed causal order

S. Milz and M. T. Quintino. “Characterising transformations between quantum objects, completeness of quantum properties, and transformations without a fixed causal order”. Quantum,81415, arxiv:2305.01247 (2024)

work page arXiv 2024
[15]

On the structure of higher order quantum maps

A. Jenˇ cov´ a. “On the structure of higher order quantum maps”. arXiv:2411.09256 (2024)

work page internal anchor Pith review Pith/arXiv arXiv 2024
[16]

Witnessing causal nonseparability

M. Ara´ ujo, C. Branciard, F. Costa, A. Feix, C. Giarmatzi, andˇC. Brukner. “Witnessing causal nonseparability”. New Journal of Physics,17102001, arxiv:1506.03776 (2015)

work page arXiv 2015
[17]

Causal and causally separable processes

O. Oreshkov and C. Giarmatzi. “Causal and causally separable processes”. New Journal of Physics,18093020, arxiv:1506.05449 (2016)

work page arXiv 2016
[18]

Causal and localizable quantum operations

D. Beckman, D. Gottesman, M. A. Nielsen, and J. Preskill. “Causal and localizable quantum operations”. Physical Review A,64052309, quant-ph/0102043 (2001)

work page arXiv 2001
[19]

Semicausal operations are semilo- calizable

T. Eggeling, D. Schlingemann, and R. F. Werner. “Semicausal operations are semilo- calizable”. Europhysics Letters (EPL),57782–788, quant-ph/0104027 (2002). 24

work page arXiv 2002
[20]

Quantum circuits with classi- cal versus quantum control of causal order

J. Wechs, H. Dourdent, A. A. Abbott, and C. Branciard. “Quantum circuits with classi- cal versus quantum control of causal order”. PRX Quantum,2030335, arxiv:2101.08796 (2021)

work page arXiv 2021
[21]

Plávala, General probabilistic theories: An introduction, Physics Reports1033, 1–64 (2023), arXiv:2103.07469 [quant-ph]

M. Pl´ avala. “General probabilistic theories: An introduction”. Physics Reports,1033 1–64, arxiv:2103.07469 (2023)

work page arXiv 2023
[22]

In- definite causal order in boxworld theories, 2024

J. Bavaresco, A. Baumeler, Y. Guryanova, and C. Budroni. “Indefinite causal order in boxworld theories”. arXiv:2411.00951 (2024)

work page arXiv 2024
[23]

Achieving maximal causal indefiniteness in a maximally nonlocal theory, 2024

K. Sengupta. “Achieving maximal causal indefiniteness in a maximally nonlocal theory”. arXiv:2411.04201 (2024). A Boolean functions We collect some basic notations, definitions and properties related to binary strings and boolean functions. See [15, Appendix A] for more information. A.1 Basic definitions Form≤n∈N, we will denote the corresponding interval...

work page arXiv 2024
[24]

Notice that the diagram has two maximal chains, which we will identify by the sequence of their labels as∅ −1−2 and∅ −3−4

The normal form in this case is obtained from Lemma 3.4 (iii) asf ns = (γ 1 2 ◁γ 2 2)∧(γ 2 2 ◁γ 1 2). Notice that the diagram has two maximal chains, which we will identify by the sequence of their labels as∅ −1−2 and∅ −3−4. Such chains are precisely the structure posets of the channel typesγ 1 2 andγ 2
[25]

The two concatenations of the chains in different orders, ∅ −1−2−3−4 and∅ −3−4−1−2, correspond exactly to the chain types appearing in the normal form above

These chains are connected at the least element, so there is no signalling between their elements. The two concatenations of the chains in different orders, ∅ −1−2−3−4 and∅ −3−4−1−2, correspond exactly to the chain types appearing in the normal form above. The no signalling condition indicates that we need to take the meet to neutralize signalling in the ...