Related papers: Quantum annealing speedup over simulated annealing…
A pivotal task for quantum computing is to speed up solving problems that are both classically intractable and practically valuable. Among these, combinatorial optimization problems have attracted tremendous attention due to their broad…
We prove an adiabatic theorem that applies at timescales short of the typical adiabatic limit. Our proof analyzes the stability of solutions to Schrodinger's equation under perturbation. We directly characterize cross-subspace effects of…
We investigate quantum scaling phenomena driven by lower-dimensional defects in quantum Ising-like models. We consider quantum Ising rings in the presence of a bond defect. In the ordered phase, the system undergoes a quantum transition…
Quantum annealing provides a powerful platform for simulating magnetic materials and realizing statistical physics models, presenting a compelling alternative to classical Monte Carlo methods. We demonstrate that quantum annealers can…
We propose a novel method for reducing the number of variables in quadratic unconstrained binary optimization problems, using a quantum annealer (or any sampler) to fix the value of a large portion of the variables to values that have a…
Confinement of excitations induces quasilocalized dynamics in disorder-free isolated quantum many-body systems in one spatial dimension. This occurrence is signalled by severe suppression of quantum correlation spreading and of entanglement…
Adiabatic Quantum Computing relies on the quantum adiabatic theorem, which states that a quantum system evolves along its ground state with time if the governing Hamiltonian varies infinitely slowly. However, practical limitations force…
We propose a fast and robust quantum state transfer protocol employing a Su-Schrieffer-Heeger chain, where the interchain couplings vary in time. Based on simple considerations around the terms involved in the definition of the adiabatic…
Recently, Heim, Ronnow, Isakov and Troyer [Science 348 (2015) 215] have reported that Monte Carlo simulations for the Ising spin glass model on the square lattice in the physically relevant continuous-imaginary-time limit do not show…
A particle-in-a-box model of continuous space quantum annealing is proposed and studied numerically by solving the Schr\"odinger wave equation directly. Three types of energy landscapes with multiple local minima are considered, namely a…
As quantum machine learning continues to develop at a rapid pace, the importance of ensuring the robustness and efficiency of quantum algorithms cannot be overstated. Our research presents an analysis of quantum randomized smoothing, how…
Many problems of industrial interest are NP-complete, and quickly exhaust resources of computational devices with increasing input sizes. Quantum annealers (QA) are physical devices that aim at this class of problems by exploiting quantum…
A general quantum adiabatic theorem with and without the time-dependent orthogonalization is proven, which can be applied to understand the origin of activation energies in chemical reactions. Further proofs are also developed for the…
Physical annealing systems provide heuristic approaches to solving NP-hard Ising optimization problems. Here, we study the performance of two types of annealing machines--a commercially available quantum annealer built by D-Wave Systems,…
We explore the role of entanglement in adiabatic quantum optimization by performing approximate simulations of the real-time evolution of a quantum system while limiting the amount of entanglement. To classically simulate the time evolution…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…
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…
The Schr\"odingerisation method combined with the autonomozation technique in \cite{cjL23} converts general non-autonomous linear differential equations with non-unitary dynamics into systems of autonomous Schr\"odinger-type equations, via…
Current generation quantum annealers have already proven to be successful problem-solvers. Yet, quantum annealing is still very much in its infancy, with suboptimal applicability. For instance, to date it is still an open question which…
This paper explores the feasibility of quantum simulation for partial differential equations (PDEs) with physical boundary or interface conditions. Semi-discretisation of such problems does not necessarily yield Hamiltonian dynamics and…