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:2510.07280 · Quantum Science and Technology

End-to-end quantum algorithm for topology optimization in structural mechanics

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

Published Mar 23, 2026• 4 citations
arXivHTMLPDF

Abstract

Abstract 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 an exponentially large Hilbert space representing the design space. We demonstrate the algorithm on the two-dimensional Messerschmitt-Bölkow-Blohm 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 using established quantum algorithms, including block-encoding of the stiffness matrix, quantum singular value transformation for matrix inversion, Hadamard test, and quantum amplitude estimation. 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.

DOI
10.1088/2058-9565/ae4cfe

Related papers

Variational quantum algorithm for constrained topology optimization

Jungin E. Kim, Yan Wang

Abstract One of the challenging scientific computing problems is topology optimization (TO), where the two tasks of searching through the combinatorially complex configurations and solving the constraints of partial differential equations need to be done simultaneously. In this paper, a novel variational quantum algorithm for constrained TO is proposed, which allows for the single-loop parallel search for the optimal configuration that also satisfies the physical constraints. The optimal configurations and the solutions to physical constraints are encoded with two separate quantum registers. A constraint encoding scheme is also proposed to incorporate volume and connectivity constraints in optimization. The gate complexity of the proposed quantum algorithm is analyzed. The algorithm is demonstrated with compliance minimization problems including truss structures and Messerschmitt–Bölkow–Blohm beams.

arXiv:2412.07099•Quantum Science and Technology•Aug 18, 2025•5 citations

Topology Optimization With Quantum Approximate Bayesian Optimization Algorithm

Jungin E. Kim, Yan Wang

Abstract Despite its wide scope of applications, topology optimization faces a major challenge, which is its high computational expenses caused by the large number of design variables and the underlying physics. Because the number of possible material layouts increases exponentially, the search for the optimum becomes computationally intractable. Recently, quantum computing emerged as an alternative paradigm for solving optimization problems with potentially much higher efficiency than classical computing. The quantum superposition phenomenon allows quantum computer to perform a parallel search of many possible solutions. In this work, a two-mixer quantum approximate Bayesian optimization algorithm (TM-QABOA) is developed as a hybrid quantum-classical optimization algorithm, where Pauli-X mixers and generalized Grover mixers are applied in an alternating fashion. TM-QABOA enables a dynamic exploration-exploitation balance to improve searching efficiency. The exploration is done with the Pauli-X mixers, whereas the exploitation is enhanced by the generalized Grover mixers through amplitude amplification. Surrogate-based Bayesian optimization is used to optimize the hyperparameters of the quantum circuit, i.e., rotation angles. The algorithm can also be used to solve mixed-integer optimization problems. The feasibility of TM-QABOA to solve optimization problems is demonstrated with two simple examples. One is two-dimensional truss design, and the other is metamaterials design.

ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference (IDETC/CIE)•Aug 20, 2023•4 citations

Quantum Search Algorithms for Constraint Satisfaction and Optimization Problems Using Grover's Search and Quantum Walk Algorithms with Advanced Oracle Design

Abdirahman Alasow

The field of quantum computing has emerged as a powerful tool for solving and optimizing combinatorial optimization problems. To solve many real-world problems with many variables and possible solutions for constraint satisfaction and optimization problems, the required number of qubits of scalable hardware for quantum computing is the bottleneck in the current generation of quantum computers. In this dissertation, we will demonstrate advanced, scalable building blocks for the quantum search algorithms that have been implemented in Grover's search algorithm and the quantum walk algorithm. The scalable building blocks are used to reduce the required number of qubits in the design. The proposed architecture effectively scales and optimizes the number of qubits needed to solve large problems with a limited number of qubits. Thus, scaling and optimizing the number of qubits that can be accommodated in quantum algorithm design directly reflect on performance. Also, accuracy is a key performance metric related to how accurately one can measure quantum states. The search space of quantum search algorithms is traditionally created by using the Hadamard operator to create superposition. However, creating superpositions for problems that do not need all superposition states decreases the accuracy of the measured states. We present an efficient quantum circuit design that the user has control over to create the subspace superposition states for the search space as needed. Using only the subspace states as superposition states of the search space will increase the rate of correct solutions. In this dissertation, we will present the implementation of practical problems for Grover's search algorithm and quantum walk algorithm in logic design, logic puzzles, and machine learning problems such as SAT, MAX-SAT, XOR-SAT, and like SAT problems in EDA, and mining frequent patterns for association rule mining.

