Quantum speed-up of Markov chain based algorithms

DOI10.1109/FOCS.2004.53MaRDI QIDQ7255232zbMATH OpenFDO

Authors Mario Szegedy

Publication date 29 May 2026

Full work available at URL https://doi.org/10.1109/FOCS.2004.53

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(8)

• Quantum spatial best-arm identification on a complete bipartite graph
• Coined quantum walks on complex networks for quantum computers
• Multidimensional quantum walks, recursion, and quantum divide \& conquer
• On quantum solvers for linear algebraic systems
• Symmetric quantum walks on Hamming graphs and their limit distributions
• Quantum circuits for the Metropolis-Hastings algorithm
• Spectral analysis of hierarchical continuous-time quantum walks
• Unitary and open scattering quantum walks on graphs

This page was built for publication: Quantum speed-up of Markov chain based algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255232)