Quantum search on simplicial complexes
From MaRDI portal
Publication:2329932
DOI10.1007/s40509-017-0144-8zbMath1423.81056arXiv1707.00156OpenAlexW2766471340MaRDI QIDQ2329932
Kaname Matsue, Etsuo Segawa, Osamu Ogurisu
Publication date: 18 October 2019
Published in: Quantum Studies: Mathematics and Foundations (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.00156
Searching and sorting (68P10) Quantum computation (81P68) Combinatorial aspects of simplicial complexes (05E45) Random walks on graphs (05C81)
Related Items (2)
Quantum search of matching on signed graphs ⋮ A quantum searching model finding one of the edges of a subgraph in a complete graph
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum walks on simplicial complexes
- Spectral and asymptotic properties of Grover walks on crystal lattices
- Realistic quantum probability
- Up and down Grover walks on simplicial complexes
- Quantum random walks in one dimension
- Spatial quantum search in a triangular network
- Spatial search on a honeycomb network
- Bulk-edge correspondence of one-dimensional quantum walks
- Quantum Walk Based Search Algorithms
- Quantum walks induced by Dirichlet random walks on infinite trees
- Topology for Computing
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- Faster quantum-walk algorithm for the two-dimensional spatial search
- Periodicity of the Discrete-time Quantum Walk on a Finite Graph
- A Note on the Spectral Mapping Theorem of Quantum Walk Models
- Connecting Coined Quantum Walks with Szegedy's Model
- Quantum Walks
- Quantum Walk Algorithm for Element Distinctness
- Quantum walks and search algorithms
This page was built for publication: Quantum search on simplicial complexes
