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.19570 · Acta Mechanica Sinica

A hybrid framework integrating classical computers and quantum annealers for optimisation of truss structures

Van Dung Nguyen, Erin Kuci, Michel Rasquin, Ludovic Noels

Published May 5, 2026• 1 citation
arXivHTMLPDF
DOI
10.1007/s10409-025-25157-x

Related papers

A hybrid quantum annealer-classical computer variational framework for elasto-plastic materials

Nguyen, Van Dung, Wu, Ling, Damanet, François +2 more

re)formulation for quantum annealing

•Jun 4, 2024•0 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

A Quantum-Classical Hybrid Framework for Structural Size Optimization Based on the Harrow-Hassidim-Lloyd Algorithm

Jianbing Chen, Disheng Liang, Jingran He

•Jan 1, 2026•0 citations

Comparing Quantum Annealer and Metaheuristic Methods to Solve the Steiner Tree Problem

Darren M. Chitty, James Charles, Alberto Moraglio +1 more

Quantum computers are early-stage technology, but are progressing rapidly. Here, we compare metaheuristics with a quantum annealer (QA), a quantum computer tailored to solve combinatorial optimisation problems formulated as a Quadratic Unconstrained Binary Optimisation (QUBO) problem. Formulating non-trivial optimisation problems as QUBOs is a challenge, so it is to ensure that the direct comparison of classical and quantum search algorithms is conducted fairly. This paper illustrates the use of a streamlined methodology to derive a QUBO for a classical optimisation problem – the Steiner tree problem – and provides comprehensive experiments comparing D-WAVE pure QA and hybrid QA with classical methods including Simulated Annealing and Genetic Algorithms. We find that the pure QA suffers from considerable qubit noise but the hybrid QA is on a par with traditional methods.

Lecture notes in computer science•Nov 15, 2025•0 citations

Mapping structural topology optimization problems to quantum annealing

Xiaojun Wang, Zhenghuan Wang, Bowen Ni

Structural and Multidisciplinary Optimization•May 1, 2024•22 citations

Quantum computing-driven portfolio optimisation framework for the intelligent economy

Leihua Ai

Portfolio optimisation in intelligent economic systems faces the challenge of portfolio explosion caused by expanding asset scales, making it difficult for classical solvers to obtain high-quality solutions within a limited timeframe.This paper proposes a hybrid quantum-classical optimisation framework that combines the global search capabilities of quantum annealing with the constraint expression capabilities of variational quantum algorithms, while reducing quantum resource requirements through asset graph partitioning.In experiments covering 20 to 120 real-market assets, the hybrid framework achieved an area under the curve of 0.716 for a portfolio of 120 assets, representing an approximately 29% improvement over classical genetic algorithms; it maintained an area under the curve of 0.921 even under a noise level of 10 -3 , demonstrating greater robustness than pure quantum annealing methods.The research confirms that the hybrid paradigm is a viable approach for solving large-scale combinatorial optimisation problems on current noisy quantum devices.

International Journal of Information and Communication Technology•Jan 1, 2026•0 citations
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.
Quantum computers are early-stage technology, but are progressing rapidly. Here, we compare metaheuristics with a quantum annealer (QA), a quantum computer tailored to solve combinatorial optimisation problems formulated as a Quadratic Unconstrained Binary Optimisation (QUBO) problem. Formulating non-trivial optimisation problems as QUBOs is a challenge, so it is to ensure that the direct comparison of classical and quantum search algorithms is conducted fairly. This paper illustrates the use of a streamlined methodology to derive a QUBO for a classical optimisation problem – the Steiner tree problem – and provides comprehensive experiments comparing D-WAVE pure QA and hybrid QA with classical methods including Simulated Annealing and Genetic Algorithms. We find that the pure QA suffers from considerable qubit noise but the hybrid QA is on a par with traditional methods.
Portfolio optimisation in intelligent economic systems faces the challenge of portfolio explosion caused by expanding asset scales, making it difficult for classical solvers to obtain high-quality solutions within a limited timeframe.This paper proposes a hybrid quantum-classical optimisation framework that combines the global search capabilities of quantum annealing with the constraint expression capabilities of variational quantum algorithms, while reducing quantum resource requirements through asset graph partitioning.In experiments covering 20 to 120 real-market assets, the hybrid framework achieved an area under the curve of 0.716 for a portfolio of 120 assets, representing an approximately 29% improvement over classical genetic algorithms; it maintained an area under the curve of 0.921 even under a noise level of 10 -3 , demonstrating greater robustness than pure quantum annealing methods.The research confirms that the hybrid paradigm is a viable approach for solving large-scale combinatorial optimisation problems on current noisy quantum devices.