Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.07280 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917360399548416 |
|---|---|
| author | Hölscher, Leonhard Ahrend, Oliver Karch, Lukas L'Estocq, Carlotta Andreu, Marc Marfany Stollenwerk, Tobias Wilhelm, Frank K. Kowalski, Julia |
| author_facet | Hölscher, Leonhard Ahrend, Oliver Karch, Lukas L'Estocq, Carlotta Andreu, Marc Marfany Stollenwerk, Tobias Wilhelm, Frank K. Kowalski, Julia |
| contents | Topology optimization is a key methodology in engineering design for finding efficient and robust structures. Due to the enormous size of the design space, evaluating all possible configurations is typically infeasible. In this work, we present an end-to-end, fault-tolerant quantum algorithm for topology optimization that operates on the exponential Hilbert space representing the design space. We demonstrate the algorithm on the two-dimensional Messerschmitt-Bölkow-Blohm (MBB) beam problem. By restricting design variables to binary values, we reformulate the compliance minimization task as a combinatorial satisfiability problem solved using Grover's algorithm. Within Grover's oracle, the compliance is computed through the finite-element method (FEM) using established quantum algorithms, including block-encoding of the stiffness matrix, Quantum Singular Value Transformation (QSVT) for matrix inversion, Hadamard test, and Quantum Amplitude Estimation (QAE). The complete algorithm is implemented and validated using classical quantum-circuit simulations. A detailed complexity analysis shows that the method evaluates the compliance of exponentially many structures in quantum superposition in polynomial time. In the global search, our approach maintains Grover's quadratic speedup compared to classical unstructured search. Overall, the proposed quantum workflow demonstrates how quantum algorithms can advance the field of computational science and engineering. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_07280 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | End-to-End Quantum Algorithm for Topology Optimization in Structural Mechanics Hölscher, Leonhard Ahrend, Oliver Karch, Lukas L'Estocq, Carlotta Andreu, Marc Marfany Stollenwerk, Tobias Wilhelm, Frank K. Kowalski, Julia Quantum Physics Computational Physics Topology optimization is a key methodology in engineering design for finding efficient and robust structures. Due to the enormous size of the design space, evaluating all possible configurations is typically infeasible. In this work, we present an end-to-end, fault-tolerant quantum algorithm for topology optimization that operates on the exponential Hilbert space representing the design space. We demonstrate the algorithm on the two-dimensional Messerschmitt-Bölkow-Blohm (MBB) beam problem. By restricting design variables to binary values, we reformulate the compliance minimization task as a combinatorial satisfiability problem solved using Grover's algorithm. Within Grover's oracle, the compliance is computed through the finite-element method (FEM) using established quantum algorithms, including block-encoding of the stiffness matrix, Quantum Singular Value Transformation (QSVT) for matrix inversion, Hadamard test, and Quantum Amplitude Estimation (QAE). The complete algorithm is implemented and validated using classical quantum-circuit simulations. A detailed complexity analysis shows that the method evaluates the compliance of exponentially many structures in quantum superposition in polynomial time. In the global search, our approach maintains Grover's quadratic speedup compared to classical unstructured search. Overall, the proposed quantum workflow demonstrates how quantum algorithms can advance the field of computational science and engineering. |
| title | End-to-End Quantum Algorithm for Topology Optimization in Structural Mechanics |
| topic | Quantum Physics Computational Physics |
| url | https://arxiv.org/abs/2510.07280 |