Solving Higher Order Binary Optimization Problems on NISQ Devices: Experiments and Limitations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Solving Higher Order Binary Optimization Problems on NISQ Devices: Experiments and Limitations

Abstract

With the recent availability of Noisy Intermediate-Scale Quantum devices, the potential of quantum computers to impact the field of combinatorial optimization lies in quantum variational and annealing-based methods. This paper further compares Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA) in solving Higher Order Binary Optimization (HOBO) problems. This case study considers the hypergraph partitioning problem, which is used to generate custom HOBO problems. Our experiments show that D-Wave systems quickly reach limits solving dense HOBO problems. Although the QAOA demonstrates better performance on exact simulations, noisy simulations reveal that the gate error rate should remain under 10-5 to match D-Wave systems' performance, considering equal compilation overheads for both device.
Embargoed file
Embargoed file
0 2 28
Year Month Jours
Avant la publication
Saturday, July 20, 2024
Embargoed file
Saturday, July 20, 2024
Please log in to request access to the document

Dates and versions

hal-04394545 , version 1 (15-01-2024)

Licence

Attribution

Identifiers

Cite

Valentin Gilbert, Julien Rodriguez, Stéphane Louise, Renaud Sirdey. Solving Higher Order Binary Optimization Problems on NISQ Devices: Experiments and Limitations. ICCS 2023 - 23rd International Conference on Computational Science, Jul 2023, Prague, Czech Republic. pp.224-232, ⟨10.1007/978-3-031-36030-5_18⟩. ⟨hal-04394545⟩
61 View
1 Download

Altmetric

Share

Gmail Facebook X LinkedIn More