Related papers: Quantum Optimization of Fully-Connected Spin Glass…
We develop a simple method to study the high temperature, or high external field, behavior of the Sherrington-Kirkpatrick mean field spin glass model. The basic idea is to couple two different replicas with a quadratic term, trying to push…
We consider optimization problems for complex systems in which the cost function has a multivalleyed landscape. We introduce a new class of dynamical algorithms which, using a suitable annealing procedure coupled with a balanced…
Frustrated spin-ice systems support emergent gauge fields and fractionalized quasiparticles that act as magnetic monopoles. Although artificial platforms have enabled their direct visualization, access to their quantum-coherent dynamics has…
The Closest String Problem is an NP-complete problem which appears more commonly in bioinformatics and coding theory. Less surprisingly, classical approaches have been pursued with two prominent algorithms being the genetic algorithm and…
An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single…
Advances in quantum algorithms suggest a tentative scaling advantage on certain combinatorial optimization problems. Recent work, however, has also reinforced the idea that barren plateaus render variational algorithms ineffective on large…
Spin glass models involving multiple replicas with constrained overlaps have been studied in [FPV92; PT07; Pan18a]. For the spherical versions of these models [Ko19; Ko20] showed that the limiting free energy is given by a Parisi type…
In a recent study (Ref. [1]), quantum annealing was reported to exhibit a scaling advantage for approximately solving Quadratic Unconstrained Binary Optimization (QUBO). However, this claim critically depends on the choice of classical…
In this work, we address the question of how a closed quantum system thermalises in the presence of a random external potential. By investigating the quench dynamics of the isolated quantum spherical $p$-spin model, a paradigmatic model of…
Quantum annealing aims at solving optimization problems efficiently by preparing the ground state of an Ising spin-Hamiltonian quantum mechanically. A prerequisite of building a quantum annealer is the implementation of programmable…
We devise a deterministic algorithm to efficiently sample high-quality solutions of certain spin-glass systems that encode hard optimization problems. We employ tensor networks to represent the Gibbs distribution of all possible…
We study in detail the quantum Sherrington-Kirkpatrick (SK) model, i.e. the infinite-range Ising spin glass in a transverse field, by solving numerically the effective one-dimensional model that the quantum SK model can be mapped to in the…
In an effort to overcome the limitations of random spin-glass benchmarks for quantum annealers, focus has shifted to carefully-crafted gadget-based problems whose logical structure has typically a planar topology. Recent experiments on…
Replica symmetry breaking (RSB) underlies the complex organization of disordered systems, yet quantitative validation beyond $N \sim 100$ spins has remained computationally challenging. We use quantum annealing to access ground states of…
We analyze the replica-symmetry-breaking construction in the Sherrington-Kirkpatrick model of a spin glass. We present a general scheme for deriving an exact asymptotic behavior near the critical temperature of the solution with an…
State-of-the-art classical optimization solvers set a high bar for quantum computers to deliver utility in this domain. Here, we introduce a quantum preconditioning approach based on the quantum approximate optimization algorithm. It…
The first quantum computers are expected to perform well at quadratic optimisation problems. In this paper a quadratic problem in finance is taken, the Portfolio Optimisation problem. Here, a set of assets is chosen for investment, such…
We demonstrate that a quantum annealer can be used to solve the NP-complete problem of graph partitioning into subgraphs containing Hamiltonian cycles of constrained length. We present a method to find a partition of a given directed graph…
A partially annealed mean-field spin-glass model with a locally embedded pattern is studied. The model consists of two dynamical variables, spins and interactions, that are in contact with thermal baths at temperatures T_S and T_J,…
We discuss the Sherrington-Kirkpatrick mean-field version of a spin glass within the distributional zeta-function method (DZFM). In the DZFM, since the dominant contribution to the average free energy is written as a series of moments of…