Use case study: benchmarking quantum breadth-first search for maximum flow problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lefterovici, Andreea-Iulia, Lelakowski, Lara, Perk, Michael
Format:	Preprint
Published:	2026
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A quantum search method for quadratic and multidimensional knapsack problems
by: Wilkening, Sören, et al.
Published: (2025)

A quantum algorithm for solving 0-1 Knapsack problems
by: Wilkening, Sören, et al.
Published: (2023)

Beyond asymptotic scaling: Comparing functional quantum linear solvers
by: Lefterovici, Andreea-Iulia, et al.
Published: (2025)

Approximate Sparse State Preparation with the Grover-Rudolph Algorithm
by: Ramacciotti, Debora, et al.
Published: (2026)

Error-mitigation aware benchmarking strategy for quantum optimization problems
by: Demarty, Marine, et al.
Published: (2026)

Experimental analysis of quantum annealers and hybrid solvers using benchmark optimization problems
by: Stogiannos, Evangelos, et al.
Published: (2022)

Fighting noise with noise: a stochastic projective quantum eigensolver
by: Filip, Maria-Andreea
Published: (2023)

Hardness-dependent quantum adiabatic schedules for the maximum-independent-set problem
by: Perseguers, Sébastien
Published: (2024)

The use of the output states generated by the broadcasting of entanglement in quantum teleportation
by: Ghiu, Iulia, et al.
Published: (2026)

A scalable quantum-enhanced greedy algorithm for maximum independent set problems
by: Wybo, Elisabeth, et al.
Published: (2026)

Performance guarantees of light-cone variational quantum algorithms for the maximum cut problem
by: Wang, Xiaoyang, et al.
Published: (2025)

Orbital-rotated Fermi-Hubbard model as a benchmarking problem for quantum chemistry with the exact solution
by: Kojima, Ryota, et al.
Published: (2024)

Finite-dimensional Lie algebras in bosonic quantum dynamics: The single-mode case
by: Heib, Tim, et al.
Published: (2025)

Constraint-oriented biased quantum search for general constrained combinatorial optimization problems
by: Wilkening, Sören
Published: (2025)

Constraint-oriented biased quantum search for linear constrained combinatorial optimization problems
by: Wilkening, Sören, et al.
Published: (2025)

Sample-efficient benchmarking of shallow all-to-all random quantum circuits
by: Bentsen, Gregory, et al.
Published: (2026)

Systematic benchmarking of quantum computers: status and recommendations
by: Lorenz, Jeanette Miriam, et al.
Published: (2025)

Generating multipartite nonlocality to benchmark quantum computers
by: Bönsel, Jan Lennart, et al.
Published: (2024)

A methodology for comparing and benchmarking quantum devices
by: Park, Jessica, et al.
Published: (2024)

In-situ benchmarking of fault-tolerant quantum circuits. I. Clifford circuits
by: Xiao, Xiao, et al.
Published: (2026)

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors
by: Cazals, Pierre, et al.
Published: (2025)

A parallel and distributed fixed-point quantum search algorithm for solving SAT problems
by: Wang, He, et al.
Published: (2026)

Beyond asymptotic reasoning: the practicalities of a quantum ground state projector based on the wall-Chebyshev expansion
by: Filip, Maria-Andreea, et al.
Published: (2025)

Photonic processor benchmarking for variational quantum process tomography
by: Galetsky, Vladlen, et al.
Published: (2025)

Distributed quantum architecture search
by: Situ, Haozhen, et al.
Published: (2024)

A QAOA approach with fake devices: A case study for the maximum cut in ring graphs
by: Rabelo, Wilson R. M., et al.
Published: (2024)

Exact bounds on quantum partial search algorithm and improving the parallel search
by: Jiang, Yan-Bo, et al.
Published: (2026)

Counting collisions in random circuit sampling for benchmarking quantum computers
by: Mari, Andrea
Published: (2023)

QuAS: Quantum Application Score for benchmarking the utility of quantum computers
by: Mesman, Koen J., et al.
Published: (2024)

Quantum vs. classical: A comprehensive benchmark study for predicting time series with variational quantum machine learning
by: Fellner, Tobias, et al.
Published: (2025)

Excited state preparation on a quantum computer through adiabatic light-matter coupling
by: Burton, Hugh G. A., et al.
Published: (2025)

Parrondo's game of quantum search based on quantum walk
by: Hosaka, Taisuke, et al.
Published: (2023)

Quantum anomaly for benchmarking quantum computing
by: Hayata, Tomoya, et al.
Published: (2026)

Adiabatic quantum unstructured search in parallel
by: Adamson, Sean A., et al.
Published: (2025)

Chemically decisive benchmarks on the path to quantum utility
by: Sundar, Srivathsan Poyyapakkam, et al.
Published: (2026)

Challenges in certifying quantum teleportation: moving beyond conventional fidelity benchmark
by: Bussandri, D. G., et al.
Published: (2024)

BenchQC -- Scalable and modular benchmarking of industrial quantum computing applications
by: Geissler, Florian, et al.
Published: (2025)

Weight-based measure of quantum memory as a universal and operational benchmark
by: Zhang, Jinghang, et al.
Published: (2025)

Experimental benchmarking of quantum state overlap estimation strategies with photonic systems
by: Zhan, Hao, et al.
Published: (2024)

A quantum unstructured search algorithm for discrete optimisation: the use case of portfolio optimisation
by: Matsakos, Titos, et al.
Published: (2025)