From quantum graphs to quantum random walks
arXiv:quant-ph/0504224 · doi:10.1007/1-4020-3949-2_6
Abstract
We give a short overview over recent developments on quantum graphs and outline the connection between general quantum graphs and so-called quantum random walks.
14 pages, 6 figures
References in corpus (8)
- Quantum random walks - an introductory overview
- A Quantum Random Walk Search Algorithm
- Exponential algorithmic speedup by quantum walk
- Semiclassical Foundation of Universality in Quantum Chaos
- Leading off-diagonal approximation for the spectral form factor for uniformly hyperbolic systems
- Universal spectral statistics in quantum graphs
- Form factor for a family of quantum graphs: An expansion to third order
- Regular quantum graphs
Cited by in corpus (15)
- Functionals of the Brownian motion, localization and metric graphs
- Quantum search algorithms on a regular lattice
- A Quantum Graph Approach to Metamaterial Design
- Quantum search algorithms on the hypercube
- Quantum walks induced by Dirichlet random walks on infinite trees
- Simple quantum graphs proposal for quantum devices
- Quantum transport in randomized quantum graphs
- A simple coin for a entangled walk
- Average scattering entropy for periodic, aperiodic and random distribution of vertices in simple quantum graphs
- Spectral properties of weighted line digraphs
- Quantum graph walks II: Quantum walks on graph coverings
- A Flux-Tunable Discrete Angular Filter
- Scattering entropies of quantum graphs with several channels
- Resonances in finitely perturbed quantum walks, resonance expansion and generic simplicity
- A discontinuity of the energy of quantum walk in impurities