On the emerging potential of quantum annealing hardware for combinatorial optimization
Over the past decade, the usefulness of quantum annealing hardware for combinatorial
optimization has been the subject of much debate. Thus far, experimental benchmarking …
optimization has been the subject of much debate. Thus far, experimental benchmarking …
Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems
We develop a hardware-efficient ansatz for variational optimization, derived from existing
ansatzes in the literature, that parametrizes subsets of all interactions in the cost Hamiltonian …
ansatzes in the literature, that parametrizes subsets of all interactions in the cost Hamiltonian …
Lower Bounds on Ground-State Energies of Local Hamiltonians through the Renormalization Group
Given a renormalization scheme, we show how to formulate a tractable convex relaxation of
the set of feasible local density matrices of a many-body quantum system. The relaxation is …
the set of feasible local density matrices of a many-body quantum system. The relaxation is …
The coming decades of quantum simulation
Contemporary quantum technologies face major difficulties in fault tolerant quantum
computing with error correction, and focus instead on various shades of quantum simulation …
computing with error correction, and focus instead on various shades of quantum simulation …
The Moment-SOS hierarchy: Applications and related topics
JB Lasserre - Acta Numerica, 2024 - cambridge.org
The Moment-SOS hierarchy, first introduced in optimization in 2000, is based on the theory
of the S-moment problem and its dual counterpart: polynomials that are positive on S. It turns …
of the S-moment problem and its dual counterpart: polynomials that are positive on S. It turns …
Universal quantum speedup for branch-and-bound, branch-and-cut, and tree-search algorithms
S Chakrabarti, P Minssen, R Yalovetzky… - ar**
FB Maciejewski, J Biamonte, S Hadfield… - ar**}(NDAR), a heuristic meta-algorithm
for approximately solving binary optimization problems by leveraging certain types of noise …
for approximately solving binary optimization problems by leveraging certain types of noise …
A note on lower bounds to variational problems with guarantees
J Eisert - arxiv preprint arxiv:2301.06142, 2023 - arxiv.org
Variational methods play an important role in the study of quantum many body problems,
both in the flavour of classical variational principles based on tensor networks as well as of …
both in the flavour of classical variational principles based on tensor networks as well as of …
The potential of quantum annealing for rapid solution structure identification
The recent emergence of novel computational devices, such as quantum computers,
coherent Ising machines, and digital annealers presents new opportunities for hardware …
coherent Ising machines, and digital annealers presents new opportunities for hardware …
Approximate optimization, sampling, and spin-glass droplet discovery with tensor networks
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 …
spin-glass systems that encode hard optimization problems. We employ tensor networks to …