Optimizing the walk coin in the quantum random walk search algorithm

DOI10.1142/s0219749923500302OpenAlexW4381167796MaRDI QIDQ6096107

Unnamed Author, Unnamed Author

Publication date: 11 September 2023

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219749923500302

zbMATH Keywords

neural networksquantum algorithmsMonte Carlo simulationsquantum random walkquantum searchsupervised machine learninggeneralized Householder reflection

Mathematics Subject Classification ID

Searching and sorting (68P10) Monte Carlo methods (65C05) Sums of independent random variables; random walks (60G50) Quantum computation (81P68) Neural nets and related approaches to inference from stochastic processes (62M45) Mathematical modeling or simulation for problems pertaining to quantum theory (81-10) Quantum gates (81P65)

Cites Work

• Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
• Quantum Algorithms for the Triangle Problem
• Quantum Walk Algorithm for Element Distinctness

This page was built for publication: Optimizing the walk coin in the quantum random walk search algorithm