[E.D.] 🌠 Wander/漫步者: Issue #129 Rust ED/FCI Workbench for Electronic Structure - #217
Conversation
|
@chenpeizhi The WangTheoPhys #129 submission is ready for review. Public v0.1.0 release: https://github.com/JunkaiWang-TheoPhy/quantum-harness-129-workbench-rust/releases/tag/v0.1.0. Normal CI is green: https://github.com/JunkaiWang-TheoPhy/quantum-harness-129-workbench-rust/actions/runs/30276902004. Full Linux primary acceptance is also green: https://github.com/JunkaiWang-TheoPhy/quantum-harness-129-workbench-rust/actions/runs/30277339716. This PR contains the complete design README and standalone reproduction prompt, with all 36 primary Hirata Table 2 CI, MBPT, and CC entries validated. Thank you. |
|
@JunkaiWang-TheoPhy Well done. But it seems that the source code repo is still private. Could you make it public? Additionally, could you benchmark your code on water with cc-pVDZ basis set, all-electron without considering symmetry, just to see how performant the code is? |
|
Source repository is now public for review: https://github.com/JunkaiWang-TheoPhy/quantum-harness-129-workbench-rust. I will follow up with the requested water/cc-pVDZ all-electron benchmark separately. |
|
@chenpeizhi Thank you for the benchmark suggestion. The source repository is public, and the requested H2O/cc-pVDZ all-electron benchmark is now implemented and published. Configuration:
Measured on an Apple M4 with 16 GiB RAM, macOS 15.6, release build, across five fresh processes:
The exact determinant product space is Artifacts pinned to commit Reproduction: cargo build --release
/usr/bin/time -l target/release/ed_workbench_rs benchmark h2o-cc-pvdz \
--sources 16 --max-memory-gib 2 \
--json-output fixtures/h2o-ccpvdz-ae/benchmark-m4.jsonThe sparse-column algebra is also regression-tested column-by-column against the existing full direct-FCI operator on the small H2 fixture. |
|
@JunkaiWang-TheoPhy Excellent. Now you may want to push the limit of the implementation and run some large systems on HPC. It would be a good idea to first check what the SOTA is and estimate what can be done within a day or two given the limited computational resources you have. Note that there is a tradeoff between flexibility and efficiency: Some performance tricks that applies to FCI itself no longer work when we use the FCI code to implement other electronic structure methods. It would also be interesting to survey the literature on quantum chemistry on NICS. With the FCI code, can we handle some of the largest systems that have been tested on quantum computers? Finally, an open question is how we can achieve FCI accuracy with reduced computational cost. Ideas like iCI and selected CI are helpful. Moreover, although FCI is orbital invariant, selected CI may benefit from orbital optimization. |
Progress update — post-submission hardening and scaling workThe original #129 numerical result has been preserved while the Rust workbench has advanced from the validated v0.1.1 baseline through three incremental releases:
Preserved numerical acceptance
Measured CPU progressFor the 245,025-determinant H2O/6-31G frozen-core sigma workload on an Apple M4, five fresh release processes gave:
The measured ratio of medians is 3.236817x. The maximum serial/parallel numerical difference was 5.969e-13. The parallel algorithm uses fixed source blocks, thread-local dense partial vectors, and sequential block-order reduction, so repeated fixed-policy runs are bitwise reproducible. Raw measurement: parallel-sigma-m4.json Current scalability boundaryThe requested H2O/cc-pVDZ all-electron, no-point-group-symmetry path is implemented and reproducible through integral generation, RHF, AO-to-MO transformation, link-table construction, and sampled sparse-column execution. Its exact FCI space contains 1,806,590,016 determinants, so one dense The benchmark intentionally reports Full acceptance details, commands, limitations, and release-mode measurements are recorded in the incremental solver validation report. The v0.4.0 GitHub Actions run is green. |
|
Thank you — these are very helpful directions. Since the previous update, I have completed a reproducible SCNet HPC workflow for the pinned v0.4.0 implementation. The offline build, full test suite, and numerical smoke tests all pass. For H2O/6-31G frozen core (245,025 determinants), all 18 Davidson parameter cases and all 216 repeated cross-node runs converged. The measured peak was 560 CPUs on ten nodes. A better-packed 1,008-CPU experiment has been submitted, but it is still pending, so I am not yet claiming a completed thousand-core run. For all-electron H2O/cc-pVDZ without symmetry, the pipeline reaches integral generation, RHF, AO-to-MO transformation, determinant construction, and bounded sparse Hamiltonian execution. The full space contains 1,806,590,016 determinants; one CI vector requires 13.46 GiB, so a converged full-FCI calculation has not been claimed. The initial SOTA survey also shows that the largest classical exact-FCI calculations rely on highly specialized distributed compression, while recent 58–100-qubit quantum-chemistry demonstrations diagonalize selected configuration subspaces rather than the full FCI space. Therefore, qubit count alone is not a fair comparison. For the next week, I plan to:
PT2 and orbital optimization will be treated as the following stage rather than claimed as completed work. |
|
@chenpeizhi Thank you for encouraging us to test the implementation on HPC Algorithmic changes in v0.5.0This release is primarily a solver update, with the large calculations serving
These changes distinguish v0.5.0 from the v0.4.0 deterministic, Continuity from the submitted resultThe original Quantum Harness #129 acceptance remains unchanged:
The post-submission releases built on that fixed baseline. v0.2.0 added H2O/cc-pVDZ validation of the symmetry-resolved solverThe earlier v0.1.1 benchmark intentionally kept point-group symmetry disabled For the v0.5.0 production calculation, the only intentional feasibility change
The A1 sector contains 451,681,246 determinants. SCNet job
The production input, SHA-256, unedited Slurm logs, resource accounting, and Evidence: Additional validation and claim boundariesThe release also includes the 1,002,708-determinant all-electron H2O/DZ The independent SCNet workflow rebuilt and tested the pinned v0.4.0 source A 1,008-CPU gang experiment was submitted with 72 independent solver This release completes the symmetry-scaled exact-FCI and reproducibility part The repository, release, reports, raw records, and CI checks are public and |
|
@chenpeizhi Final corrective audit for the competition submission is now public. This update supersedes any earlier wording that implied the raw Slurm accounting row or the exact production Final claim boundary:
Review entry points: |
|
@chenpeizhi Your review directions became the roadmap for Ranger's strongest From review direction to delivered advance
Ranger's key project algorithmThe coupled-cluster exponential now uses exact ranked subset convolution. Combined with matrix-free FCI, fourfold symmetry-compact addressing, Public review package
Thank you for pushing the project toward scale, efficiency, and a broader |
|
@chenpeizhi — a gentle review reminder and a consolidated status update on the directions you suggested for Issue #129. Delivered since your review
Review entry points: Next-stage research planYour suggestions on reduced-cost FCI accuracy and quantum-computing scale comparison define the next stage:
For planning purposes, the full selected-CI/orbital-optimization program is estimated at 6–8 weeks and approximately 8,000–15,000 CPU core-hours. The literature and scale matrix is estimated at 1–2 weeks and requires little HPC time; it can proceed in parallel. Could you please let us know whether the published exact-FCI/HPC evidence addresses the immediate benchmark request, and whether you would prefer the next implementation milestone to prioritize selected CI + PT2 or the quantum-computing scale comparison? |
第一幕 · 在出发以前,先让工具学会诚实
第五章 · 玉米地外,计算开始弯曲天空
工具终于离开演示问题,进入电子结构的巨大状态空间。行列式、Davidson、FCI、CC 与 MBPT 在 Rust 中接合,
门廊上的计算开始触及玉米地以外弯曲的天空。
← 上一章:让语言学会拒绝漂亮的错误 · 下一章:从答案铺回问题的路 →
Team
Wander: exact CC(8) to 451M-determinant FCI in Rust
Wander transforms three core electronic-structure scaling barriers into three
composable algorithms. The result is a public Rust research engine spanning
FCI, CC, CI, MBPT, UCC, direct integrals, symmetry, deterministic parallelism,
restartable Davidson, and verified HPC execution.
Breakthrough in one view
JunkaiWang-TheoPhy/quantum-harness-129-workbench-rustv0.5.0Three barriers, three algorithms
1. Wave-function construction -> exact ranked subset convolution
The challenge's Taylor construction is upgraded to an excitation-rank
recurrence for
exp(T)|HF>. Wander precomputes alpha/beta partitions, assemblesevery target coefficient from compatible amplitude/source subsets and exact
fermionic phases, and evaluates independent targets in parallel.
This project algorithm powers CC(1)-CC(8), terminates exactly at the finite
electron rank, and is checked coefficient-by-coefficient against the Taylor
oracle. The complete primary CC sequence runs in
186.94 son the recordedApple M4 environment.
2. Hamiltonian scale -> symmetry-compact matrix-free FCI
The spin-free direct sigma kernel applies the Hamiltonian through string links
and same-spin transitions. Compact
ORBSYM/ISYMaddresses propagate acrossFCI, CI, MBPT, CC, and UCC.
For all-electron H2O/cc-pVDZ:
The fourfold exact representation gain preserves every determinant in the
target ground-state sector, all ten electrons, and the same finite-basis
Hamiltonian.
3. Production reproducibility -> deterministic restartable Davidson
Fixed source blocks, thread-local vectors, and ordered reduction make a fixed
parallel policy bitwise repeatable. The primary sigma benchmark records a
3.236817x median timing ratio and a maximum serial/parallel difference of
5.969e-13.Versioned memory/disk stores add atomic checkpoint generations, fingerprints,
memory preflight, and resume. Block Davidson extends the same engine to
several orthogonal roots.
Why this reaches a new scale
The original target contains 245,025 determinants. Wander's final exact sector
contains 451,681,246 determinants - more than 1,800 times the primary space.
Four advances compound:
This integrated algorithmic stack is the reason Wander progresses from a
reference implementation to a 451-million-determinant research result.
Measured result ladder
-76.121174204141980 Eh-76.156699030930056 Eh-76.256624441300147 Eh-76.24321859 EhThe largest solve reaches residual
6.602e-8in 21 Davidson iterations and3:55:43. Same-input PySCF through CCSD(T) supplies a method hierarchy;CCSD(T) lies
0.647144 mEhabove the Rust FCI result.The companion symmetry-free resource characterization covers the full
1,806,590,016-determinant representation,
13.460145 GiBvector size,integral generation, Rust RHF, AO-to-MO, determinant links, and sampled sparse
Hamiltonian columns. Together, the two cc-pVDZ results connect resource theory
to a completed exact calculation.
Primary challenge: 36/36
The submitted H2O/6-31G Hamiltonian contains 12 active spatial orbitals, eight
active electrons, and 245,025 determinants.
-76.121174204141980 Eh.3.025e-10 Eh.7.998e-9 Ehfrom FCI.2.004e-12 Ehfrom FCI.The complete total is 36/36 published entries at the precision printed in
Hirata and Bartlett 2000.
Verified SCNet campaign
The pinned Rust implementation was rebuilt with a fully offline toolchain on
AMD EPYC 7742 nodes.
8.10e-13 Eh.Utilization measurements motivate four 14-thread solver processes per
56-core node. The resulting 1,008-CPU campaign design schedules 72
independent processes across 18 nodes and provides a promising throughput
architecture for large method-development studies.
One Rust engine, many methods
PySCF supplies independent fixture construction and cross-checks. The checked
production algorithms execute in Rust.
Promising research platform
The shared determinant interface prepares a selected-determinant frontier:
The existing exact solver supplies the calibration oracle, symmetry labels,
sparse source action, eigensolver, and evidence schema for this next release.
Public review package
Reviewer tour
scripts/verify-submission.sh.Wander carries the project from equations to algorithms, from algorithms to
451 million determinants, and from one result to a reusable platform for the
next generation of exact and selected electronic-structure methods.