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

From FEM Modelling to Quantum Approximate Optimization Algorithm-Based Sensor Placement in Warren Trusses

Matteo Hirschmann

Published Jan 1, 2026• 0 citations
Publisher

Abstract

Optimal sensor placement in civil structures is a combinatorial optimization problem. A small set of informative sensor locations must be selected from many possible measurement degrees of freedom. This paper combines a finite element evaluation (FEM) based on modal strain energy with a quadratic unconstrained binary optimization (QUBO) formulation. Solution paths based on the Quantum Approximate Optimization Algorithm (QAOA) are evaluated with multiple classical optimizers and compared with an exact reference calculation. The analysis focuses on the mechanical meaning of the objective function, the fixed sensor-number constraint, the influence of classical optimization, and the scaling from a small validation model to a larger Warren truss. The results show that reliable QAOA-based sensor placement depends on the combined treatment of objective function, constraint handling, mixer choice, circuit depth, and optimizer stability.

DOI
10.18453/rosdok_id00005858

Related papers

Neural surrogate–driven constrained binary optimization for sensor placement in anomaly detection for hydrogen transport networks

Andrea Senese, Saverio De Vito, Elena Esposito +2 more

In recent years, the increasing adoption of distributed sensing systems and Internet of Things (IoT) technologies has enabled denser monitoring infrastructures in industrial and safety-critical environments. In this context, sensor placement in hydrogen transport networks represents a combinatorial optimization problem that affects the information available for anomaly monitoring while being subject to deployment constraints. To address this problem, we propose a formulation based on Quadratic Unconstrained Binary Optimization (QUBO), in which the energy function is constructed from changes in the reconstruction loss of a neural autoencoder. These changes are measured when individual pressure sensors or sensor pairs are added to a fixed set of mass-flow sensors. Individual and pairwise terms encode measured sensor effects in the quadratic objective. The number of selected sensors is controlled through an energy penalty that discourages configurations whose cardinality deviates from a predefined target, rather than through a hard constraint. The resulting QUBO is mapped to the Quantum Approximate Optimization Algorithm (QAOA) using a variational quantum circuit with alternating cost and mixer layers. Its parameters are optimized through evolutionary search followed by local refinement via a memetic strategy. The experimental analysis compares this approach with classical and exact methods on the same QUBO and examines how faithfully the pairwise objective represents larger sensor configurations and downstream anomaly-detection outcomes. At a target of five pressure sensors, QAOA returned cardinality-feasible configurations in 7/25, 16/25, and 14/25 runs for Gestdown, Gestcenter, and Gestup, respectively, compared with 25/25 runs for each classical baseline in all three topologies.

Applied Soft Computing•Nov 1, 2026•0 citations

An Introduction to the Quantum Approximate Optimization Algorithm

Alessandro Giovagnoli

The Quantum Approximate Optimization Algorithm (QAOA) is a promising variational quantum algorithm introduced to tackle classically intractable combinatorial optimization problems. This tutorial offers a comprehensive, first-principles introduction to QAOA and its properties, focusing on its application to Quadratic and Polynomial Unconstrained Binary Optimization (QUBO and PUBO) problems. The tutorial begins by outlining variational quantum circuits and QUBO problems, focusing on their key properties and the encoding of problem constraints through quadratic penalty terms. Next, it explores the QAOA in detail, covering its Hamiltonian formulation, gate decomposition, and example applications, along with their implementation and performance results. This is followed by an analysis of the algorithm's energy landscape, where proofs are provided for its symmetry and periodicity, and where a resulting parameter space reduction is proposed. Finally, the tutorial extends these concepts to PUBO problems by generalizing the results to higher-order Hamiltonians and discussing the associated symmetries and circuit construction.

quant-pharXiv:2511.18377•Nov 25, 2025•3 citations

Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling

Grange, Camille, Marion Lavignac, Valentina Pozzoli +1 more

