Discrete-time quantum walks and graph structures
From MaRDI portal
Publication:2318483
DOI10.1016/j.jcta.2019.05.003zbMath1421.82030arXiv1701.04474OpenAlexW2963671227WikidataQ127871541 ScholiaQ127871541MaRDI QIDQ2318483
Publication date: 15 August 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.04474
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41)
Related Items (8)
Unitary coined discrete-time quantum walks on directed multigraphs ⋮ A comfortable graph structure for Grover walk ⋮ Circuit implementation of discrete-time quantum walks via the shunt decomposition method ⋮ Sedentary quantum walks ⋮ Brownian-Huygens propagation: modeling wave functions with discrete particle-antiparticle random walks ⋮ Directed graph encoding in quantum computing supporting edge-failures ⋮ Quantum multi-secret sharing via trap codes and discrete quantum walks ⋮ The average search probabilities of discrete-time quantum walks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial maps
- Equivalence of Szegedy's and coined quantum walks
- Coined quantum walks lift the cospectrality of graphs and trees
- Average mixing of continuous quantum walks
- Uniform mixing on Cayley graphs
- Uniform mixing and association schemes
- A matrix representation of graphs and its spectrum as a graph invariant
- Discrete quantum walks hit exponentially faster
- QUANTUM WALKS ON GENERAL GRAPHS
- Introduction to Topological Manifolds
- Connecting Coined Quantum Walks with Szegedy's Model
- Quantum walks on graphs
- Quantum Walk Algorithm for Element Distinctness
- Quantum simulations of classical random walks and undirected graph connectivity
This page was built for publication: Discrete-time quantum walks and graph structures
