Graph identification by quantum walks

2007/01/08 by Jingbo Wang, Wang, J. B., B. L. Douglas +1
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum and electron transport phenomena

paper · pdf · doi:10.48550/arxiv.quant-ph/0701033

openalex publication_date 2007/01/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper has been withdrawn by the authors; replaced by arXiv:0705.2531v2 [quant-ph].

Citations

• Quantum computation and decision trees
• Exponential algorithmic speedup by a quantum walk
• Electromagnetically induced transparency: Optics in coherent media

Related

• Quantum Walks, Feynman Propagators and Graph Topology on an IBM Quantum Computer
• Quantum walk search algorithms and effective resistance
• Scoring Anomalous Vertices Through Quantum Walks
• Sensitivity of quantum walk to phase reversal and geometric perturbations: an exploration in complete graphs
• Discrete-Time Quantum Walks: A Quantum Advantage for Graph Representation