We present a quantum annealing-based solution method for topology optimization (TO). In particular, we consider TO in a more general setting, i.e., applied to structures of continuum domains where designs are represented as distributed functions, referred to as continuum TO problems. According to the problem's properties and structure, we formulate appropriate sub-problems that can be solved on an annealing-based quantum computer. The methodology established can effectively tackle continuum TO problems formulated as mixed-integer nonlinear programs. To maintain the resulting sub-problems small enough to be solved on quantum computers currently accessible with small numbers of quits and limited connectivity, we further develop a splitting approach that splits the problem into two parts: the first part can be efficiently solved on classical computers, and the second part with a reduced number of variables is solved on a quantum computer. By such, a practical continuum TO problem of varying scales can be handled on the D-Wave quantum annealer. More specifically, we concern the minimum compliance, a canonical TO problem that seeks an optimal distribution of materials to minimize the compliance with desired material usage. The superior performance of the developed methodology is assessed and compared with the state-of-the-art heuristic classical methods, in terms of both solution quality and computational efficiency. The present work hence provides a promising new avenue of applying quantum computing to practical designs of topology for various applications.
翻译:特别是,我们考虑在更一般的环境下,即,将设计作为分布函数、称为问题连续性的连续领域结构中,将设计作为分布函数加以应用。根据问题的属性和结构,我们制定适当的子问题,可以在一个以清除为基础的量子计算机上解决。所制定的方法可以有效地解决作为混合内联非线性程序而形成的问题。为了维持目前可进入数量少且连通性有限的量子计算机所解决的小小问题,我们进一步制定分拆方法,将问题分为两个部分:第一部分可以在古典计算机上有效解决,第二部分的变数减少,在量子计算机上加以解决。这样,在D-Wave量子非线性程序上可以处理不同规模问题的实际连锁。更具体地说,我们关心的是最低限度的合规性,一个寻求以最佳方式分发材料,以最大限度地减少所需材料的使用率。因此,与目前高品质的计算方法相比,高品质的绩效是计算方法,因此,与目前最有前景的计算方法,因此,与目前高质量的计算方法相比,与目前高水平的计算方法提供。