Lackadaisical discrete-time quantum walk on Johnson graph
From MaRDI portal
Publication:6197517
DOI10.1016/j.physa.2024.129495MaRDI QIDQ6197517
Meng Li, Fangjie Peng, Xiaoming Sun
Publication date: 20 March 2024
Published in: Physica A (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- The staggered quantum walk model
- Laplacian versus adjacency matrix in quantum walk search
- On the relationship between continuous- and discrete-time quantum walk
- Faster search by lackadaisical quantum walk
- On the absence of homogeneous scalar unitary cellular automata.
- Constructing quantum hash functions based on quantum walks on Johnson graphs
- Search on vertex-transitive graphs by lackadaisical quantum walk
- Universal Computation by Multiparticle Quantum Walk
- Quantum walk search on Johnson graphs
- Grover search with lackadaisical quantum walks
- Spatial search on Johnson graphs by discrete-time quantum walk
- Quadratic speedup for finding marked vertices by Quantum walks
- Quantum walks on graphs
- Graph isomorphism in quasipolynomial time [extended abstract]
- Quantum Walk Algorithm for Element Distinctness
This page was built for publication: Lackadaisical discrete-time quantum walk on Johnson graph
