Related papers: Quantum Annealing Algorithms for Estimating Ising …
A bit-quantum map relates probabilistic information for Ising spins or classical bits to quantum spins or qubits. Quantum systems are subsystems of classical statistical systems. The Ising spins can represent macroscopic two-level…
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…
We present a general error-correcting scheme for quantum annealing that allows for the encoding of a logical qubit into an arbitrarily large number of physical qubits. Given any Ising model optimization problem, the encoding replaces each…
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 rotational and fine structure of open-shell molecules in a $\Sigma$ electronic state gives rise to crossings between Zeeman states of different parity. These crossings become avoided in the presence of an electric field. We propose an…
We investigate a stochastic approach to non-equilibrium quantum spin systems based on recent insights linking quantum and classical dynamics. Exploiting a sequence of exact transformations, quantum expectation values can be recast as…
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our work is to approximating the partition function $Z$ of a…
The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations…
Quantum annealing is a method developed to solve combinatorial optimization problems by utilizing quantum bits. Solving such problems corresponds to minimizing a cost function defined over binary variables. However, in many practical cases,…
By analyzing the characteristics of hardware-native Ising Models and their performance on current and next generation quantum annealers, we provide a framework for determining the prospect of advantage utilizing adiabatic evolution compared…
I propose a new method to study computationally difficult problems. I consider a new system, larger than the one I want to simulate. The original system is recovered by imposing constraints on the large system. I simulate the large system…
Quantum annealing solves combinatorial optimization problems by finding the energetic ground states of an embedded Hamiltonian. However, quantum annealing dynamics under the embedded Hamiltonian may violate the principles of adiabatic…
To enhance the performance of quantum annealing machines, several methods have been proposed to reduce the number of spins by fixing spin values through preprocessing. We proposed a hybrid optimization method that combines a simulated…
We demonstrate how quantum field theory problems can be embedded on quantum annealers. The general method we use is a discretisation of the field theory problem into a general Ising model, with the continuous field values being encoded into…
We consider generalized quantum Ising models, including those which could describe disordered materials or quantum annealers, and we prove that for all temperatures above a system-size independent threshold the path integral Monte Carlo…
A sampling algorithm is presented that generates spin glass configurations of the 2D Edwards-Anderson Ising spin glass at finite temperature, with probabilities proportional to their Boltzmann weights. Such an algorithm overcomes the slow…
Quantum annealers are an alternative approach to quantum computing which make use of the adiabatic theorem to efficiently find the ground state of a physically realizable Hamiltonian. Such devices are currently commercially available and…
A ferromagnetic Ising chain which is endowed with a single-spin-flip Glauber dynamics is investigated. For an arbitrary annealing protocol, we derive an exact integral equation for the domain wall density. This integral equation admits an…
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,…
In this article, we propose a novel method for sampling potential functions based on noisy observation data of a finite number of observables in quantum canonical ensembles, which leads to the accurate sampling of a wide class of test…