Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
James G. Morley (1), Nicholas Chancellor (2), Sougato Bose (1), Viv, Kendon (2) ((1) UCL, (2) Durham)

TL;DR
This paper explores hybrid adiabatic-quantum walk algorithms for quantum search on hypercube connectivity, demonstrating quadratic speedup and analyzing robustness under noise and hardware imperfections.
Contribution
It introduces a family of hybrid algorithms interpolating between adiabatic and quantum walk search, optimized for realistic hypercube connectivity and noise conditions.
Findings
Hybrid algorithms achieve quadratic speedup with optimal parameters.
Quantum walk is optimal for large, low-noise systems.
Hybrid strategies mitigate hardware and problem misspecification issues.
Abstract
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum annealing, computation by continuous-time quantum walk, and special purpose quantum simulators all use this strategy. In this work, we carry out a detailed examination of adiabatic and quantum walk implementation of the quantum search algorithm, using the more physically realistic hypercube connectivity, rather than the complete graph, for our base Hamiltonian. We calculate the optimal adiabatic schedule for the hypercube, and then interpolate between adiabatic and quantum walk searching, obtaining a family of hybrid algorithms. We show that all of these hybrid algorithms provide the quadratic quantum speed up when run with optimal parameter settings,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
