Related papers: Constrained quantum annealing of graph coloring
In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally…
We present a hybrid classical-quantum computing paradigm where the quantum part strictly runs within the coherence time of a quantum annealer, a method we call variational coherent quantum annealing (VCQA). It involves optimizing the…
We study quantum analogs of graph colorings and chromatic number. Initially defined via an interactive protocol, quantum colorings can also be viewed as a natural operator relaxation of graph coloring. Since there is no known algorithm for…
NP problems are closely related to practical optimization challenges but often suffer from exponential increases in computation time as problem sizes grow. Quantum annealing offers a promising approach to solve NP problems faster than…
We study the problem to infer the original ground state of a spin-glass Hamiltonian out of the information from the Hamiltonian with interactions deviated from the original ones. Our motivation comes from quantum annealing on a real device…
As a fundamental metric for quantifying quantum advantage in non-local games, the quantum chromatic number reveals the power of entanglement in distributed tasks. In this paper, we investigate this parameter for $q$-ary Hamming graphs and a…
Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum…
The spread of intelligent transportation systems in urban cities has caused heavy computational loads, requiring a novel architecture for managing large-scale traffic. In this study, we develop a method for globally controlling traffic…
The question of controllability is investigated for a quantum control system in which the Hamiltonian operator components carry explicit time dependence which is not under the control of an external agent. We consider the general situation…
We propose a framework to solve non-linear and history-dependent mechanical problems based on a hybrid classical computer -- quantum annealer approach. Quantum Computers are anticipated to solve particular operations exponentially faster.…
Quantum annealing, as currently implemented in hardware, cannot fairly sample all ground states. Graph minor embedding, which maps a problem to the hardware graph of quantum annealers, affects sampling all states. In this study, we…
Quantum annealing (QA) is a promising approach for solving combinatorial optimization problems; however, it is known to exhibit unfair sampling, in which degenerate ground states are not sampled with equal probability even for sufficiently…
A general treatment of the spectral problem of quantum graphs and tight-binding models in finite Hilbert spaces is given. The direct spectral problem and the inverse spectral problem are written in terms of simple algebraic equations…
Quantum annealers are an alternative approach to quantum computing which make use of the adiabatic theorem to efficiently find the ground state of a physically realizable Hamiltonian. Such devices are currently commercially available and…
A quantum navigation problem concerns the identification of a time-optimal Hamiltonian that realises a required quantum process or task, under the influence of a prevailing `background' Hamiltonian that cannot be manipulated. When the task…
Approximating the dynamics given by a complex many-body Hamiltonian with a simpler effective model lies at the interface of quantum Hamiltonian learning and quantum simulation. In this context, quantum generative adversarial networks…
In this paper, we consider the spectrum of a model in quantum electrodynamics with a spatial cutoff. It is proven that (1) the Hamiltonian is self-adjoint; (2) under the infrared regularity condition, the Hamiltonian has a unique ground…
Quantum technology is maturing to the point where quantum devices, such as quantum communication systems, quantum random number generators and quantum simulators, may be built with capabilities exceeding classical computers. A quantum…
In the era of Noisy Intermediate Scale Quantum (NISQ) computing, available quantum resources are limited. Many NP-hard problems can be efficiently addressed using hybrid classical and quantum computational methods. This paper proposes a…
The motion of quantum particles homogeneously constrained to a curved surface is affected by a curvature induced geometric potential. Here, we consider the case of inhomogeneous confinement and derive the effective Hamiltonian by extending…