pith. sign in

arxiv: quant-ph/0403120 · v3 · submitted 2004-03-16 · 🪐 quant-ph · cs.DS

Quantum walks and their algorithmic applications

Andris Ambainis This is my paper
classification 🪐 quant-ph cs.DS
keywords quantumwalksalgorithmicapplicationsarticlebriefchainscounterparts
0
0 comments X
read the original abstract

Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with emphasis on their algorithmic applications.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Lazy Quantum Walks with Native Multiqubit Gates

    quant-ph 2025-11 unverdicted novelty 4.0

    Simulations of small lazy quantum walks on neutral atoms show a fidelity advantage for native multiqubit Rydberg gates over decomposed two-qubit sequences at certain gate-error regimes.