Related papers: Why and when is pausing beneficial in quantum anne…
Finding the ground state of the Ising spin-glass is an important and challenging problem (NP-hard, in fact) in condensed matter physics. However, its applications spread far beyond physic due to its deep relation to various combinatorial…
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…
For quantum annealing, as opposed to circuit based quantum computing, the solution to a computational problem is encoded in the ground state of a quantum system. Therefore its susceptibility to environmental effects is a different but not…
Quantum simulation with adiabatic annealing can provide insight into difficult problems that are impossible to study with classical computers. However, it deteriorates when the systems scale up due to the shrinkage of the excitation gap and…
The promise of quantum computing lies in harnessing programmable quantum devices for practical applications such as efficient simulation of quantum materials and condensed matter systems. One important task is the simulation of…
Building on the insight that engineered noise, specifically, engineered dephasing can enhance the adiabaticity of controlled quantum dynamics, we investigate how a dephasing-generating coupling to an auxiliary quantum system affects quantum…
We introduce antiferromagnetic quantum fluctuations into quantum annealing in addition to the conventional transverse-field term. We apply this method to the infinite-range ferromagnetic p-spin model, for which the conventional quantum…
Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary…
The standard quantum annealing algorithm tries to approach the ground state of a classical system by slowly decreasing the hopping rates of a quantum random walk in the configuration space of the problem, where the on-site energies are…
We discuss relaxation in bosonic and fermionic many-particle systems. For integrable systems, the time evolution can cause a dephasing effect, leading for finite subsystems to certain steady states. We give an explicit derivation of those…
A promising approach to solving hard binary optimisation problems is quantum adiabatic annealing (QA) in a transverse magnetic field. An instantaneous ground state --- initially a symmetric superposition of all possible assignments of $N$…
I investigate the problem of optimally discriminating between two open quantum dynamical processes in a single-shot scenario, with the goal of minimizing the error probability of identification. This task involves optimising both the input…
To gain better insight into the complexity theory of quantum annealing, we propose and solve a class of spin systems which contain bottlenecks of the kind expected to dominate the runtime of quantum annealing as it tries to solve difficult…
Sampling all ground states of a Hamiltonian with equal probability is a desired feature of a sampling algorithm, but recent studies indicate that common variants of transverse field quantum annealing sample the ground state subspace…
Quantum annealing is an emerging metaheuristic used for solving combinatorial optimisation problems. However, hardware based physical quantum annealers are primarily limited to a single vendor. As an alternative, we can discretise the…
The quantum Ising chain has shortcuts to adiabaticity when operated with weak processes. However, when exactly do the non-equilibrium effects of the Kibble-Zurek mechanism, inherent to the system, appear in the optimal protocols in such a…
Optimizing the probability of quantum tunneling between two states, while keeping the resources of the underlying physical system constant, is a task of key importance due to its critical role in various applications. We show that, by…
We study the effect of the anneal path control per qubit, a new user control feature offered on the D-Wave 2000Q quantum annealer, on the performance of quantum annealing for solving optimization problems by numerically solving the…
The ability to evaluate the outcomes of quantum annealers is essential for such devices to be used in complex computational tasks. We introduce a statistical test of the quality of Ising-based annealers' output based on the data only,…
Recent tests performed on the D-Wave Two quantum annealer have revealed no clear evidence of speedup over conventional silicon-based technologies. Here, we present results from classical parallel-tempering Monte Carlo simulations combined…