Related papers: Quantum Optimization of Fully-Connected Spin Glass…
We discuss an Ising spin glass where each $S=1/2$ spin is coupled antiferromagnetically to three other spins (3-regular graphs). Inducing quantum fluctuations by a time-dependent transverse field, we use out-of-equilibrium quantum Monte…
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…
Quantum optimization solvers typically rely on one-variable-to-one-qubit mapping. However, the low qubit count on current quantum computers is a major obstacle in competing against classical methods. Here, we develop a qubit-efficient…
The recent availability of quantum annealers has fueled a new area of information technology where such devices are applied to address practically motivated and computationally difficult problems with hardware that exploits quantum…
A generalization of the Sherrington-Kirkpatrick (SK) model for spin glasses is considered, in which the interaction matrix is endowed with a variance profile that has no particular structure an may be sparse. In the first part of this…
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 discuss quantum annealing of the two-dimensional transverse-field Ising model on a D-Wave device, encoded on $L \times L$ lattices with $L \le 32$. Analyzing the residual energy and deviation from maximal magnetization in the final…
Quantum computers promise a qualitative speedup in solving a broad spectrum of practical optimization problems. The latter can be mapped onto the task of finding low-energy states of spin glasses, which is known to be exceedingly difficult.…
Optimal parameter setting for applications problems embedded into hardware graphs is key to practical quantum annealers (QA). Embedding chains typically crop up as harmful Griffiths phases, but can be used as a resource as we show here: to…
Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits of the quantum chip, from which a solution is obtained after…
The real-time flux dynamics of up to three superconducting quantum interference devices (SQUIDs) are studied by numerically solving the time-dependent Schr\"odinger equation. The numerical results are used to scrutinize the mapping of the…
Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that play an important role in networking, computational biology, and biochemistry. We show an explicit construction…
The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techniques. However, it is unclear if the current state of…
For large but finite systems the static properties of the infinite ranged Sherrington-Kirkpatrick model are numerically investigated in the entire the glass regime. The approach is based on the modified Thouless-Anderson-Palmer equations in…
In this paper we study the properties of the quenched pressure of a multi-layer spin-glass model (a deep Boltzmann Machine in artificial intelligence jargon) whose pairwise interactions are allowed between spins lying in adjacent layers and…
We study a multi-species spin glass system where the density of each species is kept fixed at increasing volumes. The model reduces to the Sherrington-Kirkpatrick one for the single species case. The existence of the thermodynamic limit is…
In this work, we explore graph partitioning (GP) using quantum annealing on the D-Wave 2X machine. Motivated by a recently proposed graph-based electronic structure theory applied to quantum molecular dynamics (QMD) simulations, graph…
Quantum annealers are emerging as programmable, dynamical experimental platforms for probing strongly correlated spin systems. Yet key thermal assumptions, chiefly a Gibbs-distributed output ensemble, remain unverified in the large-scale…
The spread of intelligent transportation systems in urban cities has caused heavy computational loads, requiring a novel architecture for managing large-scale traffic. In this study, we develop a method for globally controlling traffic…
Adiabatic quantum computing has evolved in recent years from a theoretical field into an immensely practical area, a change partially sparked by D-Wave System's quantum annealing hardware. These multimillion-dollar quantum annealers offer…