Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Solving hard optimization problems using quantum walks

Puya Mirkarimi, Adam Callison, Nicholas Chancellor, Viv M. Kendon

Published Mar 16, 2021• 0 citations
OpenAlex

Related papers

Quantum Optimization Problems

Tomoyuki Yamakami

arXiv:quant-ph/0204010•Lecture notes in computer science•Jan 1, 2002•4 citations

Finding spin glass ground states using quantum walks

Adam Callison, Nicholas Chancellor, Florian Mintert +1 more

Abstract Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks as a tool for finding spin glass ground states, a problem that serves as a useful model for realistic optimization problems. By performing detailed numerics, we uncover significant ways in which solving spin glass problems differs from applying quantum walks to the search problem. Importantly, unlike for the search problem, parameters such as the hopping rate of the quantum walk do not need to be set precisely for the spin glass ground state problem. Heuristic values of the hopping rate determined from the energy scales in the problem Hamiltonian are sufficient for obtaining a better quantum advantage than for search. We uncover two general mechanisms that provide the quantum advantage: matching the driver Hamiltonian to the encoding in the problem Hamiltonian, and an energy redistribution principle that ensures a quantum walk will find a lower energy state in a short timescale. This makes it practical to use quantum walks for solving hard problems, and opens the door for a range of applications on suitable quantum hardware.

arXiv:1903.05003•New Journal of Physics•Nov 28, 2019•53 citations

Quantum Algorithms for Optimization

Ansh Bansal

IOSR Journal of Computer Engineering•Oct 1, 2025•0 citations

Guided quantum walk

Sebastian Schulz, Dennis Willsch, Kristel F. L. Michielsen

We utilize the theory of local amplitude transfer (LAT) to gain insights into quantum walks (QWs) and quantum annealing (QA) beyond the adiabatic theorem. By representing the eigenspace of the problem Hamiltonian as a hypercube graph, we demonstrate that probability amplitude traverses the search space through a series of local Rabi oscillations. We argue that the amplitude movement can be systematically guided towards the ground state using a time-dependent hopping rate based solely on the problem's energy spectrum. Building upon these insights, we extend the concept of multistage QW by introducing the guided quantum walk (GQW) as a bridge between QW-like and QA-like procedures. We assess the performance of the GQW on exact cover, traveling salesperson, and garden optimization problems with 9 to 30 qubits. Our results provide evidence for the existence of optimal annealing schedules, beyond the requirement of adiabatic time evolutions. These schedules might be capable of solving large-scale combinatorial optimization problems within evolution times that scale linearly in the problem size. Published by the American Physical Society 2024

arXiv:2308.05418•Physical Review Research•Mar 21, 2024•18 citations

Quantum Algorithms for Optimization Problems

Dilnoz Muhamediyeva, Rustam Raximov, Shavkat Urokov

Lecture notes in computer science•Jul 29, 2025•1 citation

Benchmarking quantum heuristics: Nonvariational quantum-walk-based optimization algorithm for the weighted MaxCut problem

Tavis Bennett, Aidan Smith, Edric Matwiejew +1 more

We present benchmarking results for the non-variational Quantum Walk Optimisation Algorithm (non-variational QWOA) applied to the weighted maxcut problem, using classical simulations for problem sizes up to $n = 31$. The amplified quantum state, prepared using a quadratic number of alternating unitaries, achieves a constant average-case measurement probability for globally optimal solutions across these problem sizes. This behaviour contrasts with that of classical heuristics, which, for NP-hard optimisation problems, typically exhibit solve probabilities that decay as problem size increases. Performance comparisons with two local-search heuristics on the same benchmark instances suggest that the non-variational QWOA may offer a meaningful advantage by scaling more favourably with problem size. These results provide supporting evidence for the potential of this quantum heuristic to achieve quantum advantage, though further work is needed to assess whether the observed performance scaling persists at larger problem sizes, and to confirm whether similar performance trends are observed for the other problem classes to which the non-variational QWOA is designed to generalise.

arXiv:2505.24191•Physical Review A•Dec 23, 2025•3 citations
Abstract Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks as a tool for finding spin glass ground states, a problem that serves as a useful model for realistic optimization problems. By performing detailed numerics, we uncover significant ways in which solving spin glass problems differs from applying quantum walks to the search problem. Importantly, unlike for the search problem, parameters such as the hopping rate of the quantum walk do not need to be set precisely for the spin glass ground state problem. Heuristic values of the hopping rate determined from the energy scales in the problem Hamiltonian are sufficient for obtaining a better quantum advantage than for search. We uncover two general mechanisms that provide the quantum advantage: matching the driver Hamiltonian to the encoding in the problem Hamiltonian, and an energy redistribution principle that ensures a quantum walk will find a lower energy state in a short timescale. This makes it practical to use quantum walks for solving hard problems, and opens the door for a range of applications on suitable quantum hardware.
We utilize the theory of local amplitude transfer (LAT) to gain insights into quantum walks (QWs) and quantum annealing (QA) beyond the adiabatic theorem. By representing the eigenspace of the problem Hamiltonian as a hypercube graph, we demonstrate that probability amplitude traverses the search space through a series of local Rabi oscillations. We argue that the amplitude movement can be systematically guided towards the ground state using a time-dependent hopping rate based solely on the problem's energy spectrum. Building upon these insights, we extend the concept of multistage QW by introducing the guided quantum walk (GQW) as a bridge between QW-like and QA-like procedures. We assess the performance of the GQW on exact cover, traveling salesperson, and garden optimization problems with 9 to 30 qubits. Our results provide evidence for the existence of optimal annealing schedules, beyond the requirement of adiabatic time evolutions. These schedules might be capable of solving large-scale combinatorial optimization problems within evolution times that scale linearly in the problem size. Published by the American Physical Society 2024
We present benchmarking results for the non-variational Quantum Walk Optimisation Algorithm (non-variational QWOA) applied to the weighted maxcut problem, using classical simulations for problem sizes up to n=31n = 31n=31. The amplified quantum state, prepared using a quadratic number of alternating unitaries, achieves a constant average-case measurement probability for globally optimal solutions across these problem sizes. This behaviour contrasts with that of classical heuristics, which, for NP-hard optimisation problems, typically exhibit solve probabilities that decay as problem size increases. Performance comparisons with two local-search heuristics on the same benchmark instances suggest that the non-variational QWOA may offer a meaningful advantage by scaling more favourably with problem size. These results provide supporting evidence for the potential of this quantum heuristic to achieve quantum advantage, though further work is needed to assess whether the observed performance scaling persists at larger problem sizes, and to confirm whether similar performance trends are observed for the other problem classes to which the non-variational QWOA is designed to generalise.