Quantum algorithm for shortest path search in directed acyclic graph

DOI10.3103/S0278641919010023zbMath1425.68124OpenAlexW2943735369WikidataQ127931984 ScholiaQ127931984MaRDI QIDQ2314214

K. R. Khadiev, L. I. Safina

Publication date: 19 July 2019

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641919010023

zbMATH Keywords

quantum algorithmsgraph theoryquery modelshortest path search

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum algorithms for matching problems
• Polynomial degree vs. quantum query complexity
• Quantum Finite Automata: A Modern Introduction
• Quantum Computation and Quantum Information
• Strict fibonacci heaps
• Quantum Algorithms for Matching and Network Flows
• Automata, Languages and Programming
• Quantum Query Complexity of Some Graph Problems