Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2601.14501 · IEEE Access

AQUA: An Agile Process to Develop Quantum Annealing Applications

Lodovica Marchesi, Amal Nasharti, Michele Marchesi

Published Jan 1, 2026• 0 citations
arXivHTMLPDF

Abstract

Quadratic unconstrained binary optimization (QUBO) is a field of operations research that is attracting growing interest due to the recent availability of quantum hardware targeted at solving QUBO problems. However, practical adoption is hindered by mathematical intricacy, hardware constraints, and a lack of sound software engineering processes for QUBO development. This work presents AQUA (Agile QUantum Annealing), an agile lifecycle for QUBO/QA development created through an industry-academia partnership between NetService S.p.A and the University of Cagliari. Using the Design Science Research (DSR) approach, AQUA customizes Scrum to the needs of QUBO/QA development, structuring work into four stages: initial assessment with formal modeling, prototype-driven algorithm selection, agile implementation, and deployment with ongoing maintenance, each gated by milestones. Validated on a real credit-scoring case, AQUA shows feasibility and offers an explicit, systematic QA engineering framework. Key contributions of our work are: a dedicated QUBO/QA software process, its creation and design using DSR approach, and its empirical validation on a simple yet real case study.

DOI
10.1109/access.2026.3728144

Related papers

Towards scalable quantum annealing for pooling and blending problems: A methodological proof-of-concept

Vasileios K. Mappas, Bogdan Dorneanu, Eduardo Nolasco +2 more

Industrial optimization challenges, such as the pooling and blending problem (PBP), require advanced computational methods to address non-convexity and scalability limitations in classical solvers. This work introduces a novel methodological framework for solving PBPs using quantum annealing (QA) that transforms the PBP into quadratic unconstrained binary optimization (QUBO) formulations at two resolution levels, enabling direct deployment on quantum annealers. Key innovations include a discretization technique tailored for PBP’s bilinear constraints and an embedding method optimized for current quantum hardware. Benchmarking against classical solvers focuses on Haverly’s classical three-stream PBP, enabling transparent comparison and development of quantum embedding and solution techniques. The proposed framework offers a scalable template for adapting similar engineering systems to quantum annealing architectures. Addressing genuine industrial-scale instances will require future advances in quantum hardware and embedding algorithms. The results demonstrate that QA exhibits the best performance among the examined alternatives, provide foundational insights towards leveraging QA in Process Systems Engineering.

Process Safety and Environmental Protection•Aug 24, 2025•2 citations

Quantum Annealing Combinatorial Optimization (QACO)

Jincheng Zhang

This paper explores the application of Quantum Annealing (QA) to the field of combinatorial optimization. The core idea is to leverage the principles of quantum mechanics, specifically quantum tunneling, to efficiently solve complex optimization problems. We present a framework for utilizing QA to tackle problems represented as quadratic unconstrained binary optimization (QUBO) models. The methodology focuses on mapping the problem's constraints and objective function into a form suitable for QA hardware. We discuss the challenges involved in this mapping process, including the limitations of current QA devices and the need for careful problem formulation. Furthermore, we analyze the potential advantages of QA over classical optimization techniques, particularly concerning the exploration of a wider solution space. The research highlights the promise of QACO as a viable approach for tackling computationally demanding combinatorial optimization tasks, offering a novel method to enhance optimization efficiency.

•Sep 3, 2026•0 citations

Quantum Annealing for Resource Allocation in Next-Generation Wireless Communication Networks: A QUBO Modeling Guide

Nguyen Xuan Tung, Le Tung Giang, Mai Dinh Cong +4 more

