Related papers: On the structure of higher order quantum maps
Let M be a manifold endowed with a symmetric affine connection $\Gamma.$ The aim of this paper is to describe a quantization map between the space of second-order polynomials on the cotangent bundle T^{*} M and the space of second-order…
The Caus[-] construction takes a compact closed category of basic processes and yields a *-autonomous category of higher-order processes obeying certain signalling/causality constraints, as dictated by the type system in the resulting…
We define the notion of higher-order colocally weakly differentiable maps from a manifold $M$ to a manifold $N$. When $M$ and $N$ are endowed with Riemannian metrics, $p\ge 1$ and $k\ge 2$, this allows us to define the intrinsic…
We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…
Recent advancements in quantum hardware have enabled the realization of high-dimensional quantum states. This work investigates the potential of qutrits in quantum machine learning, leveraging their larger state space for enhanced…
We give a brief account of a construction called tokens here, which is significant in algebra, analysis, combinatorics, and physics. Tokens allow to express a semigroup on one set via a semigroup convolution on another set. Therefore tokens…
We use the idea of generic extensions to investigate the correspondence between the isomorphism classes of nilpotent representations of a cyclic quiver and the orbits in the corresponding representation varieties. We endow the set $\cal M$…
In this paper, we define both the upper and lower order of a sense-preserving harmonic mapping in $\mathbb{D}$. We generalize to the harmonic case some known results about holomorphic functions with positive lower order and we show some…
We derive an intuitive and novel method to represent nodes in a graph with special unitary operators, or quantum operators, which does not require parameter training and is competitive with classical methods on scoring similarity between…
Categorical supermaps generalise higher-order quantum operations from finite-dimensional quantum theory to arbitrary circuit theories. In this paper, we establish the Yoneda lemma for categorical supermaps, which states that whenever a…
Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
Bidirectional devices are devices for which the roles of the input and output ports can be exchanged. Mathematically, these devices are described by bistochastic quantum channels, namely completely positive linear maps that are both…
We study the space of functions computed by random-layered machines, including deep neural networks and Boolean circuits. Investigating the distribution of Boolean functions computed on the recurrent and layer-dependent architectures, we…
We derive for Bohmian mechanics topological factors for quantum systems with a multiply-connected configuration space Q. These include nonabelian factors corresponding to what we call holonomy-twisted representations of the fundamental…
A poset can be regarded as a category in which there is at most one morphism between objects, and such that at most one of Hom(c,c') and Hom(c',c) is nonempty for distinct objects c,c'. If we keep in place the latter axiom but allow for…
Holonomic quantum computation makes use of non-abelian geometric phases, associated to the evolution of a subspace of quantum states, to encode logical gates. We identify a special class of subspaces, for which a sequence of rotations…
This paper studies the important problem of quantum classification of Boolean functions from a entirely novel perspective. Typically, quantum classification algorithms allow us to classify functions with a probability of $1.0$, if we are…
We write down a series of basic laws for (strict) higher-order circuit diagrams. More precisely, we define higher-order circuit theories in terms of: (a) nesting, (b) temporal and spatial composition, and (c) equivalence between lower-order…
The affine evaluation map is a surjective homomorphism from the quantum toroidal ${\mathfrak {gl}}_n$ algebra ${\mathcal E}'_n(q_1,q_2,q_3)$ to the quantum affine algebra $U'_q\widehat{\mathfrak {gl}}_n$ at level $\kappa$ completed with…