Quantum walk mixing is faster than classical on periodic lattices
From MaRDI portal
Publication:6085295
DOI10.1016/j.physa.2023.129252zbMath1527.82006arXiv2309.16352OpenAlexW4387335030MaRDI QIDQ6085295
Shyam Dhamapurkar, Xiu-Hao Deng
Publication date: 7 November 2023
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2309.16352
Quantum computation (81P68) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum walks: a comprehensive review
- An example of the difference between quantum and classical random walks
- Quantum walk and its application domains: a systematic review
- Exponential algorithmic speedup by a quantum walk
- Quantum Walk Algorithm for Element Distinctness
This page was built for publication: Quantum walk mixing is faster than classical on periodic lattices