From the 1 of 8 linked papers with an AI index.
8 papers · 1 filter
Polynomial Time Quantum Approximation Schemes for Constrained Optimisation
Chinonso Onah, Kristel Michielsen
When does a noisy quantum sampler yield an end-to-end polynomial-time optimization algorithm with performance guarantees? Building on finite-depth and finite-shot guarantees for Co…
Separating Geometry From Interference in Constrained Quantum Optimization
Chinonso Onah, Stuart Hadfield, Kristel Michielsen
The paper analyzes how constraint‑preserving mixing operators move quantum amplitudes in constrained optimization problems and shows that quantum advantage depends on aligning the…
Resonant false vacuum decay in two dimensions on a 4000-qubit quantum annealer
Gregor Humar, Jean-Yves Desaules, Luka PaveÅ¡iÄ +4
From cosmology to quantum matter, metastable states often decay through the nucleation and growth of competing domains, with false vacuum decay providing the paradigmatic example o…
Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations
Chinonso Onah, Kristel Michielsen
We formulate a global-position colored-permutation encoding for the capacitated vehicle routing problem. Each of the vehicles selects a disjoint partial permutation, and the su…
Large-Scale Quantum Circuit Simulation on an Exascale System for QPU Benchmarking
J. A. Montanez-Barrera, Kristel Michielsen
Recent advances in quantum computing have enabled the development of quantum processors with hundreds of qubits. However, noise continues to limit the amount of useful information…
Quantum annealing inspired algorithms for the NISQ Era
Rijul Sachdeva, Vrinda Mehta, Manpreet Singh Jattana +2
We study algorithms inspired by quantum annealing that are suited for the NISQ era. First, we analyze approximate quantum annealing (AQA), which employs a discretized annealing ans…