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

IEEE/AIAA Digital Avionics Systems Conference (DASC)

Hybrid Quantum-Classical Optimization Method for Avionics Architecture in Space Launcher

Edwin Isidory, Björn Annighöfer

Published Sep 14, 2025• 0 citations
Publisher

Abstract

This paper proposed a hybrid quantum-classical optimization method for the avionics architecture in space launcher. This method involves finding the optimal avionics architecture for the task and a device type optimization study. The primary objective is to determine the optimal number of End System Controllers (ESC), reduce cable length, weight, and cost, while also considering the overall weight and cost. The study chooses a peripheral data acquisition system because minimizing the total system weight is more important in this context. The hybrid quantum-classical approach used is called the Quantum Approximate Optimization Algorithm (QAOA). It starts by mapping the problem into a Quadratic Unconstrained Binary Optimization (QUBO) model, then converts it into an Ising and Mixing Hamiltonian, followed by circuit optimization, execution, and post-processing of the results. The results show that QAOA can produce feasible solutions by assigning tasks to the ESC based on resource needs and can determine the best ESC type among different types with various capacities, weights, and costs. This work paves the way for the potential application of hybrid quantum-classical optimization methods in solving complex combinatorial optimization problems, as current classical optimization methods struggle with these challenges. Although this work shows the potential of using hybrid quantum-classical algorithms, fully transitioning to them remains difficult. Future research will focus on a pure quantum optimization method, considering current limitations, to explore its full potential for the avionics architecture.

DOI
10.1109/dasc66011.2025.11257356

Related papers

Reducing QUBO Complexity in Drone Delivery Through Classical Feasibility Preprocessing

Silvie Illésová, Vojtěch Novák, Martin Beseda

Drone-delivery planning combines routing decisions with operational constraints such as payload capacity and limited onboard energy, resulting in combinatorial optimization problems that can become costly to encode directly in binary form. This work investigates a hybrid quantum--classical approach in which candidate drone missions are generated and evaluated classically before constructing a quadratic unconstrained binary optimization (QUBO) model for mission selection. Payload- and energy-infeasible missions are removed during preprocessing, while the reduced QUBO is solved using exact enumeration, simulated annealing (SA), and the Quantum Approximate Optimization Algorithm (QAOA), with mixed-integer linear programming (MILP) used as a classical reference. Experiments on controlled synthetic delivery instances evaluate solution quality, the effect of preprocessing, and computational scaling. Exact QUBO optimization reproduces the MILP optimum on the evaluated small instances, while SA achieves $100\%$ feasibility with a median optimality gap of $0\%$. Combined payload-and-energy preprocessing reduces the mean number of QUBO variables by $29.60\%$ and quadratic interactions by $49.20\%$, while reducing mean SA runtime by $31.26\%$. In contrast, the evaluated shallow statevector-based QAOA configuration achieves lower feasibility and is restricted to small QUBO instances. These results indicate that, in the considered setting, the main practical benefit of the hybrid architecture comes from classical feasibility preprocessing that reduces the binary search space before QUBO-based optimization.

quant-pharXiv:2610.21003•Oct 16, 2026•0 citations

Quantum Optimization for Airline Itinerary and Scheduling: A QUBO and QAOA Approach

Vaibhav V. Khedekar

Abstract Airline itinerary and scheduling represent some of the most difficult computational problems that exist in transportation. The problems require choosing the best flight routes while determining schedules and allocating resources through various constraints which include regulatory requirements and maintenance schedules and dynamic demand patterns. The solution of small and medium-scale instances has been achieved through mixed-integer programming and heuristic methods including simulated annealing and genetic algorithms and branch-and-price but these methods become impractical for larger real-world instances due to exponential scaling issues. Quantum computing has introduced fresh solutions which enable the resolution of these problems. Quantum mechanical phenomena particularly superposition and entanglement enable optimization algorithms to examine an exponentially expanded solution space simultaneously. Our research applies a basic airline scheduling problem to the Traveling Salesman Problem (TSP) before converting it into a Quadratic Unconstrained Binary Optimization (QUBO) problem. The Quantum Approximate Optimization Algorithm (QAOA) serves as a hybrid quantum-classical method to solve this formulation. The experimental evaluation of a 4-city scenario shows that quantum-based optimization generates performance levels comparable to traditional methods and indicates that improved quantum hardware development will provide computational benefits for complex airline scheduling problems. This research holds dual importance because it can minimize operational expenses and improve scheduling performance and it establishes fundamental principles for complex combinatorial problem optimization across the transportation industry. The research establishes fundamental principles for quantum-enabled applications that will revolutionize airline operations and other transportation networks by solving critical scalability and solution quality problems.

