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.
Comments
31 pages, a continuation of arxiv:2411.09256. Comments welcome
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.
We study higher order quantum maps in the context of a *-autonomous category of affine subspaces. We show that types of higher order maps can be identified with certain Boolean functions that we call type functions. By an extension of this identification, the algebraic structure of Boolean functions is inherited by some sets of quantum objects including higher order maps. Using the Mobius transform, we assign to each type function a poset whose elements are labelled by subsets of indices of the involved spaces. We then show that the type function corresponds to a comb type if and only if the poset is a chain. We also devise a procedure for decomposition of the poset to a set of basic chains from which the type function is constructed by taking maxima and minima of concatenations of the basic chains in different orders. On the level of higher order maps, maxima and minima correspond to affine mixtures and intersections, respectively.
Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes recursively, with the construction of a full hierarchy of maps of increasingly higher order. The analysis of special cases already showed that higher-order quantum functions exhibit features that cannot be tracked down to the usual circuits, such as indefinite causal structures, providing provable advantages over circuital maps. The present treatment provides a general framework where this kind of analysis can be carried out in full generality. The hierarchy of higher-order quantum maps is introduced axiomatically with a formulation based on the language of types of transformations. Complete positivity of higher-order maps is derived from the general admissibility conditions instead of being postulated as in previous approaches. The recursive characterization of convex sets of maps of a given type is used to prove equivalence relations between different types. The axioms of the framework do not refer to the specific mathematical structure of quantum theory, and can therefore be exported in the context of any operational probabilistic theory.
The study of quantum information protocols that process quantum gates has led to an interest in ‘higher-order’ quantum transformations, which are transformations that act on other quantum transformations as inputs and/or return them as outputs. Mathematically, such transformations form an inductive hierarchy of infinitely many levels, or ‘orders’: quantum states are at order zero; channels, which transform quantum states, are at order one; superchannels, which transform channels, are at order two; maps that transform superchannels are at order three, and so on. To proceed toward a general understanding of higher-order quantum theory, we need methods to study the full inductive hierarchy in a uniform manner. In the context of the Hilbert space formalism of quantum theory, this means studying operator spaces (used to represent states), linear operators between operator spaces (used to represent channels), etc.; in other words, the inductive hierarchy of higher-order linear maps. We introduce a methodological framework for higher-order quantum theory, partly modeled on that of [Bisio \& Perinotti, 2019]. The framework is based on a set of types, denoted TypesA. Types may be thought of as labels that we use to identify and differentiate all the different kinds of objects of higher-order quantum theory. The central objects of the framework are typed (higher-order) linear maps, as given by the construction of a set L(x) of linear maps of type x for each x ∈ TypesA. We equip the framework with a parallel product operation for typed linear maps, which modifies and generalizes the tensor product so as to be physically meaningful when applied to maps of distinct and arbitrary orders. With the aim of characterizing the higher-order linear maps that represent valid quantum objects, we give a construction, consisting of a convex cone K(x) for each x ∈ TypesA, which generalizes the notion of complete positivity to all orders. We construct a version of the Choi isomorphism for our framework, and we use it to show that K(x) is self-dual for all x ∈ TypesA.
Quantum processes with indefinite causal structure emerge when we wonder which are the most general evolutions, allowed by quantum theory, of a set of local systems which are not assumed to be in any particular causal order. These processes can be described within the framework of higher−order quantum theory which, starting from considering maps from quantum transformations to quantum transformations, recursively constructs a hierarchy of quantum maps of increasingly higher order. In this work, we develop a formalism for quantum computation with indefinite causal structures; namely, we characterize the computational structure of higher order quantum maps. Taking an axiomatic approach, the rules of this computation are identified as the most general compositions of higher order maps which are compatible with the mathematical structure of quantum theory. We provide a mathematical characterization of the admissible composition for arbitrary higher order quantum maps. We prove that these rules, which have a computational and information-theoretic nature, are determined by the more physical notion of the signalling relations between the quantum systems of the higher order quantum maps.
Transformations of transformations, also called higher-order transformations, is a natural concept in information processing, which has recently attracted significant interest in the study of quantum causal relations. In this work, a framework for characterizing higher-order quantum transformations which relies on the use of superoperator projectors is presented. More precisely, working with projectors in the Choi-Jamiołkowski picture is shown to provide a handy way of defining the characterization constraints on any class of higher-order transformations. The algebraic properties of these projectors are furthermore shown to obey rules similar to multiplicative additive linear logic (MALL) , providing an intuitive way of comparing any two classes through their projectors. The main novelty of this work is the introduction to the algebra of the 'prec' connector. It is used for the characterization of maps that are no signaling from input to output or the other way around. This allows to assess the possible signaling structure of any transformation characterized within the projective framework. The properties of the prec are moreover shown to yield a normal form for projective expressions. This hints towards a general way to compare different classes of higher-order transformations.
Quantum theory challenges classical causal explanations for physical phenomena, calling for a quantum generalisation of causal structure. This thesis advances the study of causal decompositions, a research programme that aims to bridge two prominent, yet conceptually distinct types of structural assumption found across the quantum causality literature. The first is in terms of the global dependency relations between input and output systems of quantum transformations, which in the unitary case we shall refer to as causal structure; the second is in terms of the compositional structure of quantum circuits or networks. Concretely, a causal decomposition is a circuit representation of a unitary transformation in which no-influence relations that hold between its inputs and outputs are made manifest in the absence of paths through the circuit connecting them. Applications include translating between different quantum causal modelling frameworks; equipping a framework based on unitary causal structure with a local, bottom-up description via generalised autonomous causal mechanisms; and relating notions of compatibility between quantum transformations and relativistic causality. Whether causal decompositions always exist remains an open problem. The contributions of this thesis are threefold. First, we develop an order-theoretic account of circuit syntax and demonstrate that every circuit with a given input-output connectivity can be rewritten into a one of a canonical form given by the concept lattice construction from lattice theory. This systematises the search for causal decompositions by providing the shape of the quantum circuit one should look for. Second, we establish a combinatorial condition that fully characterises when causal decompositions into unitary quantum circuits exist without requiring the generalisation to routed quantum circuits prompted by earlier research. This solves a well-defined subproblem of the broader quest, and our proof, an interplay of order theory and operator algebra, lays a foundation for future extensions. Third, we detail the application to relativistic causality. Within a multipartite framework generalising existing literature, we emphasise that the mere lack of superluminal signalling through a quantum channel is not sufficient to conclude its realisability by dynamics that are locally consistent with relativity theory. We conjecture that, on the other hand, a lack of superluminal causal influences through its unitary dilations is sufficient—at least up to arbitrarily small errors. We demonstrate this in various special cases and show that the general statement reduces to the existence of a weak version of causal decompositions.