The staggered quantum walk model
From MaRDI portal
Publication:265344
DOI10.1007/s11128-015-1149-zzbMath1333.81213arXiv1505.04761OpenAlexW3099805706MaRDI QIDQ265344
D. N. Gonçalves, T. D. Fernandes, Raqueline Azevedo Medeiros Santos, Renato Portugal
Publication date: 4 April 2016
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.04761
Related Items (42)
Spatial search on Johnson graphs by discrete-time quantum walk ⋮ Factoring discrete-time quantum walks on distance regular graphs into continuous-time quantum walks ⋮ Asymptotic reduced density matrix of discrete-time quantum walks ⋮ Unitary equivalent classes of one-dimensional quantum walks ⋮ Partition-based discrete-time quantum walks ⋮ Quantum walk and its application domains: a systematic review ⋮ Exact simulation of coined quantum walks with the continuous-time model ⋮ Exceptional quantum walk search on the cycle ⋮ Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs ⋮ Supersymmetry for chiral symmetric quantum walks ⋮ An infinite family of circulant graphs with perfect state transfer in discrete quantum walks ⋮ The Witten index for 1D supersymmetric quantum walks with anisotropic coins ⋮ Unitary coined discrete-time quantum walks on directed multigraphs ⋮ Implementation of quantum walks on IBM quantum computers ⋮ On the equivalence between quantum and random walks on finite graphs ⋮ Virtually Abelian quantum walks ⋮ The role of tessellation intersection in staggered quantum walks ⋮ Discrete-time semiclassical Szegedy quantum walks ⋮ Discretization of continuous-time quantum walks via the staggered model with Hamiltonians ⋮ Lackadaisical discrete-time quantum walk on Johnson graph ⋮ Zeta functions of periodic graphs derived from quantum walk ⋮ Limiting properties of stochastic quantum walks on directed graphs ⋮ Walking on vertices and edges by continuous-time quantum walk ⋮ Adjacent Vertices Can Be Hard to Find by Quantum Walks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A computational complexity comparative study of graph tessellation problems ⋮ Quantum algorithm design: techniques and applications ⋮ The spectra of the unitary matrix of an \(n\)-tessellable staggered quantum walk on a graph ⋮ A Note on the Spectral Mapping Theorem of Quantum Walk Models ⋮ 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 ⋮ Quantum walks via quantum cellular automata ⋮ Element distinctness revisited ⋮ Effective simulation of state distribution in qubit chains ⋮ The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness ⋮ Quantum walks on hypergraphs ⋮ A quantum walk induced by Hoffman graphs and its periodicity ⋮ Quantum walks on embeddings ⋮ Eigenbasis of the evolution operator of 2-tessellable quantum walks ⋮ Total tessellation cover: bounds, hardness, and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Spectral and asymptotic properties of Grover walks on crystal lattices
- Moments of coinless quantum walks on lattices
- From quantum cellular automata to quantum lattice gases
- Search via Quantum Walk
- Quantum random walks do not need a coin toss
- Quantum Walk Based Search Algorithms
- Finding Is as Easy as Detecting for Quantum Walks
- Congruent Graphs and the Connectivity of Graphs
- Search on a hypercubic lattice using a quantum random walk. II.<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math>
- Quantum walks on graphs
- Quantum Algorithms for the Triangle Problem
- Quantum Walk Algorithm for Element Distinctness
- Characterizations of derived graphs
- Quantum walks and search algorithms
This page was built for publication: The staggered quantum walk model