•Apr 22, 2025•0 citations

Hybrid Classical--Quantum Optimization of Wireless Routing Using QAOA and Quantum Walks

Eric Howard, Hardique Dasore, Hom Nath Dhungana +4 more

Routing in wireless communication networks is shaped by mobility, interference, congestion, and competing service requirements, making route selection a high-dimensional constrained optimization problem rather than a simple shortest-path task. This paper investigates the use of hybrid classical--quantum methods for wireless routing, focusing on the Quantum Approximate Optimization Algorithm (QAOA) and quantum walks as candidate mechanisms for exploring complex routing spaces. The paper examines how wireless routing can be expressed as a constrained graph optimization problem in which routing objectives, flow constraints, connectivity requirements, and interference effects are mapped into quantum-compatible Hamiltonian representations. It then discusses how these approaches can be integrated into a hybrid architecture in which classical systems perform network monitoring, graph construction, pre-processing, and deployment, while quantum subroutines are used for selected optimization components. The analysis shows that the potential value of quantum routing lies primarily in the treatment of difficult combinatorial subproblems rather than end-to-end replacement of classical routing frameworks. The paper also highlights practical limitations arising from state preparation, constraint encoding, oracle construction, hardware noise, limited qubit resources, and hybrid execution overhead. It is argued that any meaningful near-term advantage will depend on careful problem decomposition, compact encoding, and tight classical--quantum integration.

quant-pharXiv:2604.01250•International Journal of Intelligent Systems and Applications in Engineering•Apr 2, 2026•0 citations

Flexible integration of classical and quantum techniques in the evolutionary path to quantum utility

Prashanti Priya Angara

