Exploring Quantum-Inspired Algorithms for High-Performance Computing in Structural Analysis
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Structural analysis in high-performance computing (HPC) faces challenges related to computational complexity, energy efficiency, and solution accuracy. This research explores Quantum-Inspired Algorithms (QIAs) as an innovative approach to enhance computational efficiency and accuracy in large-scale structural simulations. The proposed methodology integrates a Quantum-Inspired Evolutionary Algorithm (QIEA) with a Hybrid Quantum-Inspired Neural Network (HQINN) for improved structural performance prediction. The study evaluates QIAs on three benchmark structural problems: Bridge Load Distribution Analysis – Achieves a computational speed-up of 45% compared to classical solvers while maintaining an error rate of <0.5%. The Quantum-Inspired Variational Monte Carlo (QIVMC) method is applied to solve complex eigenvalue problems, achieving an 8× acceleration in solving large-scale stiffness matrices compared to traditional iterative solvers. Experimental validation on a high-performance computing cluster using 1,024 cores demonstrates a 55% improvement in processing speed and a 37% reduction in energy consumption. Results confirm that Quantum-Inspired Algorithms significantly outperform traditional numerical methods in structural analysis, paving the way for their adoption in next-generation engineering simulations. Future work will focus on hybrid quantum-classical frameworks and their real-world applications in civil, aerospace, and automotive engineering.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it