Quantum Walks Can Find a Marked Element on Any Graph.
Hari KroviFrédéric MagniezMaris OzolsJérémie RolandPublished in: Algorithmica (2016)
Keyphrases
- random walk
- weighted graph
- graph theory
- graph representation
- directed graph
- connected components
- graph structure
- graph theoretic
- graph model
- structured data
- quantum computing
- data structure
- quantum inspired
- graph databases
- stable set
- real time
- quantum computation
- directed acyclic graph
- link analysis
- bipartite graph
- graph matching
- np hard
- search engine
- information retrieval
- data mining