This dissertation addresses fundamental challenges in solving constrained combinatorial optimization problems using hybrid quantum-classical computing approaches. Quantum computing shows promise for tackling computationally intractable problems, current approaches face significant limitations. The path forward in computing involves combining quantum and classical computing approaches. Quantum processing units (QPUs) will play a key role in accelerating algorithms in optimization, simulation, and machine learning applications beyond what classical computers can achieve on their own, similar to how graphical processing units (GPUs) have become integral to general-purpose computing. The current generation of quantum devices is limited by noise and circuit depth constraints, making it challenging to gain practical utility. Hybrid quantum-classical approaches, which combine quantum computing resources with classical computing resources, are essential for addressing these limitations on near-term devices. In the area of combinatorial optimization, current practical state-of-the-art hybrid approaches are variational in nature, relying on parameterized quantum circuits to encode solutions and classical optimization techniques to find optimal parameters. While the ultimate goal of solving computationally intractable problems is to find provably optimal solutions, practical constraints of real-world scenarios often necessitate focusing on efficiently obtaining high-quality, near-optimal solutions. The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical approach for tackling these challenging problems that are encoded using quadratic and higher-order unconstrained binary optimization problems (QUBO and HUBO). QAOA alternates between two operators: a problem-specific cost Hamiltonian that encodes the optimization objective, and a mixer Hamiltonian that explores the solution space. The algorithm's parameters are iteratively optimized using classical methods to maximize the probability of sampling high-quality solutions. However, these methods often struggle with solution feasibility, especially for problems where the solutions must satisfy specific constraints. Penalty-based encodings require careful parameter tuning and risk producing infeasible solutions, while feasibility-preserving methods demand deeper quantum circuits that are challenging to implement on near-term quantum devices. In this dissertation, we present novel strategies that reduce or omit dependency on penalty parameters while maintaining solution quality, effectively capturing both optimal and near-optimal solutions, and balancing the trade-offs between circuit depth and solution feasibility. We present SCOOP, a novel QAOA-based framework for solving constrained optimization problems. SCOOP transforms a constrained problem into an unconstrained counterpart, forming SCOOP problem twins. QAOA operates on the unconstrained twin to identify potential optimal and near-optimal solutions. Effective classical post-processing reduces the solution set to the constrained problem space. Our SCOOP approach is solution-enhanced, objective-function-compatible, and scalable. We demonstrate the effectiveness of the SCOOP framework on selected NP-hard problems, some of which can be encoded quadratically (such as Minimum Vertex Cover and Maximum Independent Set), and some that can be encoded using higher-order terms (such as Minimum Dominating Set, Minimum Maximal Matching, and Minimum Set Cover). We also apply our framework to constrained combinatorial optimization problems that can be solved in polynomial time, such as Minimum Edge Cover and Maximum Matching. Experimental results on full statevector simulators and tensor network simulators show that SCOOP significantly improves the probability of finding high-quality feasible solutions across various problem classes, on problems that can be encoded quadratically as well as problems that can be encoded using higher-order terms. We also demonstrate the effectiveness of SCOOP on real quantum hardware, specifically IBM Quantum Heron R2 processors with 156 qubits, showing that SCOOP can be applied to practical problems with current quantum hardware limitations. This work makes significant contributions toward achieving quantum utility by enabling systematic investigation of constrained optimization problems on quantum devices. While current quantum computing research primarily focuses on unconstrained problems like MaxCut, real-world applications typically involve constraints. SCOOP provides a scalable framework for encoding constrained problems, extending quantum computing's practical utility beyond simple unconstrained cases. By eliminating dependency on penalty parameters and providing natural problem formulations, SCOOP makes it feasible to explore quantum solutions for constrained problems where classical exact methods become intractable. This capability is crucial for identifying promising avenues for demonstrating quantum utility across diverse constrained optimization problems, advancing the practical applicability of quantum computing approaches.

•Jan 1, 2025•0 citations

Hybrid Quantum–Classical Supercomputing Framework for Optimization Problems

Aditi Kuhar, Megha Shinde, Arti Giram +1 more

Optimization problems are widely encountered in real-world domains such as energy systems, financial markets, transportation networks, supply chain logistics, manufacturing processes, and e-commerce platforms. Traditional classical computing methods often struggle to solve large combinatorial optimization problems due to the exponential growth of the solution space. Quantum computing has emerged as a promising approach to address these challenges by leveraging quantum mechanical principles such as superposition and entanglement. However, current quantum hardware is limited by noise, restricted qubit availability, and scalability issues, making fully quantum solutions impractical for large-scale applications. To overcome these limitations, this research proposes a hybrid quantum–classical supercomputing framework for solving complex optimization problems across multiple domains. The framework integrates classical data processing and optimization techniques with quantum-inspired algorithms, specifically the Quantum Approximate Optimization Algorithm (QAOA), to efficiently explore large solution spaces. Real-world datasets from energy systems, supply chain logistics, financial markets, transportation networks, manufacturing processes, and e-commerce platforms are used for experimental evaluation. The results demonstrate that the hybrid optimization approach can generate higher-quality solutions and improved optimization accuracy compared to traditional classical methods. These findings highlight the potential of hybrid quantum–classical systems as an effective and scalable solution for solving complex optimization problems in modern computational applications.

International Journal on Advanced Computer Theory and Engineering•May 19, 2026•0 citations

Toward Quantum Combinatorial Optimization

Yunpyo Hong, Jaejoon Gill, Daeyeun Kim +3 more

