Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model
From MaRDI portal
Publication:291465
DOI10.1007/s11128-015-1230-7zbMath1338.81143arXiv1509.08852OpenAlexW3125790998MaRDI QIDQ291465
Publication date: 10 June 2016
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.08852
quantum walkscoined quantum walkequivalence among quantum walksstaggered quantum walkSzegedy's quantum walk
Related Items
Transport and localization in quantum walks on a random hierarchy of barriers, Partition-based discrete-time quantum walks, Exact simulation of coined quantum walks with the continuous-time model, Phase measurement of quantum walks: application to structure theorem of the positive support of the Grover walk, Szegedy quantum walks with memory on regular graphs, The role of tessellation intersection in staggered quantum walks, Discretization of continuous-time quantum walks via the staggered model with Hamiltonians, Equivalence of Szegedy's and coined quantum walks, Quantum walks induced by Dirichlet random walks on infinite trees, The spectra of the unitary matrix of an \(n\)-tessellable staggered quantum walk on a graph, Connecting Coined Quantum Walks with Szegedy's Model, The spectral analysis of the unitary matrix of a 2-tessellable staggered quantum walk on a graph, Szegedy's quantum walk with queries, Element distinctness revisited, Effective simulation of state distribution in qubit chains, A quantum walk induced by Hoffman graphs and its periodicity
Cites Work
- Unnamed Item
- Quantum walks can find a marked element on any graph
- Quantum walks on a circle with optomechanical systems
- From quantum cellular automata to quantum lattice gases
- Quantum walks: a comprehensive review
- Quantum random walks in one dimension
- Spatial quantum search in a triangular network
- Search via Quantum Walk
- Spatial search on a honeycomb network
- Quantum random walks do not need a coin toss
- Finding Is as Easy as Detecting for Quantum Walks
- Faster quantum-walk algorithm for the two-dimensional spatial search
- Quantum walks on graphs
- Quantum Walks
- Quantum Algorithms for the Triangle Problem
- Decoherence in quantum walks – a review
- Quantum Walk Algorithm for Element Distinctness
- Quantum walks and search algorithms
