Solving the Max-Flow Problem on a Quantum Annealing Computer

Solving the Max-Flow Problem on a Quantum Annealing Computer

This article addresses the question of implementing a maximum flow algorithm on directed graphs in a formulation suitable for a quantum annealing computer. Three distinct approaches are presented. In all three cases, the flow problem is formulated as a quadratic unconstrained binary optimization (QU...

Full description

Bibliographic Details
Main Authors: Thomas Krauss, Joey McCollum, Chapman Pendery, Sierra Litwin, Alan J. Michaels
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Transactions on Quantum Engineering
Subjects:
Maximum flow problem
minimum cut problem
quantum annealing
quantum computing
simulated annealing
Online Access:https://ieeexplore.ieee.org/document/9224181/

Internet

https://ieeexplore.ieee.org/document/9224181/

Similar Items