Related papers: A Algorithm for the Hamilton Circuit Problem
We develop circuit implementations for digital-level quantum Hamiltonian dynamics simulation algorithms suitable for implementation on a reconfigurable quantum computer, such as trapped ions. Our focus is on the co-design of a problem, its…
We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph $G=\gc$. In this model $G$ is drawn uniformly from graphs with vertex set $[n]$, $m$ edges and minimum degree at least three. We focus on…
We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary combinatorial problems. We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted…
Variational quantum algorithms have been advocated as promising candidates to solve combinatorial optimization problems on near-term quantum computers. Their methodology involves transforming the optimization problem into a quadratic…
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
The Hamilton-Jacobi equation for a Hamiltonian section on a Lie affgebroid is introduced and some examples are discussed.
We design a randomized algorithm that finds a Hamilton cycle in $\mathcal{O}(n)$ time with high probability in a random graph $G_{n,p}$ with edge probability $p\ge C \log n / n$. This closes a gap left open in a seminal paper by Angluin and…
In this paper we present the first deterministic polynomial time algorithm for determining the existence of a Hamiltonian cycle and finding a Hamiltonian cycle in general graphs. Our algorithm can also solve the Hamiltonian path problem in…
A hamiltonian sequence is a path walk $P$ that can be a hamiltonian path or hamiltonian circuit. Determining whether such hamiltonian sequence exists in a given graph \G is a NP-Complete problem. In this paper, a novel algorithm for…
We consider the problem of learning the Hamiltonian of a quantum system from estimates of Gibbs-state expectation values. Various methods for achieving this task were proposed recently, both from a practical and theoretical point of view.…
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…
A fractional Hamiltonian formalism is introduced for the recent combined fractional calculus of variations. The Hamilton-Jacobi partial differential equation is generalized to be applicable for systems containing combined Caputo fractional…
We present CertifyHAM, an algorithm which takes as input a graph G and either finds a Hamilton cycle of G or it outputs that such a cycle does not exists. If G=G(n, p) and p >2000/n then the expected running time of CertifyHAM is O(n/p).…
We study the Hamiltonian path problem in C-shaped grid graphs, and present the necessary and sufficient conditions for the existence of a Hamiltonian path between two given vertices in these graphs. We also give a linear-time algorithm for…
This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…
Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful…
Limited by today's physical devices, quantum circuits are usually noisy and difficult to be designed deeply. The novel computing architecture of distributed quantum computing is expected to reduce the noise and depth of quantum circuits. In…
In this paper, we develop a Hamilton-Jacobi theory for forced Hamiltonian and Lagrangian systems. We study the complete solutions, particularize for Rayleigh systems and present some examples. Additionally, we present a method for the…
In order to find Hamiltonian cycle, algorithm should find edges that creates a Hamiltonian cycle. Higher number of edges creates more possibilities to check to solve the problem. Algorithm rests on analysis of original graph and opposite…
Recent works have shown that quantum computers can polynomially speed up certain SAT-solving algorithms even when the number of available qubits is significantly smaller than the number of variables. Here we generalise this approach. We…