•Apr 15, 2024•0 citations

Quantum Topology Structures: An Optimization Algorithm

Jincheng Zhang

Quantum topology is a rapidly developing field with profound implications for quantum information processing. The study of topological quantum states, which exhibit robustness and are inherently programmable, holds immense potential for creating fault-tolerant quantum computers and quantum networks. This paper explores the development of a novel optimization algorithm specifically tailored for quantum topology, aiming to accelerate the discovery of optimal quantum states. We introduce a framework leveraging the unique properties of topological structures to guide the search process, enhancing the efficiency of finding the most stable and performant configurations within quantum systems. The core mechanism focuses on exploiting the inherent symmetries and constraints imposed by topological properties to minimize energy and maximize quantum coherence. The paper details the algorithm's design, its theoretical underpinnings, and preliminary experimental results demonstrating its effectiveness in optimizing quantum systems. We highlight the potential impact of this algorithm on the advancement of quantum technologies.

•Sep 5, 2026•0 citations

Deterministic Quantum Search for NP Problems Through Verifier-Based Oracle Construction

Soumyajyoti Chatterjee, Mishra Harishankar, Asvija Balasubramanyam +2 more

Problems in the class NP are important in computational science, where a given candidate solution can be verified in polynomial time, while finding a solution may require evaluating the entire search space in the worst case. Classical exhaustive approaches generally solve such problems by evaluating the verifier function over all possible inputs, resulting in a worst-case query complexity of O(N), where N = d^n represents the size of the search space, d is the number of possible values for each variable, and n is the number of variables. Quantum search algorithms can solve unstructured search problems more efficiently by reducing the query complexity to O(sqrt (N)), providing a quadratic speedup over classical exhaustive search. However, conventional quantum search formulations typically assume access to an oracle that identifies valid solutions, while standard implementations generally yield probabilistic success. In this work, we propose a generalised quantum oracle construction method for NP problems, together with a deterministic quantum search framework that identifies satisfying assignments using their corresponding classical verifier functions. The proposed framework retains the quadratic query speedup of quantum search over classical exhaustive search. We further establish that constructed oracle can be implemented using a number of gates polynomial in the size (L) of the binary encoding of verification function, consistent with the polynomial-time evaluation of the corresponding classical verifier, while the total qubit requirement remains O(poly(L)). The construction is demonstrated on multiple N-SAT instances, with circuit-level simulations confirming deterministic identification of satisfying assignments. These results establish the applicability of deterministic quantum search to NP problems while retaining the quadratic query advantage over classical exhaustive search.

arXiv:2611.09830•Nov 6, 2026•0 citations

Practical Guide to Quantum Computing: Grover's Algorithm # 4

Mikhail Pavlov

Abstract This guide is based on the IBM Quantum course Phase Estimation and Factoring and focuses on Grover’s algorithm, a quantum algorithm for unstructured search problems that provides a quadratic speedup over classical approaches. In an unstructured search problem, we are given a function (often represented as an oracle) that marks one or more “correct” solutions among NNN possible candidates. A classical algorithm requires on the order of O(N)O(N)O(N) evaluations in the worst case. In contrast, Grover’s algorithm finds a solution using only O(N)O(\sqrt{N})O(N) oracle queries. This quadratic improvement implies: The quantum algorithm requires roughly the square root of the number of operations needed classically. Any classical algorithm for unstructured search must have cost at least quadratic relative to Grover’s quantum procedure. Core Idea of the Algorithm Grover’s algorithm relies on: Preparation of a uniform superposition (typically using Hadamard gates). An oracle that marks valid solutions via phase inversion. The Grover diffusion operator, which amplifies the probability amplitude of the marked states through interference. By repeatedly applying the Grover operator, the amplitude of the desired solution grows while others diminish, allowing measurement to reveal the correct answer with high probability. Practical Considerations Despite its theoretical elegance and wide applicability, the quadratic speedup of Grover’s algorithm is unlikely to yield near-term practical advantage. Modern classical hardware operates at extremely high clock rates and is vastly more mature than current quantum devices. For problem sizes accessible to today’s quantum computers, classical systems remain dominant. However, history shows that even sub-quadratic classical improvements — such as: Fast Fourier Transform (FFT) Efficient sorting algorithms like quicksort and mergesort have had transformative practical impact. The crucial distinction is that Grover’s algorithm depends on fundamentally different hardware — quantum processors — which are still in early development. Long-Term Perspective As quantum hardware advances in qubit count, coherence time, and error correction, Grover’s quadratic advantage may become practically significant for: Cryptographic key search Optimization heuristics Combinatorial search problems Amplitude amplification subroutines in broader quantum algorithms Through hands-on experimentation on IBM Q, this lesson demonstrates how theoretical amplitude amplification translates into executable quantum circuits, reinforcing the relationship between interference, probability amplitudes, and computational complexity.

