Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

• URL: http://arxiv.org/abs/2509.13528v1
• Date: Tue, 16 Sep 2025 20:48:53 GMT
• Title: Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
• Authors: Elijah Pelofske, Marek Rams, Andreas Bärtschi, Piotr Czarnik, Paolo Braccia, Lukasz Cincio, Stephan Eidenbenz,
• Abstract summary: We show a potentially highly efficient and scalable non-variational learning method for QAOA angle finding.<n>We study QAOA parameter transferability from small Juli problems onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models.<n>We also sample the hardware-compatible Ising models using the ensemble of fixed QAOA angles on several superconducting qubit IBM Quantum processors.
• Score: 2.8026862656811358
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters. Parameter transfer is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. We systematically study QAOA parameter transferability from small problems (16, 27 qubits) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher order terms using the Julia based QAOA simulation tool JuliQAOA to perform classical angle finding for up to 49 QAOA layers. Parameter transfer of the fixed angles is validated using a combination of full statevector, Projected Entangled Pair States, Matrix Product State, and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to unseen problem instances does not in general provide monotonically improving performance as a function of p - there are many cases where the performance temporarily decreases as a function of p - but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the 100+ qubit instances. We also sample the hardware-compatible Ising models using the ensemble of fixed QAOA angles on several superconducting qubit IBM Quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM NISQ processors up to p=5 on ibm_fez, p=9 on ibm_torino, and p=10 on ibm_pittsburgh.

Related papers

• An Optimization-Free Recursive QAOA for the Binary Paint Shop Problem [0.0]
  The Binary Paint Shop Problem (BPSP) is an optimisation problem found in manufacturing where a sequence of cars are to be painted under certain constraints while minimising the number of colour changes between cars.<n>We show that parameter transfer shows no noticeable reduction in solution quality over optimisation for QAOA and RQAOA.<n>RQAOA only requires measurements of $ZZ$-correlations instead of full statevectors, benefiting from the reverse-causal-cone feature that leads to circuits with significantly lower CNOT counts and depths.
  arXiv  Detail & Related papers  (2025-07-15T01:54:11Z)
• Universal Resources for QAOA and Quantum Annealing [41.94295877935867]
  We show the angles of a multilayer QAOA circuit converge to universal QA trajectories.<n>Errors in both QAOA circuits and QA paths act as thermal excitations in pseudo-Boltzmann probability distributions.
  arXiv  Detail & Related papers  (2025-06-03T18:00:00Z)
• Hybrid Classical-Quantum Simulation of MaxCut using QAOA-in-QAOA [0.0]
  In this work, an implementation of the QAOA2 method for the scalable solution of the MaxCut problem is presented. The limits of the Goemans-Williamson (GW) algorithm as a purely classical alternative to QAOA are investigated. Results from large-scale simulations of up to 33 qubits are presented, showing the advantage of QAOA in certain cases and the efficiency of the implementation.
  arXiv  Detail & Related papers  (2024-06-25T09:02:31Z)
• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem [8.738180371389097]
  The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem. We observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers.
  arXiv  Detail & Related papers  (2023-08-04T14:17:21Z)
• Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors [48.68474702382697]
  Vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables.
  arXiv  Detail & Related papers  (2023-06-14T13:44:35Z)
• Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization [11.445200448951072]
  Quantum alternating operator ansatz (QAOA) has a strong connection to the adiabatic algorithm. We demonstrate that the intuition from the adiabatic algorithm applies to the task of choosing the QAOA initial state.
  arXiv  Detail & Related papers  (2023-05-05T21:54:28Z)
• An Expressive Ansatz for Low-Depth Quantum Approximate Optimisation [0.23999111269325263]
  The quantum approximate optimisation algorithm (QAOA) is a hybrid quantum-classical algorithm used to approximately solve optimisation problems. While QAOA can be implemented on NISQ devices, physical limitations can limit circuit depth and decrease performance. This work introduces the eXpressive QAOA (XQAOA) that assigns more classical parameters to the ansatz to improve its performance at low depths.
  arXiv  Detail & Related papers  (2023-02-09T07:47:06Z)
• Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers [0.0]
  Quantum Alternating Operator Ansatz (QAOA) are both quantum algorithms intended for optimal solutions of optimization problems. We implement a rigorous comparison between QA on D-Wave hardware and QAOA on IBMQ hardware. We find that QA outperforms QAOA on all problem instances.
  arXiv  Detail & Related papers  (2023-01-02T04:19:46Z)
• 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)
• General Hamiltonian Representation of ML Detection Relying on the Quantum Approximate Optimization Algorithm [74.6114458993128]
  The quantum approximate optimization algorithm (QAOA) conceived for solving optimization problems can be run on the existing noisy intermediate-scale quantum (NISQ) devices. We solve the maximum likelihood (ML) detection problem for general constellations by appropriately adapting the QAOA. In particular, for an M-ary Gray-mapped quadrature amplitude modulation (MQAM) constellation, we show that the specific qubits encoding the in-phase components and those encoding the quadrature components are independent in the quantum system of interest.
  arXiv  Detail & Related papers  (2022-04-11T14:11:24Z)
• 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)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection [80.28858481461418]
  Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices. Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2021-07-11T10:56:24Z)
• Empirical performance bounds for quantum approximate optimization [0.27998963147546135]
  Quantifying performance bounds provides insight into when QAOA may be viable for solving real-world applications. We find QAOA exceeds the Goemans-Williamson approximation ratio bound for most graphs. The resulting data set is presented as a benchmark for establishing empirical bounds on QAOA performance.
  arXiv  Detail & Related papers  (2021-02-12T23:12:09Z)

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.