Spatial search on Johnson graphs by continuous-time quantum walk
From MaRDI portal
Publication:2102297
DOI10.1007/s11128-022-03417-9OpenAlexW3192868571MaRDI QIDQ2102297
Renato Portugal, Mohamed Sabri, Hajime Tanaka
Publication date: 28 November 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.01992
Quantum computation (81P68) Random walks on graphs (05C81) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Related Items (3)
Spatial search on Johnson graphs by discrete-time quantum walk ⋮ Walking on vertices and edges by continuous-time quantum walk ⋮ The average search probabilities of discrete-time quantum walks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance-regular graphs
- Discrete-time quantum walk search on Johnson graphs
- Quantum walk search on Johnson graphs
- Exponential algorithmic speedup by a quantum walk
- CONTINUOUS-TIME QUANTUM WALKS ON TREES IN QUANTUM PROBABILITY THEORY
- Exponential Operators and Parameter Differentiation in Quantum Physics
This page was built for publication: Spatial search on Johnson graphs by continuous-time quantum walk