There are well-developed theoretical tools to analyze how quantum dynamics can solve computational problems by varying Hamiltonian parameters slowly, near the adiabatic limit. On the other hand, there are relatively few tools to understand the opposite limit of rapid quenches, as used in quantum annealing and (in the limit of infinitely rapid quenches) in quantum walks. In this paper, we develop several tools that are applicable in the rapid-quench regime. Firstly, we analyze the energy expectation value of different elements of the Hamiltonian. From this, we show that monotonic quenches, where the strength of the problem Hamiltonian is consistently increased relative to fluctuation (driver) terms, will yield a better result on average than...
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the qua...
Can quantum computers solve optimization problems much more quickly than classical computers? One ma...
Abstract. Discrete combinatorial optimization consists in finding the optimal configuration that min...
There are well-developed theoretical tools to analyze how quantum dynamics can solve computational p...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Physics, 2004.Includes bibliographi...
We introduce and review briefly the phenomenon of quantum annealing and analog computation. The role...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...
We construct an Ising Hamiltonian with an engineered energy landscape such that it has a local energ...
Quantum computing seeks to use the powers of quantum mechanics to accomplish tasks that classical co...
We study quantum annealing for combinatorial optimization with Hamiltonian $H = z H_f + H_0$ where $...
In this review, after providing the basic physical concept behind quantum annealing (or adiabatic qu...
We perform an in-depth comparison of quantum annealing with several classical optimisation technique...
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the qua...
Can quantum computers solve optimization problems much more quickly than classical computers? One ma...
Abstract. Discrete combinatorial optimization consists in finding the optimal configuration that min...
There are well-developed theoretical tools to analyze how quantum dynamics can solve computational p...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Physics, 2004.Includes bibliographi...
We introduce and review briefly the phenomenon of quantum annealing and analog computation. The role...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...
We construct an Ising Hamiltonian with an engineered energy landscape such that it has a local energ...
Quantum computing seeks to use the powers of quantum mechanics to accomplish tasks that classical co...
We study quantum annealing for combinatorial optimization with Hamiltonian $H = z H_f + H_0$ where $...
In this review, after providing the basic physical concept behind quantum annealing (or adiabatic qu...
We perform an in-depth comparison of quantum annealing with several classical optimisation technique...
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the qua...
Can quantum computers solve optimization problems much more quickly than classical computers? One ma...
Abstract. Discrete combinatorial optimization consists in finding the optimal configuration that min...