Related papers: The Graphs of Quantum Dilogarithm
We construct, using the quantum dilogarithm, a series of *-representations of quantized cluster varieties. This includes a construction of infinite dimensional unitary projective representations of their discrete symmetry groups - the…
In this paper we review a proposed geometrical formulation of quantum mechanics. We argue that this geometrization makes available mathematical methods from classical mechanics to the quantum frame work. We apply this formulation to the…
Qubit-based variational quantum algorithms have undergone rapid development in recent years but still face several challenges. In this context, we propose a symmetry-enhanced digitized counterdiabatic quantum algorithm utilizing qudits…
We use the theory of the quantum group $U_q(gl(2,\RR))$ in order to develop a quantum theory of invariants and show a decomposition of invariants into a Gordan-Capelli series. Higher binary forms are introduced on the basis of braided…
The continuum limit of loop quantum gravity is still an open problem. Indeed, no proper dynamics in known to start with and we still lack the mathematical tools to study its would-be continuum limit. In the present PhD dissertation, we will…
The quadratic unconstrained binary optimization (QUBO) problem arises in diverse optimization applications ranging from Ising spin problems to classical problems in graph theory and binary discrete optimization. The use of preprocessing to…
In this article, we study directed graphs (digraphs) with a coloring constraint due to Von Neumann and related to Nim-type games. This is equivalent to the notion of kernels of digraphs, which appears in numerous fields of research such as…
Graph states are ubiquitous in quantum information with diverse applications ranging from quantum network protocols to measurement based quantum computing. Here we consider the question whether one graph (source) state can be transformed…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
Given a finite group G with a bilocal representation, we investigate the bipartite entanglement in the state constructed from the group algebra of G acting on a separable reference state. We find an upper bound for the von Neumann entropy…
In this paper, we consider discrete time quantum walks on graphs with coin focusing on the decentralized model, where the coin operation is allowed to change with the vertex of the graph. When the coin operations can be modified at every…
In this work, the operator-sum representation of a quantum process is extended to the probability representation of quantum mechanics. It is shown that each process admitting the operator-sum representation is assigned a kernel, convolving…
We study the problem of bicoloring random hypergraphs, both numerically and analytically. We apply the zero-temperature cavity method to find analytical results for the phase transitions (dynamic and static) in the 1RSB approximation. These…
For any fixed surface Sigma of genus g, we give an algorithm to decide whether a graph G of girth at least five embedded in Sigma is colorable from an assignment of lists of size three in time O(|V(G)|). Furthermore, we can allow a subgraph…
One promising application of near-term quantum devices is to prepare trial wavefunctions using short circuits for solving different problems via variational algorithms. For this purpose, we introduce a new circuit design that combines…
[...] In this thesis, we are interested in generalizing factor graphs and the relevant methods toward describing quantum systems. Two generalizations of classical graphical models are investigated, namely double-edge factor graphs (DeFGs)…
We give a randomized algorithm that properly colors the vertices of a triangle-free graph G on n vertices using O(\Delta(G)/ log \Delta(G)) colors, where \Delta(G) is the maximum degree of G. The algorithm takes O(n\Delta2(G)log\Delta(G))…
In this paper we are interested in the studying coarse-graining in field theories using the language of quantum open systems. Motivated by the ideas of Calzetta and Hu on correlation histories we employ the Zwanzig projection technique to…
Associated to a finite graph $X$ is its quantum automorphism group $G$. The main problem is to compute the Poincar\'e series of $G$, meaning the series $f(z)=1+c_1z+c_2z^2+...$ whose coefficients are multiplicities of 1 into tensor powers…
To adopt a practical method to calculate the action of geometrical operators on quantum states is a crucial task in loop quantum gravity. In the series of papers, we will introduce a graphical method, developed by Yutsis and Brink, to loop…