相关论文: Quantum Adiabatic Computation and the Travelling S…

This paper studies quantum optimization baselines for the Generalized Traveling Salesman Problem (GTSP), a clustered routing problem that naturally models variant selection and sequencing problems under discrete alternatives. We propose a…

We analyze the performance of adiabatic quantum computation (AQC) under the effect of decoherence. To this end, we introduce an inherently open-systems approach, based on a recent generalization of the adiabatic approximation. In contrast…

This paper studies the Hamiltonian Cycle Problem (HCP) and the Traveling Salesman Problem (TSP) on D-Wave's quantum systems. Initially, motivated by the fact that most libraries present their benchmark instances in terms of adjacency…

Adiabatic quantum algorithms represent a promising approach to universal quantum computation. Whilst in a closed system these algorithms are limited by avoided level crossings, where the gap becomes exponentially small in the system size,…

We provide and analyze examples that counter the widely made claim that tunneling is needed for a quantum speedup in optimization problems. The examples belong to the class of perturbed Hamming-weight optimization problems. In one case,…

Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic…

We present a new quantum adiabatic theorem that allows one to rigorously bound the adiabatic timescale for a variety of systems, including those described by unbounded Hamiltonians. Our bound is geared towards the qubit approximation of…

One of the most important questions in studying quantum computation is: whether a quantum computer can solve NP-complete problems more efficiently than a classical computer? In 2000, Farhi, et al. (Science, 292(5516):472--476, 2001)…

Adiabatic state engineering is a powerful technique in quantum information and quantum control. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided…

This paper explores the application of Quadratic Unconstrained Binary Optimization (QUBO) models in solving the Travelling Salesman Problem (TSP) through Quantum Annealing algorithms and Graph Neural Networks. Quantum Annealing (QA), a…

Quantum adiabatic optimization (QAO) is performed using a time-dependent Hamiltonian $H(s)$ with spectral gap $\gamma(s)$. Assuming the existence of an oracle $\Gamma$ such that $\gamma_\min = \Theta\left(\min_s\Gamma(s)\right)$, we provide…

We introduce and study the adiabatic dynamics of free-fermion models subject to a local Lindblad bath and in the presence of a time-dependent Hamiltonian. The merit of these models is that they can be solved exactly, and will help us to…

Quantum optimization is the most mature quantum computing technology to date, providing a promising approach towards efficiently solving complex combinatorial problems. Methods such as adiabatic quantum computing (AQC) have been employed in…

This paper is devoted to a generalisation of the quantum adiabatic theorem to a nonlinear setting. We consider a Hamiltonian operator which depends on the time variable and on a finite number of parameters and acts on a separable Hilbert…

The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…

We give an overview of a quantum adiabatic algorithm for Hilbert's tenth problem, including some discussions on its fundamental aspects and the emphasis on the probabilistic correctness of its findings. For the purpose of illustration, the…

We review the proposal of a quantum algorithm for Hilbert's tenth problem and provide further arguments towards the proof that: (i) the algorithm terminates after a finite time for any input of Diophantine equation; (ii) the final ground…

We give an update on a quantum adiabatic algorithm for the Turing noncomputable Hilbert's tenth problem, and briefly go over some relevant issues and misleading objections to the algorithm.

Quantum computation by the adiabatic theorem requires a slowly varying Hamiltonian with respect to the spectral gap. We show that the Landau-Zener-St\"uckelberg oscillation phenomenon, that naturally occurs in quantum two level systems…

We determine the complexity of several constraint satisfaction problems using the quantum adiabatic algorithm in its simplest implementation. We do so by studying the size dependence of the gap to the first excited state of "typical"…