In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

Compared to classical search algorithms, the Grover algorithm theoretically reduces the search complexity to O (√N), providing exponential speedup when processing large-scale unordered databases.

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...