Related papers: Making Walks Count: From Silent Circles to Hamilto…
We lay out a general method for computing branching distances between labeled transition systems. We translate the quantitative games used for defining these distances to other, path-building games which are amenable to methods from the…
We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to…
This work develops a methodical approach to counting of walks on cartesian products, biproducts, symmetric and exterior powers and bipowers, Schur operations, coverings and semicoverings of weighted graphs. For weight and root lattices of…
We study a family of random permutation models on the Hamming graph $H(2,n)$ (i.e., the $2$-fold Cartesian product of complete graphs), containing the interchange process and the cycle-weighted interchange process with parameter $\theta >…
We develop a general approach for monitoring and controlling evolution of open quantum systems. In contrast to the master equations describing time evolution of density operators, here, we formulate a dynamical equation for the evolution of…
Precise knowledge of the Hamiltonian of a system is a key to many of its applications. Tasks such state transfer or quantum computation have been well studied with a linear chain, but hardly with systems, which do not possess a linear…
In this paper we study several problems concerning the number of homomorphisms of trees. We give an algorithm for the number of homomorphisms from a tree to any graph by the Transfer-matrix method. By using this algorithm and some…
Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…
This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of…
Analytical methods for finding moments of random Vandermonde matrices with entries on the unit circle are developed. Vandermonde Matrices play an important role in signal processing and wireless applications such as direction of arrival…
We propose to transfer representational knowledge from multiple sources to a target noisy matrix completion task by aggregating singular subspaces information. Under our representational similarity framework, we first integrate linear…
It was shown by Kutnar and \v Sparl in 2009 that every connected vertex-transitive graph of order $6p$, where $p$ is a prime, contains a Hamilton path. In this paper, it will be shown that every such graph contains a Hamilton cycle, except…
A simple example is used to show that renormalization group limit cycles of effective quantum theories can be studied in a new way. The method is based on the similarity renormalization group procedure for Hamiltonians. The example contains…
We present a general method for counting and packing Hamilton cycles in dense graphs and oriented graphs, based on permanent estimates. We utilize this approach to prove several extremal results. In particular, we show that every nearly…
The vertex set of the kth cartesian power of a directed cycle of length m can be naturally identified with the set of k-tuples of integers modulo m. For any two vertices v and w of this graph, it is easy to see that if there is a…
The Travelling Salesman Problem (TSP), finding a minimal weighted Hamilton cycle in a graph, is a typical problem in operation research and combinatorial optimization. In this paper, based on some novel properties on Hamilton graphs, we…
Given a finite abelian group $G$, consider the complete graph on the set of all elements of $G$. Find a Hamiltonian cycle in this graph and for each pair of consecutive vertices along the cycle compute their sum. What are the smallest and…
A new method to construct task graphs for \mcH-matrix arithmetic is introduced, which uses the information associated with all tasks of the standard recursive \mcH-matrix algorithms, e.g., the block index set of the matrix blocks involved…
This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this…
The Hamiltonian limit of the corner transfer matrix (CTM) of a generalised free Fermion vertex system of finite size leads to a quantum spin Hamiltonian of the particular form: \[ {\cal H}_N=-\sum_{n=1}^{N-1}\left\{ n\left(…