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:2502.16769 · Advanced Modeling and Simulation in Engineering Sciences

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

Junsen Xiao, Naruethep Sukulthanasorn, Reika Nomura, Shuji Moriguchi, Kenjiro Terada

Published Jun 18, 2025• 12 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1186/s40323-025-00298-2

Related papers

Gate-Based Variational Quantum Algorithm for Truss Structure Size Optimization Problem

Yusheng Xu, Xiaojun Wang, Zhenghuan Wang

Quantum computing has become a pivotal innovation in computational science, offering novel avenues for tackling the increasingly complex and high-dimensional optimization challenges inherent in engineering design. This paradigm shift is particularly pertinent in the domain of structural optimization, where the intricate interplay of design variables and constraints necessitates advanced computational strategies. In this vein, the gate-based variational quantum algorithm utilizes quantum superposition and entanglement to improve search efficiency in large solution spaces. This paper delves into the gate-based variational quantum algorithm for the discrete variable truss structure size optimization problem. By reformulating this optimization challenge into a quadratic, unconstrained binary optimization framework, we bridge the gap between the discrete nature of engineering optimization tasks and the quantum computational paradigm. A detailed algorithm is outlined, encompassing the translation of the truss optimization problem into the quantum problem, the initialization and iterative evolution of a quantum circuit tailored to this problem, and the integration of classical optimization techniques for parameter tuning. The proposed approach demonstrates the feasibility and potential of quantum computing to transform engineering design and optimization, with numerical experiments validating the effectiveness of the method and paving the way for future explorations in quantum-assisted engineering optimizations.

AIAA Journal•Sep 3, 2024•13 citations

Quantum Computing for Structural Optimization

Kevin Wils

Quantum computing is a new form of computational technology, which can potentially be used to solve certain problems faster than is possible using classical computers. For this reason, there is an industry drive to develop early quantum computing applications. In this thesis, an overview of quantum computing technologies is provided, along with a practical discussion of the Traveling Salesman Problem, making use of the D-Wave quantum annealer. Subsequently, the main objective of the thesis can be investigated, which is to explore how quantum computing can be used to aid in solving structural optimization problems. Two methods are developed with which simple 2-dimensional truss systems can be optimized using the D-Wave quantum annealer. The methods aim to find the most lightweight choices for the truss cross-sectional areas while complying with material limit stress constraints. The first method directly casts such an optimization problem into a QUBO format. However, due to difficulties with formulating the stress constraint, this method was found to produce a trivial optimization problem. The second method attempts to symbolically solve a truss finite-element problem, using the resulting symbolic expressions to set up an optimization objective function. Although these objective functions are confirmed to work via classical brute-force analysis, the quantum annealer is shown to have difficulty finding the global optimum solution for truss systems with three or more elements. These results indicate that it is not currently beneficial to use quantum annealing for these structural optimization problems. Nevertheless, some improvements to the method for setting up the objective functions are suggested. The next generation of quantum annealers is expected to perform better for these practical applications, potentially becoming a useful tool in the engineering toolbox.

•Jan 1, 2020•6 citations

Efficient Quantum Algorithm for Phase Optimization of 1-Bit RIS-Assisted MIMO Communication System

Soumyadip Paul, Neel Kanth Kundu

We propose a Quantum Approximate Optimization Algorithm with a deterministic linear ramp schedule (QAOA-LR) for phase optimization of a 1-bit RIS-assisted MIMO communication system. Each RIS element is restricted to a binary phase shift of 0 or π, turning the passive beamforming design problem with N elements into a combinatorial optimization problem over 2^N configurations. Instead of running a classical optimizer, QAOA-LR uses a fixed linear ramp to set the variational parameters across p layers and finds the best scale via a simple one-dimensional grid search over a single parameter. Monte Carlo simulations over Rayleigh-fading MIMO channels confirm that QAOA-LR closely tracks the optimum maximum-likelihood (ML) solution. Furthermore, the proposed algorithm reduces the computational complexity compared with classical optimization, and real hardware experiments on the IBM Quantum processor confirm near-ML capacity performance with polynomial scaling of quantum processing unit execution time as the number of RIS elements increases.

