Scalable Quantum Optimisation using HADOF: Hamiltonian Auto-Decomposition Optimisation Framework

• URL: http://arxiv.org/abs/2510.02926v1
• Date: Fri, 03 Oct 2025 11:54:41 GMT
• Title: Scalable Quantum Optimisation using HADOF: Hamiltonian Auto-Decomposition Optimisation Framework
• Authors: Namasi G Sankar, Georgios Miliotis, Simon Caton,
• Abstract summary: Quantum Annealing (QA) and QAOA are promising quantum optimisation algorithms used for finding approximate solutions to problems on near-term NISQ systems.<n>We present the Hamiltonian Auto-Decomposition optimisation Framework (HADOF), which leverages an iterative strategy to automatically divide the Quadratic Unconstrained Binary optimisation (QUBO) Hamiltonian into sub-Hamiltonians.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum Annealing (QA) and QAOA are promising quantum optimisation algorithms used for finding approximate solutions to combinatorial problems on near-term NISQ systems. Many NP-hard problems can be reformulated as Quadratic Unconstrained Binary Optimisation (QUBO), which maps naturally onto quantum Hamiltonians. However, the limited qubit counts of current NISQ devices restrict practical deployment of such algorithms. In this study, we present the Hamiltonian Auto-Decomposition Optimisation Framework (HADOF), which leverages an iterative strategy to automatically divide the Quadratic Unconstrained Binary Optimisation (QUBO) Hamiltonian into sub-Hamiltonians which can be optimised separately using Hamiltonian based optimisers such as QAOA, QA or Simulated Annealing (SA) and aggregated into a global solution. We compare HADOF with Simulated Annealing (SA) and the CPLEX exact solver, showing scalability to problem sizes far exceeding available qubits while maintaining competitive accuracy and runtime. Furthermore, we realise HADOF for a toy problem on an IBM quantum computer, showing promise for practical applications of quantum optimisation.

Related papers

• Quantum Optimization Algorithms [1.5571090040924025]
  We motivate and discuss the Quantum Approximate Optimization Algorithm (QAOA), which can be understood as a slightly generalized version of Quantum Annealing for gate-based quantum computers.<n>An example implementation with Pennylane source code demonstrates practical application for the Maximum Cut problem.<n>We outline the Variational Quantum Eigensolver (VQE) as a generalization of the QAOA, highlighting its potential in the NISQ era and addressing challenges such as barren plateaus and ansatz design.
  arXiv  Detail & Related papers  (2025-11-15T22:53:57Z)
• Learning Feasible Quantum States for Quadratic Constrained Binary Optimization Problems [41.23247424467223]
  We develop a variational approach that creates an equal superposition of quantum states that satisfy constraints in a QCBO.<n>The resulting equal superposition can be used as an initial state for quantum algorithms that solve QUBOs/QCBOs.
  arXiv  Detail & Related papers  (2025-08-04T16:44:53Z)
• Quantum Annealing for Machine Learning: Applications in Feature Selection, Instance Selection, and Clustering [41.94295877935867]
  We implement both quantum and classical solvers to compare their effectiveness.<n>For feature selection, we propose several QUBO configurations that balance feature importance and redundancy.<n>In instance selection, we propose a few novels for instance-level importance measures that extend existing methods.<n>For clustering, we embed a classical-to-quantum pipeline, using classical clustering followed by QUBO-based medoid refinement.
  arXiv  Detail & Related papers  (2025-07-20T17:59:14Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Branch-and-bound digitized counterdiabatic quantum optimization [39.58317527488534]
  Branch-and-bound algorithms effectively solve convex optimization problems, relying on the relaxation the objective function to obtain tight lower bounds.<n>We propose a branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO) algorithm that addresses the relaxation difficulties.
  arXiv  Detail & Related papers  (2025-04-21T18:19:19Z)
• Solving Constrained Optimization Problems Using Hybrid Qubit-Qumode Quantum Devices [7.954263125127824]
  Variational Quantum Algorithms (VQAs) offer a promising approach for solving complex optimization problems on near-term quantum hardware.<n>We show how hybrid qubit-qumode quantum devices can address Quadratic Unconstrained Binary Optimization problems using the Echoed Conditional Displacement Variational Quantum Eigensolver (ECD-VQE)<n>We conclude that hybrid qubit-qumode platforms can efficiently realize variational ECD ansatze that would otherwise require deep circuits on standard qubit-based quantum computers.
  arXiv  Detail & Related papers  (2025-01-20T20:40:58Z)
• Fermionic Quantum Approximate Optimization Algorithm [11.00442581946026]
  We propose fermionic quantum approximate optimization algorithm (FQAOA) for solving optimization problems with constraints. FQAOA tackle the constrains issue by using fermion particle number preservation to intrinsically impose them throughout QAOA. We provide a systematic guideline for designing the driver Hamiltonian for a given problem Hamiltonian with constraints.
  arXiv  Detail & Related papers  (2023-01-25T18:36:58Z)
• QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum machines [81.4597482536073]
  Quantum approximate optimization algorithms (QAOAs) utilize the power of quantum machines and inherit the spirit of adiabatic evolution. We propose QAOA-in-QAOA ($textQAOA2$) to solve arbitrary large-scale MaxCut problems using quantum machines. Our method can be seamlessly embedded into other advanced strategies to enhance the capability of QAOAs in large-scale optimization problems.
  arXiv  Detail & Related papers  (2022-05-24T03:49:10Z)
• Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization [44.96576908957141]
  We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
  arXiv  Detail & Related papers  (2022-03-23T18:00:03Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Digitized-Counterdiabatic Quantum Optimization [4.336065967298193]
  We propose digitized-diabatic quantum optimization (DCQO) to achieve enhancement over adiabatic quantum optimization for the general Ising spin-glass model. This is accomplished via the digitization of adiabatic quantum algorithms that are catalysed by the addition of non-stoquastic counterdiabatic terms.
  arXiv  Detail & Related papers  (2022-01-03T18:21:54Z)
• Efficient Classical Computation of Quantum Mean Values for Shallow QAOA Circuits [15.279642278652654]
  We present a novel graph decomposition based classical algorithm that scales linearly with the number of qubits for the shallow QAOA circuits. Our results are not only important for the exploration of quantum advantages with QAOA, but also useful for the benchmarking of NISQ processors.
  arXiv  Detail & Related papers  (2021-12-21T12:41:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.