Quantum Floyd-Warshall Alorithm
A. S. Gupta, A. Pathak
Abstract
Classical Floyd-Warshall algorithm is used to solve all-pairs shortest path problem on a directed graph. The classical algorithm runs in O (V3) time where V represents the number of nodes. Here we have modified the algorithm and proposed a quantum algorithm analogous to Floyd-Warshall algorithm which exploits the superposition principle and runs in O (Vlog2V) time.
Create a lesson
Related papers
An entangling Hubbard quasiparticle collider on a digital quantum processor
Chan Bin Bark, Hanbyul Kim, Yoonil Koo et al.
A Warped Born Rule Turns an Observer into a Maxwell's Demon
Olumakinde Ogunnaike
A scalable sample-based quantum diagonalization solver for general Pauli-sum Hamiltonians
Yutaro Iiyama
Quantum Query Complexity of Maximum Degree and its Generalizations
Amin Shiraz Gilani, Nikhil S. Mande, Subhasree Patro et al.
Maximally antiflat fixed-particle-number fermionic states
Rahul Gupta, Arya Haghighian, James D. Whitfield
An Annealing-based Quantum Neural Network with Discrete Wavelet Transforms for Enhanced Air Pollution Nowcasting
Otto Menegasso Pires, André Saimon, Daniela Herrmann et al.