arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2510.07280quant-phphysics.comp-ph
收藏

端到端量子算法用于结构力学中的拓扑优化

End-to-End Quantum Algorithm for Topology Optimization in Structural Mechanics

BMW Group(宝马集团);Theoretical Physics, Saarland University(萨尔兰州立大学理论物理系);Institute for Quantum Computing Analytics (PGI 12), Forschungszentrum Jülich(于利希研究中心量子计算分析研究所(PGI 12));Chair of Methods for Model-based Development in Computational Engineering, RWTH Aachen University(亚琛工业大学计算工程基于模型开发方法讲席)

Leonhard Hölscher, Oliver Ahrend, Lukas Karch, Carlotta L'Estocq, Marc Marfany Andreu, Tobias Stollenwerk, Frank K. Wilhelm, Julia Kowalski

AI总结:

本文提出一种端到端的容错量子算法,用于解决结构力学中的拓扑优化问题,通过将设计空间表示为指数希尔伯特空间,并利用Grover算法解决组合满足问题,实现对指数级结构的高效评估。

摘要:

拓扑优化是工程设计中寻找高效且稳健结构的关键方法。由于设计空间的规模巨大,通常无法评估所有可能的配置。本文提出了一种端到端、容错的量子算法,用于拓扑优化,该算法在指数希尔伯特空间上运行,代表设计空间。我们展示了该算法在二维Messerschmitt-Bölkow-Blohm (MBB) 梁问题上的应用。通过将设计变量限制为二进制值,我们将合规性最小化任务重新表述为一个组合满足问题,使用Grover算法解决。在Grover的Oracle中,通过有限元方法(FEM)利用已建立的量子算法计算合规性,包括刚度矩阵的块编码、量子奇异值变换(QSVT)用于矩阵求逆、Hadamard测试和量子振幅估计(QAE)。完整的算法通过经典量子电路模拟实现并验证。详细复杂性分析显示,该方法在多项式时间内评估了指数级数量的结构。在全局搜索中,我们的方法保持了Grover的二次加速优势,相比经典无结构搜索。整体而言,所提出的量子工作流程展示了量子算法如何推动计算科学和工程领域的发展。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