Calude, CSDinneen, MJLiu, Y2025-01-212025-01-212024CDMTCS Research Reports CDMTCS-579 (2024)1178-3540https://hdl.handle.net/2292/71068The Arithmetic Progression Graph Labeling is an NP-complete problem with various applications, including optimizing scheduling problems. This paper presents Quadratic Unconstrained Boolean Optimization (QUBO) solutions for the version with fixed vertex labels of this problem, then the original general problem. We use and compare standard (D-Wave Advantage and Advantage 2 Prototype) and hybrid (D-Wave Leap Hybrid Solver Service) methods to solve these problems with D-Wave quantum machines. Our experiments suggest that the hybrid methods outperform the standard ones.Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htmTechnical ReportFields of ResearchCopyright: The author(s)