We study quantum annealing in the quantum Ising model coupled to a thermal environment. When the speed of quantum annealing is sufficiently slow, the system evolves following the instantaneous thermal equilibrium. This quasistatic and isothermal evolution, however, fails near the end of annealing because the relaxation time grows infinitely, therefore yielding excess energy from the thermal equilibrium. We develop a phenomenological theory based on this picture and derive a scaling relation of the excess energy after annealing. The theoretical results are numerically confirmed using a novel non-Markovian method that we recently proposed based on a path-integral representation of the reduced density matrix and the infinite time evolving block decimation. In addition, we discuss crossovers from weak to strong coupling as well as from the adiabatic to quasistatic regime, and propose experiments on the D-Wave quantum annealer.
Quantum annealing is a general strategy for solving difficult optimization problems with the aid of quantum adiabatic evolution. Both analytical and numerical evidence suggests that under idealized, closed system conditions, quantum annealing can outperform classical thermalization-based algorithms such as simulated annealing. Do engineered quantum annealing devices effectively perform classical thermalization when coupled to a decohering thermal environment? To address this we establish, using superconducting flux qubits with programmable spin-spin couplings, an experimental signature which i…
Degeneracy of the bright single exciton spin state is a prerequisite for the production of triggered polarization-entangled photon pairs from the biexciton decay of a quantum dot. Normally, however, the exciton spin states are split due to in-plane asymmetries. Here we demonstrate that the exciton splitting of an individual dot can be tuned through zero by thermal annealing. Repeated annealing blueshifts the exciton emission line of the dot, accompanied by a reduction and inversion in polarization splitting. Annealing is also demonstrated to control the detuning between the exciton and biexcit…
We study various annealing dynamics, both classical and quantum, for simple mean-field models and explain how to describe their behavior in the thermodynamic limit in terms of differential equations. In particular we emphasize the differences between quantum annealing (i.e. evolution with Schrödinger equation) and simulated quantum annealing (i.e. annealing of a Quantum Monte Carlo simulation).
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 less important open question essential to a scalable implementation. In this work we use renormalization group techniques to study the effect of Ohmic baths in a regime typical for practical adiabatic quantum computation. We show qualitative change to the effective Hamiltonian as well as the reduced qubit density matrix encoding entanglement between system an…
Avalanche photodiodes (APDs) are well-suited for single-photon detection on quantum communication satellites as they are a mature technology with high detection efficiency without requiring cryogenic cooling. They are, however, prone to significantly increased thermal noise caused by in-orbit radiation damage. Previous work demonstrated that a one-time application of thermal annealing reduces radiation-damage-induced APD thermal noise. Here we examine the effect of cyclical proton irradiation and thermal annealing. We use an accelerated testing environment which emulates a realistic two-year o…
In this dissertation, we explore how quantum annealing (QA) and its applications behave in an open system setting. We give derivations and numerical recipes for effective parallel simulation methods for time-dependent open dynamics of quantum annealing devices. We consider the weak-coupling limit to an environment and also the case of $1/f$ noise. The stochastic time-dependent quantum trajectories technique can be utilized in studying weak measurements and feedback error correction in quantum annealing. Then we focus on opensystem descriptions of reverse annealing (RA), which is a promising va…
Classical and quantum annealing are two heuristic optimization methods that search for an optimal solution by slowly decreasing thermal or quantum fluctuations. Optimizing annealing schedules is important both for performance and fair comparisons between classical annealing, quantum annealing, and other algorithms. Here we present a heuristic approach for the optimization of annealing schedules for quantum annealing and apply it to 3D Ising spin glass problems. We find that if both classical and quantum annealing schedules are similarly optimized, classical annealing outperforms quantum anneal…
We discuss the quantum annealing of the fully-connected ferromagnetic $ p $-spin model in a dissipative environment at low temperature. This model, in the large $ p $ limit, encodes in its ground state the solution to the Grover's problem of searching in unsorted databases. In the framework of the quantum circuit model, a quantum algorithm is known for this task, providing a quadratic speed-up with respect to its best classical counterpart. This improvement is not recovered in adiabatic quantum computation for an isolated quantum processor. We analyze the same problem in the presence of a low-…
We solve a model that has basic features that are desired for quantum annealing computations: entanglement in the ground state, controllable annealing speed, ground state energy separated by a gap during the whole evolution, and a programmable computational problem that is encoded by parameters of the Ising part of the spin Hamiltonian. Our solution enables exact nonperturbative characterization of final nonadiabatic excitations, including a scaling of their number with the annealing rate and the system size. We prove that quantum correlations can accelerate computations and, at the end of the…
Closed-system quantum annealing is expected to sometimes fail spectacularly in solving simple problems for which the gap becomes exponentially small in the problem size. Much less is known about whether this gap scaling also impedes open-system quantum annealing. Here we study the performance of a quantum annealing processor in solving such a problem: a ferromagnetic chain with sectors of alternating coupling strength that is classically trivial but exhibits an exponentially decreasing gap in the sector size. The gap is several orders of magnitude smaller than the device temperature. Contrary …
We propose a method to interpolate dynamics of von Neumann and classical master equations with an arbitrary mixing parameter to investigate the thermal effects in quantum dynamics. The two dynamics are mixed by intervening to continuously modify their solutions, thus coupling them indirectly instead of directly introducing a coupling term. This maintains the quantum system in a pure state even after the introduction of thermal effects and obtains not only a density matrix but also a state vector representation. Further, we demonstrate that the dynamics of a two-level system can be rewritten as…
We present a comparison between the Quantum Approximate Optimization Algorithm (QAOA) and two widely studied competing methods, Quantum Annealing (QA) and Simulated Annealing (SA). To achieve this, we define a class of optimization problems with respect to their spectral properties which are exactly solvable with QAOA. In this class, we identify instances for which QA and SA have an exponentially small probability to find the solution. Consequently, our results define a first demarcation line between QAOA, Simulated Annealing and Quantum Annealing, and highlight the fundamental differences bet…
Simulated quantum annealing based on the path-integral Monte Carlo is one of the most common tools to simulate quantum annealing on classical hardware. Nevertheless, it is in principle highly non-trivial whether or not this classical algorithm can correctly reproduce the quantum dynamics of quantum annealing, particularly in the diabatic regime. We study this problem numerically through the generalized Kibble-Zurek mechanism of defect distribution in the simplest ferromagnetic one-dimensional transverse-field Ising model with and without coupling to the environment. We find that,in the absence…
We study quantum annealing of pure and random transverse Ising chains that are coupled to boson baths, using a novel numerical method based on the combination of the quasi-adiabatic propagation path integral (QUAPI) and the matrix product state (MPS) formalisms. We present numerical results on systems up to 64 spins and conclude that the baths disturb quantum annealing of pure and random Ising chains. The numerical method to compute the reduced density matrix is described in detail.
We revisit the issue of thermally assisted quantum annealing by a detailed study of the dissipative Landau-Zener problem in presence of a Caldeira-Leggett bath of harmonic oscillators, using both a weak-coupling quantum master equation and a quasi-adiabatic path-integral approach. Building on the known zero-temperature exact results (Wubs et al., PRL 97, 200404 (2006)), we show that a finite temperature bath can have a beneficial effect on the ground-state probability only if it couples also to a spin-direction that is transverse with respect to the driving field, while no improvement is obtai…
Quantum annealing in a real device is necessarily susceptible to errors due to diabatic transitions and thermal noise. Nested quantum annealing correction is a method to suppress errors by using an all-to-all penalty coupling among a set of physical qubits representing a logical qubit. We show analytically that nested quantum annealing correction can suppress errors effectively in ferromagnetic and antiferromagnetic Ising models with infinite-range interactions. Our analysis reveals that the nesting structure can significantly weaken or even remove first-order phase transitions, in which the e…
Los Alamos National Laboratory（洛斯阿拉莫斯国家实验室）；University of New Mexico（新墨西哥大学）
Quantum Annealing (QA) was originally intended for accelerating the solution of combinatorial optimization tasks that have natural encodings as Ising models. However, recent experiments on QA hardware platforms have demonstrated that, in the operating regime corresponding to weak interactions, the QA hardware behaves like a noisy Gibbs sampler at a hardware-specific effective temperature. This work builds on those insights and identifies a class of small hardware-native Ising models that are robust to noise effects and proposes a procedure for executing these models on QA hardware to maximize …
Simulated quantum annealing is a generic classical protocol to simulate some aspects of quantum annealing and is sometimes regarded as a classical alternative to quantum annealing in finding the ground state of a classical Ising model. We derive a generic condition for simulated quantum annealing to converge to thermal equilibrium at a given, typically low, temperature. Both closed and open systems are treated. We rewrite the classical master equation for simulated quantum annealing into an imaginary-time Schrödinger equation, to which we apply the imaginary-time variant of asymptotic adiabati…
We show that quantum diffusion near the quantum critical point can provide a highly very efficient mechanism of open-system quantum annealing. It is based on the diffusion-mediated recombination of excitations. For an Ising spin chain coupled to a bosonic bath, excitation diffusion in a transverse field sharply slows down as the system moves away from the quantum critical region. This leads to spatial correlations and effective freezing of the excitation density. We find that obtaining an approximate solution via the diffusion-mediated quantum annealing can be faster than via closed-system qua…
We investigate alternative annealing schedules on the current generation of quantum annealing hardware (the D-Wave 2000Q), which includes the use of forward and reverse annealing with an intermediate pause. This work provides new insights into the inner workings of these devices (and quantum devices in general), particular into how thermal effects govern the system dynamics. We show that a pause mid-way through the anneal can cause a dramatic change in the output distribution, and we provide evidence suggesting thermalization is indeed occurring during such a pause. We demonstrate that upon pa…
We propose a quantum annealing protocol that more effectively probes the dynamics of a single qubit on D-Wave's quantum annealing hardware. This protocol uses D-Wave's h-gain schedule functionality, which allows the rapid quenching of the longitudinal magnetic field at arbitrary points during the anneal. This features enables us to distinguish between open and closed system dynamics as well as the presence or absence of longitudinal magnetic field noise. We show that both thermal and magnetic field fluctuations are key sources of noise that need to be included in an open quantum system model t…
The debate around the potential superiority of quantum annealers over their classical counterparts has been ongoing since the inception of the field by Kadowaki and Nishimori close to two decades ago. Recent technological breakthroughs in the field, which have led to the manufacture of experimental prototypes of quantum annealing optimizers with sizes approaching the practical regime, have reignited this discussion. However, the demonstration of quantum annealing speedups remains to this day an elusive albeit coveted goal. Here, we examine the power of quantum annealers to provide a different …
Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Simulated annealing is a computational technique which explores the configuration space by mimicking thermal noise. By slow cooling, it freezes the system in a low-energy configuration, but the algorithm often gets stuck in local minima. In quantum annealing, the thermal noise is replaced by controllable quantum fluctuations, and the technique can be implemented in modern quantum simulators. However, quantum-adiabatic schemes become prohibitively slow i…
We study the effect of a thermal environment on the quantum annealing dynamics of a transverse-field Ising chain. The environment is modelled as a single Ohmic bath of quantum harmonic oscillators weakly interacting with the total transverse magnetization of the chain in a translationally invariant manner. We show that the density of defects generated at the end of the annealing process displays a minimum as a function of the annealing time, the so-called optimal working point, only in rather special regions of the bath temperature and coupling strength plane. We discuss the relevance of our r…
We study the problem to infer the ground state of a spin-glass Hamiltonian using data from another Hamiltonian with interactions disturbed by noise from the original Hamiltonian, motivated by the ground-state inference in quantum annealing on a noisy device. It is shown that the average Hamming distance between the inferred spin configuration and the true ground state is minimized when the temperature of the noisy system is kept at a finite value, and not at zero temperature. We present a spin-glass generalization of a well-established result that the ground state of a purely ferromagnetic Ham…
We investigate the quantum annealing of the ferromagnetic $ p $-spin model in a dissipative environment ($ p = 5 $ and $ p = 7 $). This model, in the large $ p $ limit, codifies the Grover's algorithm for searching in an unsorted database. The dissipative environment is described by a phonon bath in thermal equilibrium at finite temperature. The dynamics is studied in the framework of a Lindblad master equation for the reduced density matrix describing only the spins. Exploiting the symmetries of our model Hamiltonian, we can describe many spins and extrapolate expected trends for large $ N $,…
We propose a path-integral Monte Carlo quantum annealing scheme for the symmetric Traveling Salesman Problem, based on a highly constrained Ising-like representation, and we compare its performance against standard thermal Simulated Annealing. The Monte Carlo moves implemented are standard, and consist in restructuring a tour by exchanging two links (2-opt moves). The quantum annealing scheme, even with a drastically simple form of kinetic energy, appears definitely superior to the classical one, when tested on a 1002 city instance of the standard TSPLIB.
Quantum annealing is analogous to simulated annealing with a tunneling mechanism substituting for thermal activation. Its performance has been tested in numerical simulation with mixed conclusions. There is a class of optimization problems for which the efficiency can be studied analytically using techniques based on the statistical mechanics of spin glasses.
Tensor network methods have become a powerful class of tools to capture strongly correlated matter, but methods to capture the experimentally ubiquitous family of models at finite temperature beyond one spatial dimension are largely lacking. We introduce a tensor network algorithm able to simulate thermal states of two-dimensional quantum lattice systems in the thermodynamic limit. The method develops instances of projected entangled pair states and projected entangled pair operators for this purpose. It is the key feature of this algorithm to resemble the cooling down of the system from an in…
Recently it has been demonstrated that an ensemble of trapped ions may serve as a quantum annealer for the number-partitioning problem [Nature Comm. DOI: 10.1038/ncomms11524]. This hard computational problem may be addressed employing a tunable spin glass architecture. Following the proposal of the trapped ions annealer, we study here its robustness against thermal effects, that is, we investigate the role played by thermal phonons. For the efficient description of the system, we use a semiclassical approach, and benchmark it against the exact quantum evolution. The aim is to understand better…
Classical and quantum annealing is discussed for a kinetically constrained chain of $N$ non-interacting asymmetric double wells, represented by Ising spins in a longitudinal field $h$. It is shown that in certain cases, where the kinetic constraints may arise from infinitely high but vanishingly narrow barriers appearing in the relaxation path of the system, quantum annealing exploiting the quantum-mechanical penetration of sufficiently narrow barriers may be far more efficient than its thermal counterpart. We have used a semiclassical picture of scattering dynamics to do our simulation for th…
Bocconi University（博科尼大学）；Istituto Nazionale di Fisica Nucleare（意大利国家核物理研究所）；International Centre for Theoretical Physics（国际理论物理中心）
Quantum annealers aim at solving non-convex optimization problems by exploiting cooperative tunneling effects to escape local minima. The underlying idea consists in designing a classical energy function whose ground states are the sought optimal solutions of the original optimization problem and add a controllable quantum transverse field to generate tunneling processes. A key challenge is to identify classes of non-convex optimization problems for which quantum annealing remains efficient while thermal annealing fails. We show that this happens for a wide class of problems which are central …
We develop a hybrid type of quantum annealing in which we control temperature and quantum field simultaneously. We study the efficiency of proposed quantum annealing and find a good schedule of changing thermal fluctuation and quantum fluctuation. In this paper, we focus on clustering problems which are important topics in information science and engineering. We obtain the better solution of the clustering problem than the standard simulated annealing by proposed quantum annealing.
Probing the lowest energy configuration of a complex system by quantum annealing was recently found to be more effective than its classical, thermal counterpart. Comparing classical and quantum Monte Carlo annealing protocols on the random two-dimensional Ising model we confirm the superiority of quantum annealing relative to classical annealing. We also propose a theory of quantum annealing, based on a cascade of Landau-Zener tunneling events. For both classical and quantum annealing, the residual energy after annealing is inversely proportional to a power of the logarithm of the annealing ti…
The negatively charged silicon monovacancy $V_{Si}^-$ in 4H-silicon carbide (SiC) is a spin-active point defect that has the potential to act as a qubit or quantum memory in solid-state quantum computation applications. Photonic crystal cavities (PCCs) can augment the optical emission of the $V_{Si}^-$, yet fine-tuning the defect-cavity interaction remains challenging. We report on two post-fabrication processes that result in enhancement of the $V_1^{'}$ optical emission from our 1-dimensional PCCs, indicating improved coupling between the ensemble of silicon vacancies and the PCC. One proces…
Quantum annealing method has been widely attracted attention in statistical physics and information science since it is expected to be a powerful method to obtain the best solution of optimization problem as well as simulated annealing. The quantum annealing method was incubated in quantum statistical physics. This is an alternative method of the simulated annealing which is well-adopted for many optimization problems. In the simulated annealing, we obtain a solution of optimization problem by decreasing temperature (thermal fluctuation) gradually. In the quantum annealing, in contrast, we dec…
We present results for a variety of Monte Carlo annealing approaches, both classical and quantum, benchmarked against one another for the textbook optimization exercise of a simple one-dimensional double-well. In classical (thermal) annealing, the dependence upon the move chosen in a Metropolis scheme is studied and correlated with the spectrum of the associated Markov transition matrix. In quantum annealing, the Path-Integral Monte Carlo approach is found to yield non-trivial sampling difficulties associated with the tunneling between the two wells. The choice of fictitious quantum kinetic en…
Simulated Quantum Annealing (SQA) is a Markov Chain Monte-Carlo algorithm that samples the equilibrium thermal state of a Quantum Annealing (QA) Hamiltonian. In addition to simulating quantum systems, SQA has also been proposed as another physics-inspired classical algorithm for combinatorial optimization, alongside classical simulated annealing. However, in many cases it remains an open challenge to determine the performance of both QA and SQA. One piece of evidence for the strength of QA over classical simulated annealing comes from an example by Farhi, Goldstone and Gutmann . There a bit-sy…
