IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v31y2025i2d10.1007_s10732-025-09556-3.html
   My bibliography  Save this article

Efficient solution of the number partitioning problem on a quantum annealer: a hybrid quantum-classical decomposition approach

Author

Listed:
  • Zongji Li

    (Fraunhofer Institute for Industrial Mathematics ITWM)

  • Tobias Seidel

    (Fraunhofer Institute for Industrial Mathematics ITWM)

  • Dominik Leib

    (Fraunhofer Institute for Industrial Mathematics ITWM)

  • Michael Bortz

    (Fraunhofer Institute for Industrial Mathematics ITWM)

  • Raoul Heese

    (Fraunhofer Institute for Industrial Mathematics ITWM)

Abstract

Current quantum computers can only solve optimization problems of a very limited size. For larger problems, decomposition methods are required in which the original problem is broken down into several smaller sub-problems. These are then solved on the quantum computer and their solutions are recombined into a final solution for the original problem. Often, these decomposition methods do not take the specific problem structure into account. In this paper, we present a tailored method using a divide-and-conquer strategy to solve the 2-way Number partitioning problem (NPP) with a large number of variables. The idea is to perform a specialized decomposition into smaller NPPs, which are solved on a quantum computer, and then recombine the results into another small auxiliary NPP. Solving this auxiliary problem yields an approximate solution of the original larger problem. We experimentally verify that our method allows to solve NPPs with over a thousand variables using the D-Wave Advantage quantum annealer (Advantage_system6.4).

Suggested Citation

  • Zongji Li & Tobias Seidel & Dominik Leib & Michael Bortz & Raoul Heese, 2025. "Efficient solution of the number partitioning problem on a quantum annealer: a hybrid quantum-classical decomposition approach," Journal of Heuristics, Springer, vol. 31(2), pages 1-20, June.
    • Handle: RePEc:spr:joheur:v:31:y:2025:i:2:d:10.1007_s10732-025-09556-3
    DOI: 10.1007/s10732-025-09556-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-025-09556-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-025-09556-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:31:y:2025:i:2:d:10.1007_s10732-025-09556-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.