Finding Is as Easy as Detecting for Quantum Walks

DOI10.1007/978-3-642-14165-2_46MaRDI QIDQ3587406zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Quantum walks can find a marked element on any graph
• Search via quantum walks with intermediate measurements
• Search via Quantum Walk
• Finding more than one path through a simple maze with a quantum walk
• A note on the search for k elements via quantum walk
• Adjacent vertices can be hard to find by quantum walks
• Adjacent vertices can be hard to find by quantum walks
• Grover search with lackadaisical quantum walks
• Faster search by lackadaisical quantum walk
• Claw finding algorithms using quantum walk

Cited in

(25)

• A note on the search for k elements via quantum walk
• Exceptional quantum walk search on the cycle
• Quantum walks: a comprehensive review
• Spatial search using the discrete time quantum walk
• On the probability of finding marked connected components using quantum walks
• A quantum searching model finding one of the edges of a subgraph in a complete graph
• Adjacent vertices can be hard to find by quantum walks
• On the hitting times of quantum versus random walks
• Decoherence in quantum Markov chains
• Quantum walks can find a marked element on any graph
• The staggered quantum walk model
• 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
• 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
• Probability distributions for Markov chain based quantum walks
• The quantum walk search algorithm: factors affecting efficiency
• On the hitting times of quantum versus random walks
• Efficient quantum walk on the grid with multiple marked elements
• Szegedy's quantum walk with queries
• Connecting coined quantum walks with Szegedy's model
• Finding more than one path through a simple maze with a quantum walk
• Quantum walks on two-dimensional grids with multiple marked locations
• The hitting time of quantum walk on 2D lattice

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

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