Partition-based discrete-time quantum walks
DOI10.1007/s11128-017-1807-4zbMath1395.81086arXiv1707.07127OpenAlexW2962707792WikidataQ130130989 ScholiaQ130130989MaRDI QIDQ1654075
Norio Konno, Renato Portugal, Etsuo Segawa, Iwao Sato
Publication date: 7 August 2018
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.07127
bipartite graphintersection graphquantum walkunitary equivalencegraph tessellationcoined walkhypergraph walkstaggered walkSzegedy's walk
Sums of independent random variables; random walks (60G50) Quantum computation (81P68) Random walks on graphs (05C81) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Related Items (12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The staggered quantum walk model
- Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model
- Generator of an abstract quantum walk
- Unitary equivalent classes of one-dimensional quantum walks
- A remark on zeta functions of finite graphs via quantum walks
- Realistic quantum probability
- The CGMV method for quantum walks
- Gridline graphs: A review in two dimensions and an extension to higher dimensions
- Five-diagonal matrices and zeros of orthogonal polynomials on the unit circle
- Physical implementation of quantum walks
- Efficient quantum circuits for Szegedy quantum walks
- Scattering theory and discrete-time quantum walks
- A short course on topological insulators. Band structure and edge states in one and two dimensions
- Three routes to the exact asymptotics for the one-dimensional quantum walk
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- A Note on the Spectral Mapping Theorem of Quantum Walk Models
- Connecting Coined Quantum Walks with Szegedy's Model
- Quantum graph walks I: mapping to quantum walks
- Quantum walks on graphs
- Quantum Walks
This page was built for publication: Partition-based discrete-time quantum walks