MétaCan
Menu
Back to cohort
Record W4289543899 · doi:10.48550/arxiv.1809.05523

Postponing the orthogonality catastrophe: efficient state preparation\n for electronic structure simulations on quantum devices

2018· preprint· en· W4289543899 on OpenAlexaff
Norm M. Tubman, Carlos Mejuto-Zaera, Jeffrey M. Epstein, Diptarka Hait, Daniel S. Levine, William J. Huggins, Jiang Zhang, Jarrod R. McClean, Ryan Babbush, Martin Head‐Gordon, K. Birgitta Whaley

Bibliographic record

VenuearXiv (Cornell University) · 2018
Typepreprint
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsGoogle (Canada)
Fundersnot available
KeywordsOrthogonalityRotation formalisms in three dimensionsStatistical physicsGround stateQuantumHubbard modelQuantum stateEmbeddingElectronic structureFock spaceState (computer science)Computer sciencePhysicsQuantum mechanicsTopology (electrical circuits)MathematicsAlgorithm

Abstract

fetched live from OpenAlex

Despite significant work on resource estimation for quantum simulation of\nelectronic systems, the challenge of preparing states with sufficient ground\nstate support has so far been largely neglected. In this work we investigate\nthis issue in several systems of interest, including organic molecules,\ntransition metal complexes, the uniform electron gas, Hubbard models, and\nquantum impurity models arising from embedding formalisms such as dynamical\nmean-field theory. Our approach uses a state-of-the-art classical technique for\nhigh-fidelity ground state approximation. We find that easy-to-prepare single\nSlater determinants such as the Hartree-Fock state often have surprisingly\nrobust support on the ground state for many applications of interest. For the\nmost difficult systems, single-determinant reference states may be\ninsufficient, but low-complexity reference states may suffice. For this we\nintroduce a method for preparation of multi-determinant states on quantum\ncomputers.\n

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.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.

Opus teacher head0.029
GPT teacher head0.218
Teacher spread0.189 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations37
Published2018
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicQuantum Computing Algorithms and ArchitectureFrench-language works237,207