Related papers: Solving Hamiltonian Cycle Problem using Quantum $\…
We explore the potential application of quantum computers to the examination of lattice holography, which extends to the strongly-coupled bulk theory regime. With adiabatic evolution, we compute the ground state of a spin system on a…
The Hamiltonian cycle problem (HCP) in digraphs D with degree bound two is solved by two mappings in this paper. The first bijection is between an incidence matrix C_{nm} of simple digraph and an incidence matrix F of balanced bipartite…
Today, hardware constraints are an important limitation on quantum adiabatic optimization algorithms. Firstly, computational problems must be formulated as quadratic unconstrained binary optimization (QUBO) in the presence of noisy coupling…
We generalize the Hamiltonian Monte Carlo algorithm with a stack of neural network layers and evaluate its ability to sample from different topologies in a two dimensional lattice gauge theory. We demonstrate that our model is able to…
We introduce a simple framework for estimating lower bounds on the runtime of a broad class of adiabatic quantum algorithms. The central formula consists of calculating the variance of the final Hamiltonian with respect to the initial…
Precision experimental tests of the Standard Model of particle physics (SM) are one of our best hopes for discovering what new physics lies beyond the SM (BSM). Key in the search for new physics is the connection between theory and…
Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for…
We present a nonperturbative Hamiltonian framework (NPHF) to address the general $N$-body problem. This framework rigorously connects finite-volume spectra from lattice QCD to scattering observables from experiment. To demonstrate its…
This paper presents sufficient conditions for Hamiltonian paths and cycles in graphs. Letting $\lambda\left( G\right) $ denote the spectral radius of the adjacency matrix of a graph $G,$ the main results of the paper are: (1) Let $k\geq1,$…
To date, all proposed quantum algorithms for simulating quantum field theory (QFT) simulate (continuous-time) Hamiltonian lattice QFT as a stepping stone. Two overlooked issues are how large we can take the timestep in these simulations…
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length $\ell$ for all $3 \le \ell \le n$. Write $\alpha(G)$ for the independence number of $G$, i.e. the size of the largest…
We present an algorithm CRE, which either finds a Hamilton cycle in a graph $G$ or determines that there is no such cycle in the graph. The algorithm's expected running time over input distribution $G\sim G(n,p)$ is $(1+o(1))n/p$, the…
As the continuum limit is approached, lattice QCD simulations tend to get trapped in the topological charge sectors of field space and may consequently give biased results in practice. We propose to bypass this problem by imposing open…
The advent of quantum computing necessitates the transition of worldwide cryptosystems to post-quantum cryptography (PQC), which is founded upon the problem of finding short vectors in high-dimensional structured lattices. It is assumed…
The decision problems of the existence of a Hamiltonian cycle or of a Hamiltonian path in a given graph, and of the existence of a truth assignment satisfying a given Boolean formula $C$, are well-known {\it NP}-complete problems. Here we…
Topological gravity is the reduction of Einstein's theory to spacetimes with vanishing curvature, but with global degrees of freedom related to the topology of the universe. We present an exact Hamiltonian lattice theory for topological…
In this series of papers, we study a Hamiltonian model for 3+1d topological phases, based on a generalisation of lattice gauge theory known as "higher lattice gauge theory". Higher lattice gauge theory has so called "2-gauge fields"…
Let $\{G_i\}$ be the random graph process: starting with an empty graph $G_0$ with $n$ vertices, in every step $i \geq 1$ the graph $G_i$ is formed by taking an edge chosen uniformly at random among the non-existing ones and adding it to…
We consider some classical and frustrated lattice spin models with global O(3) spin symmetry. There is no general analytical method to find a ground-state if the spin dependence of the Hamiltonian is more than quadratic (i.e. beyond the…
Two formidable bottlenecks to the applicability of QMC include: (1) the sign problem and (2) algorithmic update inefficiencies. In this thesis, I overcome both these difficulties for a class of problems by extending the fermion bag approach…