arXiv:2607.14700•Jul 16, 2026•1 citation

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

Matteo Hirschmann

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.

•Jan 1, 2026•0 citations

Quantum Approximate Optimization Algorithm with Fixed Number of Parameters

Sebastián Saavedra-Pino, Ricardo Quispe-Mendizábal, Gabriel Alvarado Barrios +3 more

We introduce a novel quantum optimization paradigm: the Fixed-Parameter-Count Quantum Approximate Optimization Algorithm (FPC-QAOA). It is a scalable variational framework that maintains a constant number of trainable parameters regardless of the number of qubits, Hamiltonian complexity, or circuit depth. By separating schedule function optimization from circuit digitization, FPC-QAOA enables accurate schedule approximations with minimal parameters while supporting arbitrarily deep digitized adiabatic evolutions, constrained only by NISQ hardware capabilities. This separation allows depth to scale without expanding the classical search space, mitigating overparameterization and optimization challenges typical of deep QAOA circuits, such as barren plateaus-like behaviors. We benchmark FPC-QAOA on random MaxCut instances and the Tail Assignment Problem, achieving performance comparable to or better than standard QAOA with nearly constant classical effort and significantly fewer quantum circuit evaluations. Experiments on the IBM Kingston superconducting processor with up to 50 qubits confirm robustness and hardware efficiency under realistic noise. These results position FPC-QAOA as a practical and scalable paradigm for variational quantum optimization on near-term quantum devices.

quant-pharXiv:2512.21181•EPJ Quantum Technology•Dec 25, 2025•3 citations

Quantum algorithms for combinatorial optimization

Vanessa Minouche Dehn

Combinatorial Optimization problems play an important role in various domains such as logis- tics, life science or the financial sector. As their complexity in general grows exponentially with their problem size, finding the optimal solution classically becomes infeasible very fast. This raises the central question of whether quantum computers are in principle suitable for solving combinatorial optimization problems better and faster than classical computers. In order to find answers to that question, one needs to study quantum algorithms designed for those problems under ideal conditions (i.e., simulations, which are however limited due to exponential scaling) to investigate their potential, but one also needs real quantum hardware to test its viability and evaluate whether practical advantages are reasonable. In this regard, we consider variational quantum algorithms, especially the Quantum Approximate Optimization Algorithm (QAOA) consisting of a problem and a mixer Hamiltonian with freely selectable parameters, originally proposed as variational hybrid ansatz with classical optimization. This algorithm structure of- fers flexible and relatively shallow circuits, which makes it suitable for current NISQ hardware. However, optimizing the variational circuit parameters can be an NP-hard problem at worst. In this thesis, we study different versions of QAOA, especially with a focus on limitations, perfor- mance and potential advantages opposite classical methods. The first part of the thesis concerns the investigation of various aspects regarding the imple- mentation of the variational QAOA protocol such as: the incorporation of a problem constraint either by adding a suitable penalty term of by choosing a suitable mixer (that restricts the search space), the scaling of the problem Hamiltonian in comparison to the mixer Hamiltonian, the choice of the initial values for the classical optimization of the circuit parameters, and finally the choice of the function to be minimized (i.e., CVaR vs. expectation value). We apply this proto- col to both the portfolio optimization and the feature selection and evaluate the performance. In order to improve QAOA, we consider the warm-start QAOA for different problem instances and analyze its improved performance with regard to involved quantum effects. For this purpose, we propose a classical pre-processing method and demonstrate that the warm-start results can be reproduced or even exceeded by this method. The second part addresses the issue that the standard variational form requires a high number of circuit parameters that have to be optimized at a sufficiently large depth, which is a major limitationforachievingpotentialscalingadvantagescomparedtoclassicalmethods. Toovercome this limitation, we investigate and further develop fixed schedules for QAOA, which only rely on two free parameters. We start with introducing the continuous adiabatic theorem as it motivates the form of QAOA and show its limitations, which we address by applying a discrete version of the theorem. With our findings, a new version of QAOA based on linear-ramps (LR-QAOA) is introduced and further developed. In order to derive suitable parameter values for this schedule, we propose a method based on extrapolation from smaller towards larger problem sizes. With our results obtained on a noiseless emulator, we evaluate the quantum runtime scaling and discuss whether a scaling advantage can be achieved compared to classical methods.

