Related papers: Synthesis of a quantum tree Weyl matrix

We develop the theory of Weyl group multiple Dirichlet series for root systems of type C. For an arbitrary root system of rank r and a positive integer n, these are Dirichlet series in r complex variables with analytic continuation and…

In this work, based on quantum operator Hermite polynomials and Weyl's mapping rule, we find a generation function of the two-variable Hermite polynomials. And then, noting that the Weyl ordering is invariant under the similar…

Quantum graphs and their experimental counterparts, microwave networks, are ideally suited to study the spectral statistics of chaotic systems. The graph spectrum is obtained from the zeros of a secular determinant derived from energy and…

We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and…

The quantum density matrix generalises the classical concept of probability distribution to quantum theory. It gives the complete description of a quantum state as well as the observable quantities that can be extracted from it. Its…

A new stable computational method for non-homogeneous waveguide equation with a piecewise uniform structure along the main propagation direction is constructed, based on the modified Dirichlet-to-Neumann (DtN) map of each uniform segment.…

Let $S$ be a spinor bundle of a pseudo-Euclidean vector bundle $(E,\mathrm{g})$ of even rank. We introduce a new filtration on the algebra $\mathcal{D}(M,S)$ of differential operators on $S$. As main property, the associated graded algebra…

A cluster algebra is an algebraic structure generated by operations of a quiver (a directed graph) called the mutations and their associated simple birational mappings. By using a graph-combinatorial approach, we present a systematic way to…

Most state-of-the-art graph kernels only take local graph properties into account, i.e., the kernel is computed with regard to properties of the neighborhood of vertices or other small substructures. On the other hand, kernels that do take…

We present a quantum algorithm for sampling random spanning trees from a weighted graph in $\widetilde{O}(\sqrt{mn})$ time, where $n$ and $m$ denote the number of vertices and edges, respectively. Our algorithm has sublinear runtime for…

We compute the automorphism groups of some quantized algebras, including tensor products of quantum Weyl algebras and some skew polynomial rings.

Quantum circuit synthesis describes the process of converting arbitrary unitary operations into a gate sequence of a fixed universal gate set, usually defined by the operations native to a given hardware platform. Most current synthesis…

We develop an approach for building quantum models based on the exponentially growing orthonormal basis of Hartley kernel functions. First, we design a differentiable Hartley feature map parametrized by real-valued argument that enables…

The Moyal formalism for a particle can be derived from the Moyal formalism for a spin. This is done by contracting the group of rotations to the oscillator group. A new derivation is given for the contraction of the spin Wigner-kernel to…

A wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We describe a pair of short exact sequences relating the sandpile group of a wired tree to the sandpile groups of its principal subtrees. In the case…

This paper provides the generating series for the embedding of tree-like graphs of arbitrary number of vertices, accourding to their genus. It applies and extends the techniques of Chan, where it was used to give an alternate proof of the…

We implement the so-called Weyl-Heisenberg covariant integral quantization in the case of a classical system constrained by a bounded or semi-bounded geometry. The procedure, which is free of the ordering problem of operators, is…

By taking the Weyl equation with external electro-magnetic potentials as the simplest representative for a system of PDOs, we give a new method of treating non-commutativity of coefficients matrices. More precisely, we construct a Fourier…

We present an algorithm for characterising the generalised Dirichlet to Neumann map for moving initial-boundary value problems. This algorithm is derived by combining the so-called global relation, which couples the initial and boundary…

In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…