Quantum computers have demonstrable ability to solve problems at a scale beyond brute-
force classical simulation. Interest in quantum algorithms has developed in many areas …

Recent advances in quantum computers are demonstrating the ability to solve problems at a
scale beyond brute force classical simulation. As such, a widespread interest in quantum …

Combinatorial optimization is a broadly attractive area for potential quantum advantage, but
no quantum algorithm has yet made the leap. Noise in quantum hardware remains a …

Quantum computing has emerged as a powerful computational paradigm capable of solving
problems beyond the reach of classical computers. However, today's quantum computers …

State-of-the-art noisy digital quantum computers can only execute short-depth quantum
circuits. Variational algorithms are a promising route to unlock the potential of noisy quantum …

We show that the quantum approximate optimization algorithm (QAOA) for higher-order,
random coefficient, heavy-hex compatible spin glass Ising models has strong parameter …

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 …

The real-time simulation of large many-body quantum systems is a formidable task, that may
only be achievable with a genuine quantum computational platform. Currently, quantum …

Combinatorial problems are formulated to find optimal designs within a fixed set of
constraints and are commonly found across diverse engineering and scientific domains …

Combinatorial optimization is a challenging problem applicable in a wide range of fields
from logistics to finance. Recently, quantum computing has been used to attempt to solve …