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 (67)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- The density-matrix renormalization group in the age of matrix product states
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Area laws for the entanglement entropy - a review
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- A Quantum Approximate Optimization Algorithm
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum computational chemistry
- Quantum Chemistry in the Age of Quantum Computing
- Quantum algorithms: an overview
- The ITensor Software Library for Tensor Network Calculations
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
- A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
- Quantum algorithms for quantum chemistry and quantum materials science
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Quantum optimization using variational algorithms on near-term quantum devices
- DMRG and periodic boundary conditions: a quantum information perspective
- Tensor networks for complex quantum systems
- Hybrid quantum-classical algorithms and quantum error mitigation
- Perspectives of quantum annealing: Methods and implementations
- From density-matrix renormalization group to matrix product states
- Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
- Training variational quantum algorithms is NP-hard
- Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
- An initialization strategy for addressing barren plateaus in parametrized quantum circuits
- Quantum Computing for Finance: State of the Art and Future Prospects
- Layerwise learning for quantum neural networks
- Quantum computing for energy systems optimization: Challenges and opportunities
- Warm-starting quantum optimization
- Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
- A case study in programming a quantum annealer for hard operational planning problems
- Quantum computing with Qiskit
- Hyper-optimized tensor network contraction
- Equivalence of the Variational Matrix Product Method and the Density Matrix Renormalization Group applied to Spin Chains
- Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
- Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
- Exact Ising model simulation on a quantum computer
- Tensor Networks in a Nutshell
- Preparing ground states of quantum many-body systems on a quantum computer
- Preparation of matrix product states with log-depth quantum circuits
- Quantum Annealing for Constrained Optimization
- A Survey of Quantum Computing for Finance
- Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems
- 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
- Prospects of Quantum Computing for Molecular Sciences
- 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
- Local Matrix Product Operators: Canonical Form, Compression, & Control Theory
- Study of Optimization Problems by Quantum Annealing
- Quantum Image Segmentation Based on Grayscale Morphology
- Warm-Starting and Quantum Computing: A Systematic Mapping Study
- Reinforcement Learning Assisted Recursive QAOA
- 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