The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most prominent hybrid quantum–classical algorithms for combinatorial optimization on noisy intermediate-scale quantum (NISQ) hardware. QAOA maps real-world problems into Ising or quadratic unconstrained binary optimization (QUBO) forms and alternates cost and mixer operators in a shallow parameterized circuit whose angles are tuned by a classical optimizer. This article introduces QAOA from fundamentals to practice, emphasizing why it aligns with industrial optimization through binary decision modeling and the presence of severe scaling challenges in classical optimization. We review research trends that improve expressivity and trainability, including ansatz engineering, parameter initialization, and hybrid training strategies, drawing parallels to developments in artificial intelligence. After that, we survey representative applications in emerging domains such as drug discovery, materials design, semiconductor design, logistics, and finance highlighting practical encodings and constraint-preserving formulations that keep quantum evolution within feasible subspaces beyond penalty-based methods. Finally, we present QAOA as a rapidly maturing framework with credible pathways toward near-term utility in real industrial workflows.

IEEE Nanotechnology Magazine•Jan 1, 2026•0 citations
This paper proposed a hybrid quantum-classical optimization method for the avionics architecture in space launcher. This method involves finding the optimal avionics architecture for the task and a device type optimization study. The primary objective is to determine the optimal number of End System Controllers (ESC), reduce cable length, weight, and cost, while also considering the overall weight and cost. The study chooses a peripheral data acquisition system because minimizing the total system weight is more important in this context. The hybrid quantum-classical approach used is called the Quantum Approximate Optimization Algorithm (QAOA). It starts by mapping the problem into a Quadratic Unconstrained Binary Optimization (QUBO) model, then converts it into an Ising and Mixing Hamiltonian, followed by circuit optimization, execution, and post-processing of the results. The results show that QAOA can produce feasible solutions by assigning tasks to the ESC based on resource needs and can determine the best ESC type among different types with various capacities, weights, and costs. This work paves the way for the potential application of hybrid quantum-classical optimization methods in solving complex combinatorial optimization problems, as current classical optimization methods struggle with these challenges. Although this work shows the potential of using hybrid quantum-classical algorithms, fully transitioning to them remains difficult. Future research will focus on a pure quantum optimization method, considering current limitations, to explore its full potential for the avionics architecture.
Drone-delivery planning combines routing decisions with operational constraints such as payload capacity and limited onboard energy, resulting in combinatorial optimization problems that can become costly to encode directly in binary form. This work investigates a hybrid quantum--classical approach in which candidate drone missions are generated and evaluated classically before constructing a quadratic unconstrained binary optimization (QUBO) model for mission selection. Payload- and energy-infeasible missions are removed during preprocessing, while the reduced QUBO is solved using exact enumeration, simulated annealing (SA), and the Quantum Approximate Optimization Algorithm (QAOA), with mixed-integer linear programming (MILP) used as a classical reference. Experiments on controlled synthetic delivery instances evaluate solution quality, the effect of preprocessing, and computational scaling. Exact QUBO optimization reproduces the MILP optimum on the evaluated small instances, while SA achieves 100%100\%100% feasibility with a median optimality gap of 0%0\%0%. Combined payload-and-energy preprocessing reduces the mean number of QUBO variables by 29.60%29.60\%29.60% and quadratic interactions by 49.20%49.20\%49.20%, while reducing mean SA runtime by 31.26%31.26\%31.26%. In contrast, the evaluated shallow statevector-based QAOA configuration achieves lower feasibility and is restricted to small QUBO instances. These results indicate that, in the considered setting, the main practical benefit of the hybrid architecture comes from classical feasibility preprocessing that reduces the binary search space before QUBO-based optimization.
Abstract Airline itinerary and scheduling represent some of the most difficult computational problems that exist in transportation. The problems require choosing the best flight routes while determining schedules and allocating resources through various constraints which include regulatory requirements and maintenance schedules and dynamic demand patterns. The solution of small and medium-scale instances has been achieved through mixed-integer programming and heuristic methods including simulated annealing and genetic algorithms and branch-and-price but these methods become impractical for larger real-world instances due to exponential scaling issues. Quantum computing has introduced fresh solutions which enable the resolution of these problems. Quantum mechanical phenomena particularly superposition and entanglement enable optimization algorithms to examine an exponentially expanded solution space simultaneously. Our research applies a basic airline scheduling problem to the Traveling Salesman Problem (TSP) before converting it into a Quadratic Unconstrained Binary Optimization (QUBO) problem. The Quantum Approximate Optimization Algorithm (QAOA) serves as a hybrid quantum-classical method to solve this formulation. The experimental evaluation of a 4-city scenario shows that quantum-based optimization generates performance levels comparable to traditional methods and indicates that improved quantum hardware development will provide computational benefits for complex airline scheduling problems. This research holds dual importance because it can minimize operational expenses and improve scheduling performance and it establishes fundamental principles for complex combinatorial problem optimization across the transportation industry. The research establishes fundamental principles for quantum-enabled applications that will revolutionize airline operations and other transportation networks by solving critical scalability and solution quality problems.
Routing in wireless communication networks is shaped by mobility, interference, congestion, and competing service requirements, making route selection a high-dimensional constrained optimization problem rather than a simple shortest-path task. This paper investigates the use of hybrid classical--quantum methods for wireless routing, focusing on the Quantum Approximate Optimization Algorithm (QAOA) and quantum walks as candidate mechanisms for exploring complex routing spaces. The paper examines how wireless routing can be expressed as a constrained graph optimization problem in which routing objectives, flow constraints, connectivity requirements, and interference effects are mapped into quantum-compatible Hamiltonian representations. It then discusses how these approaches can be integrated into a hybrid architecture in which classical systems perform network monitoring, graph construction, pre-processing, and deployment, while quantum subroutines are used for selected optimization components. The analysis shows that the potential value of quantum routing lies primarily in the treatment of difficult combinatorial subproblems rather than end-to-end replacement of classical routing frameworks. The paper also highlights practical limitations arising from state preparation, constraint encoding, oracle construction, hardware noise, limited qubit resources, and hybrid execution overhead. It is argued that any meaningful near-term advantage will depend on careful problem decomposition, compact encoding, and tight classical--quantum integration.
This dissertation addresses fundamental challenges in solving constrained combinatorial optimization problems using hybrid quantum-classical computing approaches. Quantum computing shows promise for tackling computationally intractable problems, current approaches face significant limitations. The path forward in computing involves combining quantum and classical computing approaches. Quantum processing units (QPUs) will play a key role in accelerating algorithms in optimization, simulation, and machine learning applications beyond what classical computers can achieve on their own, similar to how graphical processing units (GPUs) have become integral to general-purpose computing. The current generation of quantum devices is limited by noise and circuit depth constraints, making it challenging to gain practical utility. Hybrid quantum-classical approaches, which combine quantum computing resources with classical computing resources, are essential for addressing these limitations on near-term devices. In the area of combinatorial optimization, current practical state-of-the-art hybrid approaches are variational in nature, relying on parameterized quantum circuits to encode solutions and classical optimization techniques to find optimal parameters. While the ultimate goal of solving computationally intractable problems is to find provably optimal solutions, practical constraints of real-world scenarios often necessitate focusing on efficiently obtaining high-quality, near-optimal solutions. The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical approach for tackling these challenging problems that are encoded using quadratic and higher-order unconstrained binary optimization problems (QUBO and HUBO). QAOA alternates between two operators: a problem-specific cost Hamiltonian that encodes the optimization objective, and a mixer Hamiltonian that explores the solution space. The algorithm's parameters are iteratively optimized using classical methods to maximize the probability of sampling high-quality solutions. However, these methods often struggle with solution feasibility, especially for problems where the solutions must satisfy specific constraints. Penalty-based encodings require careful parameter tuning and risk producing infeasible solutions, while feasibility-preserving methods demand deeper quantum circuits that are challenging to implement on near-term quantum devices. In this dissertation, we present novel strategies that reduce or omit dependency on penalty parameters while maintaining solution quality, effectively capturing both optimal and near-optimal solutions, and balancing the trade-offs between circuit depth and solution feasibility. We present SCOOP, a novel QAOA-based framework for solving constrained optimization problems. SCOOP transforms a constrained problem into an unconstrained counterpart, forming SCOOP problem twins. QAOA operates on the unconstrained twin to identify potential optimal and near-optimal solutions. Effective classical post-processing reduces the solution set to the constrained problem space. Our SCOOP approach is solution-enhanced, objective-function-compatible, and scalable. We demonstrate the effectiveness of the SCOOP framework on selected NP-hard problems, some of which can be encoded quadratically (such as Minimum Vertex Cover and Maximum Independent Set), and some that can be encoded using higher-order terms (such as Minimum Dominating Set, Minimum Maximal Matching, and Minimum Set Cover). We also apply our framework to constrained combinatorial optimization problems that can be solved in polynomial time, such as Minimum Edge Cover and Maximum Matching. Experimental results on full statevector simulators and tensor network simulators show that SCOOP significantly improves the probability of finding high-quality feasible solutions across various problem classes, on problems that can be encoded quadratically as well as problems that can be encoded using higher-order terms. We also demonstrate the effectiveness of SCOOP on real quantum hardware, specifically IBM Quantum Heron R2 processors with 156 qubits, showing that SCOOP can be applied to practical problems with current quantum hardware limitations. This work makes significant contributions toward achieving quantum utility by enabling systematic investigation of constrained optimization problems on quantum devices. While current quantum computing research primarily focuses on unconstrained problems like MaxCut, real-world applications typically involve constraints. SCOOP provides a scalable framework for encoding constrained problems, extending quantum computing's practical utility beyond simple unconstrained cases. By eliminating dependency on penalty parameters and providing natural problem formulations, SCOOP makes it feasible to explore quantum solutions for constrained problems where classical exact methods become intractable. This capability is crucial for identifying promising avenues for demonstrating quantum utility across diverse constrained optimization problems, advancing the practical applicability of quantum computing approaches.
Optimization problems are widely encountered in real-world domains such as energy systems, financial markets, transportation networks, supply chain logistics, manufacturing processes, and e-commerce platforms. Traditional classical computing methods often struggle to solve large combinatorial optimization problems due to the exponential growth of the solution space. Quantum computing has emerged as a promising approach to address these challenges by leveraging quantum mechanical principles such as superposition and entanglement. However, current quantum hardware is limited by noise, restricted qubit availability, and scalability issues, making fully quantum solutions impractical for large-scale applications. To overcome these limitations, this research proposes a hybrid quantum–classical supercomputing framework for solving complex optimization problems across multiple domains. The framework integrates classical data processing and optimization techniques with quantum-inspired algorithms, specifically the Quantum Approximate Optimization Algorithm (QAOA), to efficiently explore large solution spaces. Real-world datasets from energy systems, supply chain logistics, financial markets, transportation networks, manufacturing processes, and e-commerce platforms are used for experimental evaluation. The results demonstrate that the hybrid optimization approach can generate higher-quality solutions and improved optimization accuracy compared to traditional classical methods. These findings highlight the potential of hybrid quantum–classical systems as an effective and scalable solution for solving complex optimization problems in modern computational applications.
The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most prominent hybrid quantum–classical algorithms for combinatorial optimization on noisy intermediate-scale quantum (NISQ) hardware. QAOA maps real-world problems into Ising or quadratic unconstrained binary optimization (QUBO) forms and alternates cost and mixer operators in a shallow parameterized circuit whose angles are tuned by a classical optimizer. This article introduces QAOA from fundamentals to practice, emphasizing why it aligns with industrial optimization through binary decision modeling and the presence of severe scaling challenges in classical optimization. We review research trends that improve expressivity and trainability, including ansatz engineering, parameter initialization, and hybrid training strategies, drawing parallels to developments in artificial intelligence. After that, we survey representative applications in emerging domains such as drug discovery, materials design, semiconductor design, logistics, and finance highlighting practical encodings and constraint-preserving formulations that keep quantum evolution within feasible subspaces beyond penalty-based methods. Finally, we present QAOA as a rapidly maturing framework with credible pathways toward near-term utility in real industrial workflows.