•Jan 1, 2026•0 citations
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.
Quantum computing has become a pivotal innovation in computational science, offering novel avenues for tackling the increasingly complex and high-dimensional optimization challenges inherent in engineering design. This paradigm shift is particularly pertinent in the domain of structural optimization, where the intricate interplay of design variables and constraints necessitates advanced computational strategies. In this vein, the gate-based variational quantum algorithm utilizes quantum superposition and entanglement to improve search efficiency in large solution spaces. This paper delves into the gate-based variational quantum algorithm for the discrete variable truss structure size optimization problem. By reformulating this optimization challenge into a quadratic, unconstrained binary optimization framework, we bridge the gap between the discrete nature of engineering optimization tasks and the quantum computational paradigm. A detailed algorithm is outlined, encompassing the translation of the truss optimization problem into the quantum problem, the initialization and iterative evolution of a quantum circuit tailored to this problem, and the integration of classical optimization techniques for parameter tuning. The proposed approach demonstrates the feasibility and potential of quantum computing to transform engineering design and optimization, with numerical experiments validating the effectiveness of the method and paving the way for future explorations in quantum-assisted engineering optimizations.
Quantum computing is a new form of computational technology, which can potentially be used to solve certain problems faster than is possible using classical computers. For this reason, there is an industry drive to develop early quantum computing applications. In this thesis, an overview of quantum computing technologies is provided, along with a practical discussion of the Traveling Salesman Problem, making use of the D-Wave quantum annealer. Subsequently, the main objective of the thesis can be investigated, which is to explore how quantum computing can be used to aid in solving structural optimization problems. Two methods are developed with which simple 2-dimensional truss systems can be optimized using the D-Wave quantum annealer. The methods aim to find the most lightweight choices for the truss cross-sectional areas while complying with material limit stress constraints. The first method directly casts such an optimization problem into a QUBO format. However, due to difficulties with formulating the stress constraint, this method was found to produce a trivial optimization problem. The second method attempts to symbolically solve a truss finite-element problem, using the resulting symbolic expressions to set up an optimization objective function. Although these objective functions are confirmed to work via classical brute-force analysis, the quantum annealer is shown to have difficulty finding the global optimum solution for truss systems with three or more elements. These results indicate that it is not currently beneficial to use quantum annealing for these structural optimization problems. Nevertheless, some improvements to the method for setting up the objective functions are suggested. The next generation of quantum annealers is expected to perform better for these practical applications, potentially becoming a useful tool in the engineering toolbox.
We propose a Quantum Approximate Optimization Algorithm with a deterministic linear ramp schedule (QAOA-LR) for phase optimization of a 1-bit RIS-assisted MIMO communication system. Each RIS element is restricted to a binary phase shift of 0 or π, turning the passive beamforming design problem with N elements into a combinatorial optimization problem over 2^N configurations. Instead of running a classical optimizer, QAOA-LR uses a fixed linear ramp to set the variational parameters across p layers and finds the best scale via a simple one-dimensional grid search over a single parameter. Monte Carlo simulations over Rayleigh-fading MIMO channels confirm that QAOA-LR closely tracks the optimum maximum-likelihood (ML) solution. Furthermore, the proposed algorithm reduces the computational complexity compared with classical optimization, and real hardware experiments on the IBM Quantum processor confirm near-ML capacity performance with polynomial scaling of quantum processing unit execution time as the number of RIS elements increases.
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.
We introduce a novel quantum optimization paradigm: the Fixed-Parameter-Count Quantum Approximate Optimization Algorithm (FPC-QAOA). It is a scalable variational framework that maintains a constant number of trainable parameters regardless of the number of qubits, Hamiltonian complexity, or circuit depth. By separating schedule function optimization from circuit digitization, FPC-QAOA enables accurate schedule approximations with minimal parameters while supporting arbitrarily deep digitized adiabatic evolutions, constrained only by NISQ hardware capabilities. This separation allows depth to scale without expanding the classical search space, mitigating overparameterization and optimization challenges typical of deep QAOA circuits, such as barren plateaus-like behaviors. We benchmark FPC-QAOA on random MaxCut instances and the Tail Assignment Problem, achieving performance comparable to or better than standard QAOA with nearly constant classical effort and significantly fewer quantum circuit evaluations. Experiments on the IBM Kingston superconducting processor with up to 50 qubits confirm robustness and hardware efficiency under realistic noise. These results position FPC-QAOA as a practical and scalable paradigm for variational quantum optimization on near-term quantum devices.
Combinatorial Optimization problems play an important role in various domains such as logis- tics, life science or the financial sector. As their complexity in general grows exponentially with their problem size, finding the optimal solution classically becomes infeasible very fast. This raises the central question of whether quantum computers are in principle suitable for solving combinatorial optimization problems better and faster than classical computers. In order to find answers to that question, one needs to study quantum algorithms designed for those problems under ideal conditions (i.e., simulations, which are however limited due to exponential scaling) to investigate their potential, but one also needs real quantum hardware to test its viability and evaluate whether practical advantages are reasonable. In this regard, we consider variational quantum algorithms, especially the Quantum Approximate Optimization Algorithm (QAOA) consisting of a problem and a mixer Hamiltonian with freely selectable parameters, originally proposed as variational hybrid ansatz with classical optimization. This algorithm structure of- fers flexible and relatively shallow circuits, which makes it suitable for current NISQ hardware. However, optimizing the variational circuit parameters can be an NP-hard problem at worst. In this thesis, we study different versions of QAOA, especially with a focus on limitations, perfor- mance and potential advantages opposite classical methods. The first part of the thesis concerns the investigation of various aspects regarding the imple- mentation of the variational QAOA protocol such as: the incorporation of a problem constraint either by adding a suitable penalty term of by choosing a suitable mixer (that restricts the search space), the scaling of the problem Hamiltonian in comparison to the mixer Hamiltonian, the choice of the initial values for the classical optimization of the circuit parameters, and finally the choice of the function to be minimized (i.e., CVaR vs. expectation value). We apply this proto- col to both the portfolio optimization and the feature selection and evaluate the performance. In order to improve QAOA, we consider the warm-start QAOA for different problem instances and analyze its improved performance with regard to involved quantum effects. For this purpose, we propose a classical pre-processing method and demonstrate that the warm-start results can be reproduced or even exceeded by this method. The second part addresses the issue that the standard variational form requires a high number of circuit parameters that have to be optimized at a sufficiently large depth, which is a major limitationforachievingpotentialscalingadvantagescomparedtoclassicalmethods. Toovercome this limitation, we investigate and further develop fixed schedules for QAOA, which only rely on two free parameters. We start with introducing the continuous adiabatic theorem as it motivates the form of QAOA and show its limitations, which we address by applying a discrete version of the theorem. With our findings, a new version of QAOA based on linear-ramps (LR-QAOA) is introduced and further developed. In order to derive suitable parameter values for this schedule, we propose a method based on extrapolation from smaller towards larger problem sizes. With our results obtained on a noiseless emulator, we evaluate the quantum runtime scaling and discuss whether a scaling advantage can be achieved compared to classical methods.