Higher-order quantum map types form a distributive lattice of regular subtypes where signalling relations are determined by type function evaluations and structure poset rank parity, with normal forms derived from maximal chains.
No-signalling constrains quantum computation with indefinite causal structure
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
background 1polarities
support 1representative citing papers
Defines polyslot pslot[C] and srep[C] constructions on symmetric monoidal categories that reconstruct unitary supermaps and forbid time-loops in composition, with equivalence shown on path-contraction groupoids.
citing papers explorer
-
Order structure and signalling in higher order quantum maps
Higher-order quantum map types form a distributive lattice of regular subtypes where signalling relations are determined by type function evaluations and structure poset rank parity, with normal forms derived from maximal chains.
-
Polycategorical Constructions for Unitary Supermaps of Arbitrary Dimension
Defines polyslot pslot[C] and srep[C] constructions on symmetric monoidal categories that reconstruct unitary supermaps and forbid time-loops in composition, with equivalence shown on path-contraction groupoids.