Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2604.24962 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911627805196288 |
|---|---|
| author | Lefterovici, Andreea-Iulia Lelakowski, Lara Perk, Michael |
| author_facet | Lefterovici, Andreea-Iulia Lelakowski, Lara Perk, Michael |
| contents | The maximum flow problem asks to find the largest possible flow from a source to a sink in a capacitated network. It arises frequently in scheduling, project selection, and as a core subroutine in broader optimisation tasks. Classically, it can be efficiently solved using Dinic's algorithm, which repeatedly performs breadth-first search (BFS) and blocking flow computations on the graph. As a potential candidate for quantum speedups, these BFS subroutines can be naturally replaced with quantum BFS (qBFS), an instantiation of Grover's search algorithm. In this paper, we evaluate the expected performance of qBFS on standard classical datasets. These instances are too large to be solved directly on current quantum hardware, so we adopt a hybrid benchmarking approach: (i) we run a classical implementation of Dinic's algorithm and isolate the runtime of its BFS subroutines; (ii) we analytically estimate the minimum number of quantum cycles required to implement qBFS, where we use the classically logged data. Our results indicate that achieving a practical quantum advantage for realistic problem sizes would translate to quantum gate operation times surpassing physical limitations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_24962 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Use case study: benchmarking quantum breadth-first search for maximum flow problems Lefterovici, Andreea-Iulia Lelakowski, Lara Perk, Michael Quantum Physics The maximum flow problem asks to find the largest possible flow from a source to a sink in a capacitated network. It arises frequently in scheduling, project selection, and as a core subroutine in broader optimisation tasks. Classically, it can be efficiently solved using Dinic's algorithm, which repeatedly performs breadth-first search (BFS) and blocking flow computations on the graph. As a potential candidate for quantum speedups, these BFS subroutines can be naturally replaced with quantum BFS (qBFS), an instantiation of Grover's search algorithm. In this paper, we evaluate the expected performance of qBFS on standard classical datasets. These instances are too large to be solved directly on current quantum hardware, so we adopt a hybrid benchmarking approach: (i) we run a classical implementation of Dinic's algorithm and isolate the runtime of its BFS subroutines; (ii) we analytically estimate the minimum number of quantum cycles required to implement qBFS, where we use the classically logged data. Our results indicate that achieving a practical quantum advantage for realistic problem sizes would translate to quantum gate operation times surpassing physical limitations. |
| title | Use case study: benchmarking quantum breadth-first search for maximum flow problems |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2604.24962 |