Related papers: Solving Hamiltonian Cycle Problem using Quantum $\…
In this paper we define a construct called a time-graph. A complete time-graph of order n is the cartesian product of a complete graph with n vertices and a linear graph with n vertices. A time-graph of order n is given by a subset of the…
We construct an explicit Hamiltonian cycle in the state graph of the 5-puzzle on a toroidal 2x 3 grid, a graph with 720 vertices. The cycle is described by a short symbolic sequence of 48 moves over the alphabet {L,R,V}, repeated $15$…
The equation of state (EoS) of QCD is a crucial input for the modeling of heavy-ion-collision (HIC) and neutron-star-merger systems. Calculations of the fundamental theory of QCD, which could yield the true EoS, are hindered by the infamous…
In this paper, we consider a random geometric graph (RGG)~\(G\) on~\(n\) nodes with adjacency distance~\(r_n\) just below the Hamiltonicity threshold and construct Hamiltonian cycles using additional edges called bridges. The bridges by…
In this paper, we investigate a digitised SU$(2)$ lattice gauge theory in the Hamiltonian formalism. We use partitionings to digitise the gauge degrees of freedom and show how to define a penalty term based on finite element methods to…
Quantum simulations of lattice gauge theories offer the potential to directly study the non-perturbative dynamics of quantum chromodynamics, but naive analyses suggest that they require large computational resources. Large $N_c$ expansions…
With a focus on universal quantum computing for quantum simulation, and through the example of lattice gauge theories, we introduce rather general quantum algorithms that can efficiently simulate certain classes of interactions consisting…
In this paper we extend general grid graphs to the grid graphs consist of polygons tiling on a plane, named polygonal grid graphs. With a cycle basis satisfied polygons tiling, we study the cyclic structure of Hamilton graphs. A Hamilton…
We provide a novel setup for generalizing the two-dimensional pseudospin S=1/2 Dirac equation, arising in graphene's honeycomb lattice, to general pseudospin-S. We engineer these band structures as a nearest-neighbor hopping Hamiltonian…
We develop a consistent approach to Hamiltonian lattice gauge theory, using the maximal-tree gauge. The various constraints are discussed and implemented. An independent and complete set of variables for the colourless sector is determined.…
In the present paper we shall study (2+1) dimensional Z_N gauge theories on a lattice. It is shown that the gauge theories have two phases, one is a Higgs phase and the other is a confinement phase. We investigate low-energy excitation…
In the standard random graph process, edges are added to an initially empty graph one by one uniformly at random. A classic result by Ajtai, Koml\'os, and Szemer\'edi, and independently by Bollob\'as, states that in the standard random…
A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic. In this work we present…
We consider the problem of searching a d-dimensional lattice of N sites for a single marked location. We present a Hamiltonian that solves this problem in time of order sqrt(N) for d>2 and of order sqrt(N) log(N) in the critical dimension…
The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge…
Monte Carlo methods have led to profound insights into the strong-coupling behaviour of lattice gauge theories and produced remarkable results such as first-principles computations of hadron masses. Despite tremendous progress over the last…
Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonian cycles, and to related questions. The corresponding…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
Aiming at evading the notorious sign problem in classical Monte-Carlo approaches to lattice quantum chromodynamics, we present an approach for quantum computing finite-temperature lattice gauge theories at non-zero density. Based on the…
The phase diagram and critical behavior of scalar quantum electrodynamics are investigated using lattice gauge theory techniques. The lattice action fixes the length of the scalar (``Higgs'') field and treats the gauge field as non-compact.…