Quantum walks and their algorithmic applications

Andris Ambainis

Quantum walks and their algorithmic applications

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0403120 v3 pith:GJDFGE74 submitted 2004-03-16 quant-ph cs.DS

Andris Ambainis This is my paper

classification quant-phcs.DS

keywords quantumwalksalgorithmicapplicationsarticlebriefchainscounterparts

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

Lazy Quantum Walks with Native Multiqubit Gates
quant-ph 2025-11 unverdicted novelty 4.0 of 10

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.

Pith tools