Quantum Approximate Optimization Algorithm (QAOA) is one of the most short-term promising quantum-classical algorithm to solve unconstrained combinatorial optimization problems. It alternates between the execution of a parametrized quantum circuit and a classical optimization. There are numerous levers for enhancing QAOA performances, such as the choice of quantum circuit meta-parameters or the choice of the classical optimizer. In this paper, we stress on the importance of the input problem formulation by illustrating it with the resolution of an industrial railway timetabling problem. Specifically, we present a generic method to reformulate any polynomial problem into a Polynomial Unconstrained Binary Optimization (PUBO) problem, with a specific formulation imposing penalty terms to take binary values when the constraints are linear. We also provide a generic reformulation into a Quadratic Unconstrained Binary Optimization (QUBO) problem. We then conduct a numerical comparison between the PUBO with binary penalty terms and the QUBO formulations proposed on a railway timetabling problem solved with QAOA. Our results illustrate that the PUBO reformulation outperforms the QUBO one for the problem at hand.

arXiv:2411.10062•Nov 15, 2024•4 citations

Noise-Adaptive QAOA with Standardized Validation for Small-Scale Engineering Job-Shop Scheduling

Sohag Chakma Ud. Chowdhury

Efficient Job-Shop Scheduling (JSS) is still a challenging combinatorial optimisation problem in engineering systems because of machine-capacity constraints, operation precedence requirements and the exponential growth of the search space for the scheduling problem. The Quantum Approximate Optimization Algorithm (QAOA) has been shown to be a promising approach to solving these optimisation problems, however, when using realistic quantum noise models, the scheduling quality and reliability of the solution can be compromised. This work presents a noise-adaptive QAOA framework that automatically scales the number of shots measured, the classical optimiser, and the circuit depth, informed by an estimated quantum-noise level, and adaptively uses different error mitigation strategies. The scheduling problem is then formulated as a Quadratic Unconstrained Binary Optimisation (QUBO) problem and tested with small-scale engineering benchmark instances, under various simulated noise circumstances. Comparative simulation results show that the proposed adaptive strategy is able to keep the optimality gap low and feasible-solution rate high in every instance, and achieve competitive scheduling performance as compared to a fixed-depth noisy QAOA. The study shows how the adaptive selection of quantum parameters can enhance the robustness of QAOA for small systems of engineering scheduling problems in the presence of noisy quantum devices.

Electronics, Communications, and Computing Summit•Sep 3, 2026•0 citations

An efficient Quantum Approximate Optimization Algorithm with fixed linear ramp schedule for truss structure optimization

Junsen Xiao, Naruethep Sukulthanasorn, Reika Nomura +2 more

Abstract This study proposes a novel structural optimization framework based on quantum variational circuits, in which the multiplier acting on the cross-sectional area of each rod in a truss structure as an updater is used as a design variable. Specifically, we employ a classical processor for structural analysis with the finite element method, and the Quantum Approximate Optimization Algorithm (QAOA) is subsequently performed to update the cross-sectional area so that the compliance is minimized. The advantages of this framework can be seen in three key aspects. First, by defining design variables as multipliers, rather than simply reducing the design variable to a binary candidate of inclusion or exclusion (corresponding to qubit states, “0” and “1”), it provides greater flexibility in adjusting the cross-sectional area of the rod at each iteration of the optimization process. Second, the multipliers acting on rods are encoded with on-off encoding, eliminating additional constraints in the convergence judgement. As a result, the objective function is in a simple format, enabling efficient optimization using QAOA. Third, a fixed linear ramp schedule (FLRS) for variational parameter setting bypasses the classical optimization process, thereby improving the operational efficiency of the framework. In the two structural cases investigated in this study, the proposed approach highlights the feasibility and applicability potential of quantum computing in advancing engineering design and optimization. Numerical experiments have demonstrated the effectiveness of this framework, providing a firm foundation for future research on quantum-assisted optimization methods in engineering fields.

arXiv:2502.16769•Advanced Modeling and Simulation in Engineering Sciences•Jun 18, 2025•12 citations

Applying the Quantum Approximate Optimization Algorithm to the UAV Collision Avoidance Problem

Kalleb C. Santos, Maria Eduarda W. M. Vianna, Mateus K. de Oliveira +4 more

