Discretization of continuous-time quantum walks via the staggered model with Hamiltonians
From MaRDI portal
Publication:6191397
DOI10.1007/s11047-018-9688-8zbMath1530.81041arXiv1701.03423OpenAlexW2573866803WikidataQ114224588 ScholiaQ114224588MaRDI QIDQ6191397
Gabriel Coutinho, Renato Portugal
Publication date: 9 February 2024
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.03423
Quantum computation (81P68) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81)
Related Items
Spatial search on Johnson graphs by discrete-time quantum walk, The role of tessellation intersection in staggered quantum walks, Simplifying continuous-time quantum walks on dynamic graphs
Cites Work
- Unnamed Item
- The staggered quantum walk model
- Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model
- Perfect state transfer in cubelike graphs
- On the relationship between continuous- and discrete-time quantum walk
- State transfer on graphs
- Characterization of quantum circulant networks having perfect state transfer
- Complex Hadamard matrices, instantaneous uniform mixing and cubes
- Uniform mixing on Cayley graphs
- Uniform mixing and association schemes
- Exact simulation of coined quantum walks with the continuous-time model
- NON-UNIFORM MIXING OF QUANTUM WALK ON CYCLES
- PERFECT, EFFICIENT, STATE TRANSFER AND ITS APPLICATION AS A CONSTRUCTIVE TOOL