Related papers: The Graphs of Quantum Dilogarithm
Consider a sequence of finite regular graphs (GN) converging, in the sense of Benjamini-Schramm, to the infinite regular tree. We study the induced quantum graphs with equilateral edge lengths, Kirchhoff conditions (possibly with a non-zero…
For simple connected graphs with incommensurate bond lengths and with unitary symmetry we prove the Bohigas-Giannoni-Schmit conjecture in its most general form. Using supersymmetry and taking the limit of infinite graph size, we show that…
We define a notion of quantum automorphism group of Graph C*-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of underlying…
Quadratic unconstrained binary optimization (QUBO) tasks are very important in chemistry, finance, job scheduling, and so on, which can be represented using graph structures, with the variables as nodes and the interaction between them as…
The graph isomorphism (GI) problem is the computational problem of finding a permutation of vertices of a given graph $G_1$ that transforms $G_1$ to another given graph $G_2$ and preserves the adjacency. In this work, we propose a quantum…
The central topic of this thesis is two dimensional Quantum Gravity and its properties. The term Quantum Gravity itself is ambiguous as there are many proposals for its correct formulation and none of them have been verified experimentally.…
We study 2-local Hamiltonian quantum systems, consisting of qubits interacting on the star graph of N vertices. We numerically demonstrate that these models are generically non-integrable at infinite temperature, and find evidence for a…
We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic.…
Let $G=(V,E)$ be a finite connected graph along with a coloring of the vertices of $G$ using the colors in a given set $X$. In this paper, we introduce multi-color forcing, a generalization of zero-forcing on graphs, and give conditions in…
We study ring of functions on the (classical and quantized) phase space of 2-dimensional BF theory with the gauge group $\mathrm{GL}_N$ coupled to a 1-dimensional quantum mechanics with global symmetry $\mathrm{GL}_K$. These functions are…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…
We consider the graph $k$-colouring problem encoded as a set of polynomial equations in the standard way over $0/1$-valued variables. We prove that there are bounded-degree graphs that do not have legal $k$-colourings but for which the…
Two-qubit logical gates are proposed on the basis of two atoms trapped in a cavity setup. Losses in the interaction by spontaneous transitions are efficiently suppressed by employing adiabatic transitions and the Zeno effect. Dynamical and…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
Duality between the coloured quantum group and the coloured quantum algebra corresponding to GL(2) is established. The coloured L^{\pm} functionals are constructed and the dual algebra is derived explicitly. These functionals are then…
Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms. One unique advantage of this technology lies in the…
When an external parameter drives a system across a quantum phase transition at a finite rate, work is performed on the system and entropy is dissipated, due to the creation of excitations via the Kibble-Zurek mechanism. Although both the…
The class of entangled $N$-qubit states known as graph states, and the corresponding stabilizer groups of $N$-qubit Pauli observables, have found a wide range of applications in quantum information processing and the foundations of quantum…
Using a technique devised by Bender, Milton and Savage, we derive the Dyson-Schwinger equations for quantum chromodynamics in differential form. We stop our analysis to the two-point functions. The 't~Hooft limit of color number going to…
The b-chromatic number $b(G)$ of a graph $G$ is the maximum $k$ for which $G$ has a proper vertex coloring using $k$ colors such that each color class contains at least one vertex adjacent to a vertex of every other color class. In this…