The increasing availability of quantum hardware has stimulated interest in applying quantum algorithms to combinatorial optimization problems. Collision avoidance for unmanned aerial vehicles (UAVs) is one such challenge due to the computational complexity of coordinating multiple agents in shared airspace. In this paper, we formulate the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model that captures route selection and collision constraints, enabling the use of the Quantum Approximate Optimization Algorithm (QAOA). To improve efficiency, we introduce a constrained QAOA Ansatz employing an XY-mixer that preserves one-hot route assignment constraints and restricts the search space to valid solutions. We evaluate the approach through noiseless simulations and device-based noise models, analyzing its behavior under realistic conditions and highlighting the opportunities and limitations of near-term quantum hardware for multi-agent routing problems.

Simpósio Brasileiro de Computação e Comunicação Quânticas (SBCCQ)•Jul 19, 2026•0 citations
Optimal sensor placement in civil structures is a combinatorial optimization problem. A small set of informative sensor locations must be selected from many possible measurement degrees of freedom. This paper combines a finite element evaluation (FEM) based on modal strain energy with a quadratic unconstrained binary optimization (QUBO) formulation. Solution paths based on the Quantum Approximate Optimization Algorithm (QAOA) are evaluated with multiple classical optimizers and compared with an exact reference calculation. The analysis focuses on the mechanical meaning of the objective function, the fixed sensor-number constraint, the influence of classical optimization, and the scaling from a small validation model to a larger Warren truss. The results show that reliable QAOA-based sensor placement depends on the combined treatment of objective function, constraint handling, mixer choice, circuit depth, and optimizer stability.
In recent years, the increasing adoption of distributed sensing systems and Internet of Things (IoT) technologies has enabled denser monitoring infrastructures in industrial and safety-critical environments. In this context, sensor placement in hydrogen transport networks represents a combinatorial optimization problem that affects the information available for anomaly monitoring while being subject to deployment constraints. To address this problem, we propose a formulation based on Quadratic Unconstrained Binary Optimization (QUBO), in which the energy function is constructed from changes in the reconstruction loss of a neural autoencoder. These changes are measured when individual pressure sensors or sensor pairs are added to a fixed set of mass-flow sensors. Individual and pairwise terms encode measured sensor effects in the quadratic objective. The number of selected sensors is controlled through an energy penalty that discourages configurations whose cardinality deviates from a predefined target, rather than through a hard constraint. The resulting QUBO is mapped to the Quantum Approximate Optimization Algorithm (QAOA) using a variational quantum circuit with alternating cost and mixer layers. Its parameters are optimized through evolutionary search followed by local refinement via a memetic strategy. The experimental analysis compares this approach with classical and exact methods on the same QUBO and examines how faithfully the pairwise objective represents larger sensor configurations and downstream anomaly-detection outcomes. At a target of five pressure sensors, QAOA returned cardinality-feasible configurations in 7/25, 16/25, and 14/25 runs for Gestdown, Gestcenter, and Gestup, respectively, compared with 25/25 runs for each classical baseline in all three topologies.
The Quantum Approximate Optimization Algorithm (QAOA) is a promising variational quantum algorithm introduced to tackle classically intractable combinatorial optimization problems. This tutorial offers a comprehensive, first-principles introduction to QAOA and its properties, focusing on its application to Quadratic and Polynomial Unconstrained Binary Optimization (QUBO and PUBO) problems. The tutorial begins by outlining variational quantum circuits and QUBO problems, focusing on their key properties and the encoding of problem constraints through quadratic penalty terms. Next, it explores the QAOA in detail, covering its Hamiltonian formulation, gate decomposition, and example applications, along with their implementation and performance results. This is followed by an analysis of the algorithm's energy landscape, where proofs are provided for its symmetry and periodicity, and where a resulting parameter space reduction is proposed. Finally, the tutorial extends these concepts to PUBO problems by generalizing the results to higher-order Hamiltonians and discussing the associated symmetries and circuit construction.
Quantum Approximate Optimization Algorithm (QAOA) is one of the most short-term promising quantum-classical algorithm to solve unconstrained combinatorial optimization problems. It alternates between the execution of a parametrized quantum circuit and a classical optimization. There are numerous levers for enhancing QAOA performances, such as the choice of quantum circuit meta-parameters or the choice of the classical optimizer. In this paper, we stress on the importance of the input problem formulation by illustrating it with the resolution of an industrial railway timetabling problem. Specifically, we present a generic method to reformulate any polynomial problem into a Polynomial Unconstrained Binary Optimization (PUBO) problem, with a specific formulation imposing penalty terms to take binary values when the constraints are linear. We also provide a generic reformulation into a Quadratic Unconstrained Binary Optimization (QUBO) problem. We then conduct a numerical comparison between the PUBO with binary penalty terms and the QUBO formulations proposed on a railway timetabling problem solved with QAOA. Our results illustrate that the PUBO reformulation outperforms the QUBO one for the problem at hand.
Efficient Job-Shop Scheduling (JSS) is still a challenging combinatorial optimisation problem in engineering systems because of machine-capacity constraints, operation precedence requirements and the exponential growth of the search space for the scheduling problem. The Quantum Approximate Optimization Algorithm (QAOA) has been shown to be a promising approach to solving these optimisation problems, however, when using realistic quantum noise models, the scheduling quality and reliability of the solution can be compromised. This work presents a noise-adaptive QAOA framework that automatically scales the number of shots measured, the classical optimiser, and the circuit depth, informed by an estimated quantum-noise level, and adaptively uses different error mitigation strategies. The scheduling problem is then formulated as a Quadratic Unconstrained Binary Optimisation (QUBO) problem and tested with small-scale engineering benchmark instances, under various simulated noise circumstances. Comparative simulation results show that the proposed adaptive strategy is able to keep the optimality gap low and feasible-solution rate high in every instance, and achieve competitive scheduling performance as compared to a fixed-depth noisy QAOA. The study shows how the adaptive selection of quantum parameters can enhance the robustness of QAOA for small systems of engineering scheduling problems in the presence of noisy quantum devices.
Abstract This study proposes a novel structural optimization framework based on quantum variational circuits, in which the multiplier acting on the cross-sectional area of each rod in a truss structure as an updater is used as a design variable. Specifically, we employ a classical processor for structural analysis with the finite element method, and the Quantum Approximate Optimization Algorithm (QAOA) is subsequently performed to update the cross-sectional area so that the compliance is minimized. The advantages of this framework can be seen in three key aspects. First, by defining design variables as multipliers, rather than simply reducing the design variable to a binary candidate of inclusion or exclusion (corresponding to qubit states, “0” and “1”), it provides greater flexibility in adjusting the cross-sectional area of the rod at each iteration of the optimization process. Second, the multipliers acting on rods are encoded with on-off encoding, eliminating additional constraints in the convergence judgement. As a result, the objective function is in a simple format, enabling efficient optimization using QAOA. Third, a fixed linear ramp schedule (FLRS) for variational parameter setting bypasses the classical optimization process, thereby improving the operational efficiency of the framework. In the two structural cases investigated in this study, the proposed approach highlights the feasibility and applicability potential of quantum computing in advancing engineering design and optimization. Numerical experiments have demonstrated the effectiveness of this framework, providing a firm foundation for future research on quantum-assisted optimization methods in engineering fields.
The increasing availability of quantum hardware has stimulated interest in applying quantum algorithms to combinatorial optimization problems. Collision avoidance for unmanned aerial vehicles (UAVs) is one such challenge due to the computational complexity of coordinating multiple agents in shared airspace. In this paper, we formulate the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model that captures route selection and collision constraints, enabling the use of the Quantum Approximate Optimization Algorithm (QAOA). To improve efficiency, we introduce a constrained QAOA Ansatz employing an XY-mixer that preserves one-hot route assignment constraints and restricts the search space to valid solutions. We evaluate the approach through noiseless simulations and device-based noise models, analyzing its behavior under realistic conditions and highlighting the opportunities and limitations of near-term quantum hardware for multi-agent routing problems.