Quantum annealing (QA) offers a physics-inspired approach for such subproblems by mapping them onto an Ising Hamiltonian, which is algebraically equivalent to a Quadratic Unconstrained Binary Optimization (QUBO) model executable on quantum annealers or hybrid solvers. However, their practical employment in wireless systems critically depends on the specific problem formulation, on the particular variable encoding, constraint handling, solver selection, hardware embedding, and fair benchmarking. This paper develops wireless-oriented QUBO modeling guidelines for QA-assisted resource allocation. We first present a beginner-friendly toy example in which a terrestrial-aerial resource-allocation problem with a fractional signal-to-interference-plus-noise ratio (SINR) maximization objective is reformulated into a two-bit QUBO via Boolean interpolation, converted into an Ising representation, and decoded back into a wireless scheduling decision. The same scheduling is applicable to UAV, aircraft, satellite, and terrestrial links in SAGIN systems. We then review the QA foundations and solver ecosystems, including binary quadratic, discrete quadratic, constrained quadratic, and hybrid models from the perspective of NG wireless optimization. Furthermore, we discuss both binary and discrete encoding, penalty-based constraint conversion, embedding overhead, solution decoding, and feasibility verification. A QUBO Compatibility Index is introduced as a lightweight diagnostic metric for assessing the associated QUBO formulation readiness, rather than a predictor of runtime or solution quality. Finally, a case study on max-min uplink power control in cell-free massive MIMO illustrates how a fairness-oriented wireless problem can be discretized, constrained, converted into the concept of a QUBO, and evaluated against classical baselines. A host of key challenges and future directions are also discussed.

arXiv:2610.14126•IEEE Open Journal of the Communications Society•Jan 1, 2026•0 citations

Compiling Planning into Quantum Optimization Problems: A Comparative Study

Bryan O’Gorman, Eleanor Gilbert Rieffel, N. Minh +2 more

Abstract : One approach to solving planning problems is to compile them to another problem for which powerful off-the-shelf solvers are available; common targets include SAT, CSP, and MILP. Recently, a novel optimization technique has become available: quantum annealing (QA). QA takes as input problem instances encoded as Quadratic Unconstrained Binary Optimization (QUBO). Early quantum annealers are now available, and more sophisticated quantum annealers will likely be built over the next decades. Specific quantum annealing hardware implementations have specific constraints, restricting the types of QUBOs each can take as input. In this paper, we introduce the planning community to the key steps involved in compiling planning problems to quantum annealing hardware: a hardware-independent step, mapping, and a hardware-dependent step, embedding. After describing two approaches to mapping general planning problems to QUBO, we provide preliminary results from running an early quantum annealer on a parameterized family of hard planning problems. The results show that different mappings can lead to a substantial difference in performance, even when many superficial features of the resulting instances are similar. We also provide some insights gained from this early study, and suggest directions for future work.

•Jun 7, 2015•6 citations

Quantum annealing for CAD-based disassembly sequence optimization

José Azucena, Joao Paulo Jacomini Prioli

Abstract Disassembly is the core of sustainable recovery processes, enabling the reuse, remanufacturing, and recycling of end-of-life products. Disassembly Sequence Optimization (DSO) is the key to achieving practical and efficient disassembly applications in industrial scenarios. This study presents a novel approach to DSO by leveraging Quantum Annealing (QA) through Quadratic Unconstrained Binary Optimization (QUBO) and Constrained Quadratic Model (CQM) formulations integrated with CAD-based assembly designs. The proposed methods aim to address computational challenges in industrial disassembly applications. We evaluated these methods against classical heuristics using two distinct product designs. For a smaller, denser assembly, the hybrid CQM model demonstrated superior performance in terms of solution quality and computational time. Conversely, for a larger, sparser assembly, a classical heuristic achieved better results in solution quality when constraining computational time compared to the hybrid quantum approaches. The QUBO model, although did not overcome classical, showed promise in exploring solution spaces, obtaining better solution quality than CQM for the larger problem. These findings indicate that the current practical utility of quantum annealing for DSO is influenced by problem size, structure, and hybrid workflow efficiency. Future research should focus on optimizing the balance between classical and quantum resources to further enhance efficiency. As quantum hardware continues to advance, these formulations have the potential to revolutionize sustainable manufacturing by optimizing disassembly planning with greater efficiency and adaptability to large assemblies.

The International Journal of Advanced Manufacturing Technology•Dec 18, 2025•2 citations

Leveraging Non-Exact QUBO Formulation With Quantum Annealing to Optimize 5G Base Station Power Selection

Chihiro Dogo, Kazuhiro Saito, Masashi Tawada +1 more

