Related papers: Quantum Annealing Algorithms for Estimating Ising …
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…
We introduce the transverse Ising model as a prototype for discussing quantum phase transition. Next we introduce Suzuki-Trotter formalism to show the correspondence between $d$-dimensional quantum system with a $(d+1)$-dimensional…
The Sherrington-Kirkpatrick model with random $\pm1$ couplings is programmed on the D-Wave Two annealer featuring 509 qubits interacting on a Chimera-type graph. The performance of the optimizer compares and correlates to simulated…
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…
Adiabatic control is a fundamental technique for manipulating quantum systems, guided by the quantum adiabatic theorem, which ensures suppressed nonadiabatic transitions under slow parameter variations. Quantum annealing, a heuristic…
The performance of quantum annealing for combinatorial optimization is fundamentally limited by the minimum energy gap $\Delta$ encountered at quantum phase transitions. We investigate the scaling of $\Delta$ with system size $N$ for two…
Critical decision-making issues in science, engineering, and industry are based on combinatorial optimization; however, its application is inherently limited by the NP-hard nature of the problem. A specialized paradigm of analogue quantum…
Here we explore which heuristic quantum algorithms for combinatorial optimization might be most practical to try out on a small fault-tolerant quantum computer. We compile circuits for several variants of quantum accelerated simulated…
Quantum annealing aims at solving optimization problems of practical relevance using quantum-computing hardware. Problems of interest are typically formulated in terms of quadratic unconstrained binary optimization (QUBO) Hamiltonians.…
The protocol of quantum annealing is applied to an optimization problem with a one-dimensional continuous degree of freedom, a variant of the problem proposed by Shinomoto and Kabashima. The energy landscape has a number of local minima,…
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods…
Real life quantum computers are inevitably affected by intrinsic noise resulting in dissipative non-unitary dynamics realized by these devices. We consider an open system quantum annealing algorithm optimized for a realistic analog quantum…
Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical…
We first review, following our earlier studies, the critical behavior of the quantum Sherrington-Kirkpatrick (SK) model at finite as well as at zero temperatures. Through the analysis of the Binder cumulant we determined the entire phase…
We report large-scale simulations of the three-dimensional Edwards-Anderson Ising spin glass system using the recently introduced multi-overlap Monte Carlo algorithm. In this approach the temperature is fixed and two replica are coupled…
We solve the $S=1/2$ infinite-range random Heisenberg Hamiltonian in the paramagnetic phase using quantum Monte Carlo and analytical techniques. We find that the spin-glass susceptibility diverges at a finite temperature $T_g$ which…
Lattice protein folding models are a cornerstone of computational biophysics. Although these models are a coarse grained representation, they provide useful insight into the energy landscape of natural proteins. Finding low-energy…
The measurement of a spin-$\half$ is modeled by coupling it to an apparatus, that consists of an Ising magnetic dot coupled to a phonon bath. Features of quantum measurements are derived from the dynamical solution of the measurement,…
We propose a protocol for studying the purely imaginary Fisher zeros of the Ising model on a quantum computer. Our protocol is based on the direct relation between the partition function for purely imaginary temperature and the evolution…
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…