Hybrid Quantum-Classical Scheduling with Problem-Aware Calibration on a Quantum Annealer

• URL: http://arxiv.org/abs/2509.04808v1
• Date: Fri, 05 Sep 2025 05:08:55 GMT
• Title: Hybrid Quantum-Classical Scheduling with Problem-Aware Calibration on a Quantum Annealer
• Authors: Krzysztof Giergiel, Y. Sam Yang, Anthony B. Murphy,
• Abstract summary: We evaluate the application of quantum annealing to a real-world optimisation problem-room scheduling for sports camps.<n>We develop an improved formulation and a novel problem-aware calibration scheme.<n>Despite calibration and formulation improvements, QA performance degrades with increased connectivity and problem size.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We evaluate the application of quantum annealing (QA) to a real-world combinatorial optimisation problem-room scheduling for sports camps at the Australian Institute of Sport-using both classical and quantum approaches. Due to current hardware limitations, the full problem cannot be embedded on existing QA platforms, motivating a hybrid method combining classical heuristics with quantum subroutines. We develop an improved formulation and a novel problem-aware calibration scheme, leveraging multi-qubit statistics to enhance the annealing performance. Our results show that the optimal annealing time aligns with the coherence time of the D-Wave Advantage 2 prototype (approximately 100 ns), with longer anneals yielding poorer outcomes before slow thermal recovery. Despite calibration and formulation improvements, QA performance degrades with increased connectivity and problem size, highlighting the need for improved qubit quality and parameter precision. These findings clarify the capabilities and limitations of current QA hardware and suggest strategies for extending its practical utility through hybrid methods and informed calibration.

Related papers

• Classical Regularization in Variational Quantum Eigensolvers [0.0]
  Variational Quantum Eigensolver (VQE) objective with a quadratic penalty to the squared norm of the parameters.<n>Across all tested Hamiltonians, H2, LiH, and the Random Field Ising Model (RFIM), we observe improved performance over a broad window of the regularization strength.
  arXiv  Detail & Related papers  (2026-01-23T11:49:33Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• ZeroQAT: Your Quantization-aware Training but Efficient [53.25965863436039]
  Quantization is an effective technique to reduce the deployment cost of large language models (LLMs)<n>Existing low-bit PTQ methods suffer from accuracy degradation because their layer-wise optimization introduces cumulative error propagation and misalignment between local reconstruction objectives and downstream performance.<n>We propose ZeroQAT, a zeroth-order optimization-based QAT framework.
  arXiv  Detail & Related papers  (2025-08-21T01:18:27Z)
• i-QLS: Quantum-supported Algorithm for Least Squares Optimization in Non-Linear Regression [4.737806718785056]
  We propose an iterative quantum-assisted least squares (i-QLS) optimization method.<n>We overcome the scalability and precision limitations of prior quantum least squares approaches.<n> Experiments confirm that i-QLS enables near-term quantum hardware to perform regression tasks with improved precision and scalability.
  arXiv  Detail & Related papers  (2025-05-05T17:02:35Z)
• Post-Variational Ground State Estimation via QPE-Based Quantum Imaginary Time Evolution [0.0]
  We present the QPE-based quantum imaginary time evolution (QPE-QITE) algorithm, designed for post-variational ground state estimation.<n>Unlike variational methods, QPE-QITE employs additional ancillae to project the quantum register into low-energy eigenstates.<n>We demonstrate the capabilities of QPE-QITE by applying it to the low-autocorrelation binary sequences (LABS) problem.
  arXiv  Detail & Related papers  (2025-04-15T18:44:14Z)
• Extending quantum annealing to continuous domains: a hybrid method for quadratic programming [1.0878040851638]
  We propose Quantum Enhanced Simulated Annealing (QESA) to tackle continuous optimization problems.<n>QESA uses quantum resources without requiring discretization.<n>We show that QESA consistently outperforms classical baselines in solution quality.
  arXiv  Detail & Related papers  (2025-04-02T19:09:59Z)
• A Comparative Study of Quantum Optimization Techniques for Solving Combinatorial Optimization Benchmark Problems [4.266376725904727]
  We introduce a comprehensive benchmarking framework designed to evaluate quantum optimization techniques against well-established NP-hard problems.<n>Our framework focuses on key problem classes, including the Multi-Dimensional Knapsack Problem (MDKP), Maximum Independent Set (MIS), Quadratic Assignment Problem (QAP), and Market Share Problem (MSP)
  arXiv  Detail & Related papers  (2025-03-15T13:02:22Z)
• Compressed-sensing Lindbladian quantum tomography with trapped ions [44.99833362998488]
  Characterizing the dynamics of quantum systems is a central task for the development of quantum information processors. We propose two different improvements of Lindbladian quantum tomography (LQT) that alleviate previous shortcomings.
  arXiv  Detail & Related papers  (2024-03-12T09:58:37Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• 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)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.