As global energy demand continues to rise, efficient energy management is essential to support the growing integration of renewable energy in the energy mix while controlling operational costs. This paper introduces a method that leverages non-exact Quadratic Unconstrained Binary Optimization (QUBO) formulation combined with tailored post-processing to boost the optimization of the energy management problem of 5G base stations. Unlike traditional rule-based approaches, which rely heavily on domain expertise and manual design, we propose a systematic QUBO-based framework suitable for Quantum Annealing (QA). The proposed formulation significantly reduces the number of decision variables (from 1995 in an exact QUBO to approximately 144) making it compatible with current QA hardware while producing high-quality solutions. Furthermore, the post-processing steps further improve solution quality, increasing the global optimal solution achievement rate by 10–15% depending on the solver. Experimental results demonstrate that the proposed method is deployable on current hardware and achieves performance comparable to conventional rule-based systems. Such observations highlight the potential of such designs in solving real-world optimization challenges.

IEEE Access•Jan 1, 2026•0 citations
Quadratic unconstrained binary optimization (QUBO) is a field of operations research that is attracting growing interest due to the recent availability of quantum hardware targeted at solving QUBO problems. However, practical adoption is hindered by mathematical intricacy, hardware constraints, and a lack of sound software engineering processes for QUBO development. This work presents AQUA (Agile QUantum Annealing), an agile lifecycle for QUBO/QA development created through an industry-academia partnership between NetService S.p.A and the University of Cagliari. Using the Design Science Research (DSR) approach, AQUA customizes Scrum to the needs of QUBO/QA development, structuring work into four stages: initial assessment with formal modeling, prototype-driven algorithm selection, agile implementation, and deployment with ongoing maintenance, each gated by milestones. Validated on a real credit-scoring case, AQUA shows feasibility and offers an explicit, systematic QA engineering framework. Key contributions of our work are: a dedicated QUBO/QA software process, its creation and design using DSR approach, and its empirical validation on a simple yet real case study.
Industrial optimization challenges, such as the pooling and blending problem (PBP), require advanced computational methods to address non-convexity and scalability limitations in classical solvers. This work introduces a novel methodological framework for solving PBPs using quantum annealing (QA) that transforms the PBP into quadratic unconstrained binary optimization (QUBO) formulations at two resolution levels, enabling direct deployment on quantum annealers. Key innovations include a discretization technique tailored for PBP’s bilinear constraints and an embedding method optimized for current quantum hardware. Benchmarking against classical solvers focuses on Haverly’s classical three-stream PBP, enabling transparent comparison and development of quantum embedding and solution techniques. The proposed framework offers a scalable template for adapting similar engineering systems to quantum annealing architectures. Addressing genuine industrial-scale instances will require future advances in quantum hardware and embedding algorithms. The results demonstrate that QA exhibits the best performance among the examined alternatives, provide foundational insights towards leveraging QA in Process Systems Engineering.
This paper explores the application of Quantum Annealing (QA) to the field of combinatorial optimization. The core idea is to leverage the principles of quantum mechanics, specifically quantum tunneling, to efficiently solve complex optimization problems. We present a framework for utilizing QA to tackle problems represented as quadratic unconstrained binary optimization (QUBO) models. The methodology focuses on mapping the problem's constraints and objective function into a form suitable for QA hardware. We discuss the challenges involved in this mapping process, including the limitations of current QA devices and the need for careful problem formulation. Furthermore, we analyze the potential advantages of QA over classical optimization techniques, particularly concerning the exploration of a wider solution space. The research highlights the promise of QACO as a viable approach for tackling computationally demanding combinatorial optimization tasks, offering a novel method to enhance optimization efficiency.
Quantum annealing (QA) offers a physics-inspired approach for such subproblems by mapping them onto an Ising Hamiltonian, which is algebraically equivalent to a Quadratic Unconstrained Binary Optimization (QUBO) model executable on quantum annealers or hybrid solvers. However, their practical employment in wireless systems critically depends on the specific problem formulation, on the particular variable encoding, constraint handling, solver selection, hardware embedding, and fair benchmarking. This paper develops wireless-oriented QUBO modeling guidelines for QA-assisted resource allocation. We first present a beginner-friendly toy example in which a terrestrial-aerial resource-allocation problem with a fractional signal-to-interference-plus-noise ratio (SINR) maximization objective is reformulated into a two-bit QUBO via Boolean interpolation, converted into an Ising representation, and decoded back into a wireless scheduling decision. The same scheduling is applicable to UAV, aircraft, satellite, and terrestrial links in SAGIN systems. We then review the QA foundations and solver ecosystems, including binary quadratic, discrete quadratic, constrained quadratic, and hybrid models from the perspective of NG wireless optimization. Furthermore, we discuss both binary and discrete encoding, penalty-based constraint conversion, embedding overhead, solution decoding, and feasibility verification. A QUBO Compatibility Index is introduced as a lightweight diagnostic metric for assessing the associated QUBO formulation readiness, rather than a predictor of runtime or solution quality. Finally, a case study on max-min uplink power control in cell-free massive MIMO illustrates how a fairness-oriented wireless problem can be discretized, constrained, converted into the concept of a QUBO, and evaluated against classical baselines. A host of key challenges and future directions are also discussed.
Abstract : One approach to solving planning problems is to compile them to another problem for which powerful off-the-shelf solvers are available; common targets include SAT, CSP, and MILP. Recently, a novel optimization technique has become available: quantum annealing (QA). QA takes as input problem instances encoded as Quadratic Unconstrained Binary Optimization (QUBO). Early quantum annealers are now available, and more sophisticated quantum annealers will likely be built over the next decades. Specific quantum annealing hardware implementations have specific constraints, restricting the types of QUBOs each can take as input. In this paper, we introduce the planning community to the key steps involved in compiling planning problems to quantum annealing hardware: a hardware-independent step, mapping, and a hardware-dependent step, embedding. After describing two approaches to mapping general planning problems to QUBO, we provide preliminary results from running an early quantum annealer on a parameterized family of hard planning problems. The results show that different mappings can lead to a substantial difference in performance, even when many superficial features of the resulting instances are similar. We also provide some insights gained from this early study, and suggest directions for future work.
Abstract Disassembly is the core of sustainable recovery processes, enabling the reuse, remanufacturing, and recycling of end-of-life products. Disassembly Sequence Optimization (DSO) is the key to achieving practical and efficient disassembly applications in industrial scenarios. This study presents a novel approach to DSO by leveraging Quantum Annealing (QA) through Quadratic Unconstrained Binary Optimization (QUBO) and Constrained Quadratic Model (CQM) formulations integrated with CAD-based assembly designs. The proposed methods aim to address computational challenges in industrial disassembly applications. We evaluated these methods against classical heuristics using two distinct product designs. For a smaller, denser assembly, the hybrid CQM model demonstrated superior performance in terms of solution quality and computational time. Conversely, for a larger, sparser assembly, a classical heuristic achieved better results in solution quality when constraining computational time compared to the hybrid quantum approaches. The QUBO model, although did not overcome classical, showed promise in exploring solution spaces, obtaining better solution quality than CQM for the larger problem. These findings indicate that the current practical utility of quantum annealing for DSO is influenced by problem size, structure, and hybrid workflow efficiency. Future research should focus on optimizing the balance between classical and quantum resources to further enhance efficiency. As quantum hardware continues to advance, these formulations have the potential to revolutionize sustainable manufacturing by optimizing disassembly planning with greater efficiency and adaptability to large assemblies.
As global energy demand continues to rise, efficient energy management is essential to support the growing integration of renewable energy in the energy mix while controlling operational costs. This paper introduces a method that leverages non-exact Quadratic Unconstrained Binary Optimization (QUBO) formulation combined with tailored post-processing to boost the optimization of the energy management problem of 5G base stations. Unlike traditional rule-based approaches, which rely heavily on domain expertise and manual design, we propose a systematic QUBO-based framework suitable for Quantum Annealing (QA). The proposed formulation significantly reduces the number of decision variables (from 1995 in an exact QUBO to approximately 144) making it compatible with current QA hardware while producing high-quality solutions. Furthermore, the post-processing steps further improve solution quality, increasing the global optimal solution achievement rate by 10–15% depending on the solver. Experimental results demonstrate that the proposed method is deployable on current hardware and achieves performance comparable to conventional rule-based systems. Such observations highlight the potential of such designs in solving real-world optimization challenges.