Quantum Walk Based Search Algorithms

DOI10.1007/978-3-540-79228-4_3zbMath1139.68338arXiv0808.0059OpenAlexW1905918643MaRDI QIDQ3502631

Miklos Santha

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0808.0059

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items

The staggered quantum walk model ⋮ Random walk quantum clustering algorithm based on space ⋮ Quantum walk and its application domains: a systematic review ⋮ Finding shortest lattice vectors faster using quantum search ⋮ A Perron-Frobenius type of theorem for quantum operations ⋮ An algorithm to factorize quantum walks into shift and coin operations ⋮ Hitting time of quantum walks with perturbation ⋮ Quantum direct communication protocols using discrete-time quantum walk ⋮ On the hitting times of quantum versus random walks ⋮ Quantum speed-up for unsupervised learning ⋮ Probability distributions for Markov chain based quantum walks ⋮ Spectral transition for random quantum walks on trees ⋮ Dynamical localization of quantum walks in random environments ⋮ Random time-dependent quantum walks ⋮ Evolutionary algorithms for quantum computers ⋮ The quantum walk search algorithm: factors affecting efficiency ⋮ Directional correlations in quantum walks with two particles ⋮ Quantum algorithm design: techniques and applications ⋮ Practical Implementation of a Quantum Backtracking Algorithm ⋮ Element distinctness revisited ⋮ Quantum key distribution with quantum walks ⋮ Models of quantum computation and quantum programming languages ⋮ Quantum walks: a comprehensive review ⋮ Dynamical localization for \(d\)-dimensional random quantum walks ⋮ Testing commutativity of a group and the power of randomization ⋮ Spatial search using the discrete time quantum walk ⋮ Correlated Markov quantum walks ⋮ Quantum walk public-key cryptographic system ⋮ Spectral properties of quantum walks on rooted binary trees ⋮ Fermionic walkers driven out of equilibrium ⋮ Квантовые атаки на итерационные блочные шифры ⋮ Exciton-mediated quantum search on a star graph ⋮ Quantum Property Testing for Bounded-Degree Graphs ⋮ Quantum walks: Schur functions meet symmetry protected topological phases ⋮ Key establishment à la Merkle in a quantum world ⋮ Lower bounds on the localisation length of balanced random quantum walks ⋮ Quantum search on simplicial complexes ⋮ An encryption protocol for NEQR images based on one-particle quantum walks on a circle ⋮ Repeated interactions in open quantum systems

Cites Work

• From quantum cellular automata to quantum lattice gases
• A probabilistic algorithm for \(k\)-SAT based on limited local search and restart
• On the absence of homogeneous scalar unitary cellular automata.
• Quantum complexity of testing group commutativity
• Quantum lower bounds for the collision and the element distinctness problems
• Quantum verification of matrix products
• Quantum algorithms revisited
• Strengths and Weaknesses of Quantum Computing
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Testing commutativity of a group and the power of randomization
• One-dimensional quantum walks
• Quantum walks on graphs
• Quantum Algorithms for the Triangle Problem
• The Quantum Query Complexity of Algebraic Properties
• Quantum Walk Algorithm for Element Distinctness
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Quantum simulations of classical random walks and undirected graph connectivity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item