Quantum Computing and Tensor Networks for Laminate Design: A Novel Approach to Stacking Sequence Retrieval
arXiv:2402.06455 · doi:10.1016/j.cma.2024.117380
Abstract
As with many tasks in engineering, structural design frequently involves navigating complex and computationally expensive problems. A prime example is the weight optimization of laminated composite materials, which to this day remains a formidable task, due to an exponentially large configuration space and non-linear constraints. The rapidly developing field of quantum computation may offer novel approaches for addressing these intricate problems. However, before applying any quantum algorithm to a given problem, it must be translated into a form that is compatible with the underlying operations on a quantum computer. Our work specifically targets stacking sequence retrieval with lamination parameters. To adapt this problem for quantum computational methods, we map the possible stacking sequences onto a quantum state space. We further derive a linear operator, the Hamiltonian, within this state space that encapsulates the loss function inherent to the stacking sequence retrieval problem. Additionally, we demonstrate the incorporation of manufacturing constraints on stacking sequences as penalty terms in the Hamiltonian. This quantum representation is suitable for a variety of classical and quantum algorithms for finding the ground state of a quantum Hamiltonian. For a practical demonstration, we performed state-vector simulations of two variational quantum algorithms and additionally chose a classical tensor network algorithm, the DMRG algorithm, to numerically validate our approach. Although this work primarily concentrates on quantum computation, the application of tensor network algorithms presents a novel quantum-inspired approach for stacking sequence retrieval.
44 pages, 6 figures. Accompanying code repository: https://github.com/ArneWulff/ssr-with-qc-and-tn . Accompanying data repository: https://doi.org/10.4121/ae276609-55b0-4af1-88c0-1102b1b58990 . Changes: Minor revision
References in corpus (22)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- The density-matrix renormalization group in the age of matrix product states
- A Quantum Approximate Optimization Algorithm
- DMRG and periodic boundary conditions: a quantum information perspective
- Hybrid quantum-classical algorithms and quantum error mitigation
- From density-matrix renormalization group to matrix product states
- Quantum computing for energy systems optimization: Challenges and opportunities
- Quantum computing with Qiskit
- Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
- Tensor Networks in a Nutshell
- Preparation of matrix product states with log-depth quantum circuits
- Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
- Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
- Efficient tensor network simulation of IBM's largest quantum processors
- Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization
- Simulating the Sycamore quantum supremacy circuits
- Study of Optimization Problems by Quantum Annealing
- Quantum Image Segmentation Based on Grayscale Morphology
- Warm-Starting and Quantum Computing: A Systematic Mapping Study
- Accelerated variational algorithms for digital quantum simulation of many-body ground states
- Quantum Observables for continuous control of the Quantum Approximate Optimization Algorithm via Reinforcement Learning
- Approximate Solutions of Combinatorial Problems via Quantum Relaxations