Finding Is as Easy as Detecting for Quantum Walks

DOI10.1007/978-3-642-14165-2_46zbMath1288.68072OpenAlexW1563058589MaRDI QIDQ3587406

Frédéric Magniez, Maris Ozols, Jérémie Roland, Hari Krovi

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/117201/4/2010-Finding-detecting-quantum-walks-arxiv.pdf

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (16)

The staggered quantum walk model ⋮ Spatial quantum search in a triangular network ⋮ Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model ⋮ Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification ⋮ Quantum walk and its application domains: a systematic review ⋮ Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term ⋮ On the hitting times of quantum versus random walks ⋮ Probability distributions for Markov chain based quantum walks ⋮ The quantum walk search algorithm: factors affecting efficiency ⋮ Decoherence in quantum Markov chains ⋮ Connecting Coined Quantum Walks with Szegedy's Model ⋮ Szegedy's quantum walk with queries ⋮ Quantum walks: a comprehensive review ⋮ Spatial search using the discrete time quantum walk ⋮ Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations ⋮ Quantum walks can find a marked element on any graph

This page was built for publication: Finding Is as Easy as Detecting for Quantum Walks