•Mar 4, 2026•0 citations
Abstract 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 an exponentially large Hilbert space representing the design space. We demonstrate the algorithm on the two-dimensional Messerschmitt-Bölkow-Blohm 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 using established quantum algorithms, including block-encoding of the stiffness matrix, quantum singular value transformation for matrix inversion, Hadamard test, and quantum amplitude estimation. 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.
Abstract One of the challenging scientific computing problems is topology optimization (TO), where the two tasks of searching through the combinatorially complex configurations and solving the constraints of partial differential equations need to be done simultaneously. In this paper, a novel variational quantum algorithm for constrained TO is proposed, which allows for the single-loop parallel search for the optimal configuration that also satisfies the physical constraints. The optimal configurations and the solutions to physical constraints are encoded with two separate quantum registers. A constraint encoding scheme is also proposed to incorporate volume and connectivity constraints in optimization. The gate complexity of the proposed quantum algorithm is analyzed. The algorithm is demonstrated with compliance minimization problems including truss structures and Messerschmitt–Bölkow–Blohm beams.
Abstract Despite its wide scope of applications, topology optimization faces a major challenge, which is its high computational expenses caused by the large number of design variables and the underlying physics. Because the number of possible material layouts increases exponentially, the search for the optimum becomes computationally intractable. Recently, quantum computing emerged as an alternative paradigm for solving optimization problems with potentially much higher efficiency than classical computing. The quantum superposition phenomenon allows quantum computer to perform a parallel search of many possible solutions. In this work, a two-mixer quantum approximate Bayesian optimization algorithm (TM-QABOA) is developed as a hybrid quantum-classical optimization algorithm, where Pauli-X mixers and generalized Grover mixers are applied in an alternating fashion. TM-QABOA enables a dynamic exploration-exploitation balance to improve searching efficiency. The exploration is done with the Pauli-X mixers, whereas the exploitation is enhanced by the generalized Grover mixers through amplitude amplification. Surrogate-based Bayesian optimization is used to optimize the hyperparameters of the quantum circuit, i.e., rotation angles. The algorithm can also be used to solve mixed-integer optimization problems. The feasibility of TM-QABOA to solve optimization problems is demonstrated with two simple examples. One is two-dimensional truss design, and the other is metamaterials design.
The field of quantum computing has emerged as a powerful tool for solving and optimizing combinatorial optimization problems. To solve many real-world problems with many variables and possible solutions for constraint satisfaction and optimization problems, the required number of qubits of scalable hardware for quantum computing is the bottleneck in the current generation of quantum computers. In this dissertation, we will demonstrate advanced, scalable building blocks for the quantum search algorithms that have been implemented in Grover's search algorithm and the quantum walk algorithm. The scalable building blocks are used to reduce the required number of qubits in the design. The proposed architecture effectively scales and optimizes the number of qubits needed to solve large problems with a limited number of qubits. Thus, scaling and optimizing the number of qubits that can be accommodated in quantum algorithm design directly reflect on performance. Also, accuracy is a key performance metric related to how accurately one can measure quantum states. The search space of quantum search algorithms is traditionally created by using the Hadamard operator to create superposition. However, creating superpositions for problems that do not need all superposition states decreases the accuracy of the measured states. We present an efficient quantum circuit design that the user has control over to create the subspace superposition states for the search space as needed. Using only the subspace states as superposition states of the search space will increase the rate of correct solutions. In this dissertation, we will present the implementation of practical problems for Grover's search algorithm and quantum walk algorithm in logic design, logic puzzles, and machine learning problems such as SAT, MAX-SAT, XOR-SAT, and like SAT problems in EDA, and mining frequent patterns for association rule mining.
Quantum topology is a rapidly developing field with profound implications for quantum information processing. The study of topological quantum states, which exhibit robustness and are inherently programmable, holds immense potential for creating fault-tolerant quantum computers and quantum networks. This paper explores the development of a novel optimization algorithm specifically tailored for quantum topology, aiming to accelerate the discovery of optimal quantum states. We introduce a framework leveraging the unique properties of topological structures to guide the search process, enhancing the efficiency of finding the most stable and performant configurations within quantum systems. The core mechanism focuses on exploiting the inherent symmetries and constraints imposed by topological properties to minimize energy and maximize quantum coherence. The paper details the algorithm's design, its theoretical underpinnings, and preliminary experimental results demonstrating its effectiveness in optimizing quantum systems. We highlight the potential impact of this algorithm on the advancement of quantum technologies.
Problems in the class NP are important in computational science, where a given candidate solution can be verified in polynomial time, while finding a solution may require evaluating the entire search space in the worst case. Classical exhaustive approaches generally solve such problems by evaluating the verifier function over all possible inputs, resulting in a worst-case query complexity of O(N), where N = d^n represents the size of the search space, d is the number of possible values for each variable, and n is the number of variables. Quantum search algorithms can solve unstructured search problems more efficiently by reducing the query complexity to O(sqrt (N)), providing a quadratic speedup over classical exhaustive search. However, conventional quantum search formulations typically assume access to an oracle that identifies valid solutions, while standard implementations generally yield probabilistic success. In this work, we propose a generalised quantum oracle construction method for NP problems, together with a deterministic quantum search framework that identifies satisfying assignments using their corresponding classical verifier functions. The proposed framework retains the quadratic query speedup of quantum search over classical exhaustive search. We further establish that constructed oracle can be implemented using a number of gates polynomial in the size (L) of the binary encoding of verification function, consistent with the polynomial-time evaluation of the corresponding classical verifier, while the total qubit requirement remains O(poly(L)). The construction is demonstrated on multiple N-SAT instances, with circuit-level simulations confirming deterministic identification of satisfying assignments. These results establish the applicability of deterministic quantum search to NP problems while retaining the quadratic query advantage over classical exhaustive search.
Abstract This guide is based on the IBM Quantum course Phase Estimation and Factoring and focuses on Grover’s algorithm, a quantum algorithm for unstructured search problems that provides a quadratic speedup over classical approaches. In an unstructured search problem, we are given a function (often represented as an oracle) that marks one or more “correct” solutions among NNN possible candidates. A classical algorithm requires on the order of O(N)O(N)O(N) evaluations in the worst case. In contrast, Grover’s algorithm finds a solution using only O(N)O(\sqrt{N})O(N) oracle queries. This quadratic improvement implies: The quantum algorithm requires roughly the square root of the number of operations needed classically. Any classical algorithm for unstructured search must have cost at least quadratic relative to Grover’s quantum procedure. Core Idea of the Algorithm Grover’s algorithm relies on: Preparation of a uniform superposition (typically using Hadamard gates). An oracle that marks valid solutions via phase inversion. The Grover diffusion operator, which amplifies the probability amplitude of the marked states through interference. By repeatedly applying the Grover operator, the amplitude of the desired solution grows while others diminish, allowing measurement to reveal the correct answer with high probability. Practical Considerations Despite its theoretical elegance and wide applicability, the quadratic speedup of Grover’s algorithm is unlikely to yield near-term practical advantage. Modern classical hardware operates at extremely high clock rates and is vastly more mature than current quantum devices. For problem sizes accessible to today’s quantum computers, classical systems remain dominant. However, history shows that even sub-quadratic classical improvements — such as: Fast Fourier Transform (FFT) Efficient sorting algorithms like quicksort and mergesort have had transformative practical impact. The crucial distinction is that Grover’s algorithm depends on fundamentally different hardware — quantum processors — which are still in early development. Long-Term Perspective As quantum hardware advances in qubit count, coherence time, and error correction, Grover’s quadratic advantage may become practically significant for: Cryptographic key search Optimization heuristics Combinatorial search problems Amplitude amplification subroutines in broader quantum algorithms Through hands-on experimentation on IBM Q, this lesson demonstrates how theoretical amplitude amplification translates into executable quantum circuits, reinforcing the relationship between interference, probability amplitudes, and computational complexity.