Related papers: Reply to ``The quantum algorithm of Kieu does not …
The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…
In their Letter, Garnerone et al. claim that an adiabatic quantum algorithm can extract information about a PageRank vector with either a polynomial or exponential reduction in time resources over the classical algorithm with comparable…
Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance, yet is often poorly understood. We study the dynamics of a…
Recently a method for adiabatic quantum computation has been proposed and there has been considerable speculation about its efficiency for NP-complete problems. Heuristic arguments in its favor are based on the unproven assumption of an…
Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to…
In the continuum limit (large number of qubits), adiabatic quantum algorithms display a remarkable similarity to sweeps through quantum phase transitions. We find that transitions of second or higher order are advantageous in comparison to…
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then…
We clarify that the nonadiabatic scheme based on a parallel extension of the adiabatic scenario cannot realize the desired goal of quantum computation.
Quantum computing for machine learning attracts increasing attention and recent technological developments suggest that especially adiabatic quantum computing may soon be of practical interest. In this paper, we therefore consider this…
Adiabatic quantum computing (AQC) started as an approach to solving optimization problems, and has evolved into an important universal alternative to the standard circuit model of quantum computing, with deep connections to both classical…
The NP-complete problem of the travelling salesman (TSP) is considered in the framework of quantum adiabatic computation (QAC). We first derive a remarkable lower bound for the computation time for adiabatic algorithms in general as a…
We numerically study quantum adiabatic algorithm for the propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows…
The quantum adiabatic theorem states that if a quantum system starts in an eigenstate of the Hamiltonian, and this Hamiltonian varies sufficiently slowly, the system stays in this eigenstate. We investigate experimentally the conditions…
The majorization theory has been applied to analyze the mathematical structure of quantum algorithms. An empirical conclusion by numerical simulations obtained in the previous literature indicates that step-by-step majorization seems to…
The adiabatic approximation exhibits wide applicability in quantum mechanics, providing a simple approach for nontransitional dynamics in quantum systems governed by slowly varying time-dependent Hamiltonians. However, the standard…
The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian…
In this work, we attempt to solve the integer-weight knapsack problem using the D-Wave 2000Q adiabatic quantum computer. The knapsack problem is a well-known NP-complete problem in computer science, with applications in economics, business,…
This article is a brief introduction to quantum algorithms for the eigenvalue problem in quantum many-body systems. Rather than a broad survey of topics, we focus on providing a conceptual understanding of several quantum algorithms that…
In 2004 Ambainis and Regev formulated a certain form of quantum adiabatic theorem and provided an elementary proof which is especially accessible to computer scientists. Their result is achieved by discretizing the total adiabatic evolution…
The adiabatic theorem provides the basis for the adiabatic model of quantum computation. Recently the conditions required for the adiabatic theorem to hold have become a subject of some controversy. Here we show that the reported violations…