Quantum Method for Finite Element Simulation of Electromagnetic Problems
Bibliographic record
Abstract
Quantum simulation of electromagnetic (EM) structures is still in its infancy. In this paper, we investigate the possibility of applying quantum computing to solve the finite element equations for EM problems. Specifically, we propose to leverage a milestone in quantum computing, i.e., the Harrow/Hassidim/Lloyd (HHL) algorithm, to solve the finite element equations in the EM domain. To do this, we first present a systematic method to reformulate the finite element equations into quantum computation format and apply the HHL algorithm to solve the new equations. Taking advantage of the special properties of finite element matrices in EM problems, we then devise a stepwise algorithm to efficiently determine the suitable values for the hyperparameters of HHL. The proposed method can in theory solve the EM finite element equations in logarithmic time relative to the size of the finite element matrix. This is exponentially faster than that achievable by classical computation as the matrix size increases. A two-dimensional EM example is used to illustrate how the proposed method can be used to find the solutions to EM problems through quantum computation.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.010 | 0.002 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".