Pith. sign in

REVIEW 3 major objections 6 minor 1 cited by

QB Ground State Energy Estimation Benchmark

T0 review · 3 major / 6 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read An open benchmarking framework claims that a fully optimized classical configuration-interaction solver, SHCI, solves essentially all current test instances, while DMRG handles low-entanglement systems and DF QPE remains resource-limited.

desk verdict The benchmark framework is a real contribution and the paper is honest about its limits, but the 'near-universal solvability' headline rests on an unvalidated ML extrapolation that contradicts the paper's own empirical counts. read the letter →

arxiv 2508.10873 v1 pith:HRS4WQ3F submitted 2025-08-14 quant-ph

Nicole Bellonzi , Joshua T. Cantin , Mohammad Reza Jangrouei , Alexander Kunitsa , Jason Necaise , Nam Nguyen , John Penuel , Maxwell D. Radin
show 9 more authors
Jhonathan Romero Fontalvo Rashmi Sundareswara Linjun Wang Thomas Watts Yanbing Zhou Michael C. Garrett Adam Holmes Artur F. Izmaylov Matthew Otten
This is my paper
classification quant-ph
keywords groundstateenergyestimationquantumchemistrybenchmarkingSHCIDMRGphasesolvabilitypredictionmachinelearning
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper introduces an open, modular benchmarking framework for ground-state energy estimation (GSEE) and uses it to compare three solver families: semistochastic heat-bath configuration interaction (SHCI), density matrix renormalization group (DMRG), and double-factorized quantum phase estimation (DF QPE). Its central claim is that on the current benchmark set, fully optimized SHCI — SHCI with perturbation-theory corrections and orbital optimization — achieves near-universal solvability, while DMRG solves the low-entanglement instances and DF QPE's resource estimates exceed runtime budgets on almost every attempt. The framework measures solvability with a machine-learning pipeline: Hamiltonian features are projected into a latent space, a machine-learning classifier predicts the probability of success at 10,000 synthetic points, and the solvability ratio is the fraction with probability above 0.5. The paper also acknowledges that many of its Hamiltonians come from SHCI-oriented datasets, so the comparison favors classical SHCI, and it proposes adding strongly correlated systems in future versions. If the framework is sound, it gives the field a common yardstick for tracking whether quantum or classical solvers are making real progress on chemically relevant instances.

What carries the argument

The central machinery is the solvability-ratio pipeline: polynomial-time Hamiltonian features (electron count, log FCI dimension, double-factorization rank and eigenvalue gap, Pauli one-norm, Pauli-string count, and interaction-hypergraph statistics) projected by principal component analysis into a low-dimensional latent space; a support-vector machine trained on observed solver successes and failures; and generation of 10,000 new latent points whose inverse-transformed features are scored by the trained model. The solvability ratio is the fraction of those points with predicted success probability above 0.5, and this ratio is the paper's headline measure of how much of the GSEE problem spac

What would settle it

Take a random sample of the 10,000 synthetic latent points, inverse-transform them into Hamiltonian features, construct actual Hamiltonians with those features, and run optimized SHCI on them; if the solved fraction falls well below 1.0000 — for example near the 65% empirical rate in the paper's table — the near-universal solvability claim would be refuted. A cheaper check: hold out a random subset of the 228 benchmark instances, retrain the classifier without them, and compare predicted solvability with the actually solved fraction.

Watch

Extended reading notes

Core claim

The central claim is the QB-GSEE benchmark itself plus the first solvability landscape it produces. On the paper's own terms, solvability is the fraction of a 10,000-point synthetic latent space where a trained classifier predicts more than a 50% chance that the solver returns the ground-state energy within chemical accuracy and within the instance's runtime requirement. Using that measure, SHCI with optimized orbitals and perturbative corrections reaches 1.0000, the only evaluated solver to cover the full problem space; DMRG scores 0.4126, succeeding on low-entanglement systems with a sharp boundary; and DF QPE scores 0.0716, solving only 4 of 131 attempted tasks because estimated runtimes

Load-bearing premise

The whole ranking rests on the assumption that the machine-learning estimate of what fraction of the problem space a solver can handle matches how often the solver would actually succeed on real chemistry problems, even though the generated test points are not checked for physical plausibility.

Editorial extensions

If this is right

  • Fully optimized SHCI (SHCI+PT with orbital optimization) is the only evaluated solver with solvability ratio 1.0000; if the machine-learning extrapolation is trusted, no current benchmark instance class defeats it.
  • Merely lowering the SHCI variational threshold is not enough: the paper's numbers show a modest gain in tasks solved, while the jump to full latent-space coverage comes from orbital optimization and perturbative corrections.
  • DMRG's sharper solvability boundary identifies low-entanglement systems as its reliable territory, so DMRG-based reference energies are safest for those instances.
  • DF QPE resource estimates exceed the runtime budget on 127 of 131 attempted tasks, meaning fault-tolerant quantum phase estimation at current double-factorization costs and hardware assumptions is not competitive on this benchmark set.
  • Because the current dataset is SHCI-biased, the benchmark's rankings cannot yet be read as a general statement about quantum versus classical advantage; the paper proposes adding strongly correlated, multi-reference systems to correct this.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper's own table reports only 148 of 226 empirical successes for optimized SHCI, so the 1.0000 solvability ratio is an extrapolation; a reader should not interpret it as a measured success rate, and the gap suggests the classifier's decision boundary may be optimistic.
  • If the synthetic latent points do not correspond to physically plausible Hamiltonians — the paper states no such validity filter exists yet — the solvability ratio could overstate coverage by sampling regions no real chemistry occupies; adding a validity filter or a held-out empirical check would settle this.
  • The same feature-plus-classifier pipeline could be used to actively select new benchmark instances near the current decision boundaries, sharpening the solvability maps and reducing the SHCI bias faster than adding random molecules.
  • For quantum solvers, the framework could pre-register algorithmic improvements (for example, tensor hypercontraction or symmetry-shift preprocessing) as new solver entries, giving a quantitative target for when QPE becomes competitive on existing classical instances.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper introduces QB-GSEE, an open benchmarking framework for Ground State Energy Estimation (GSEE), with a standardized problem-instance database, polynomial-time Hamiltonian features, and machine-learning-based solvability analysis. It presents case studies for three solver families: SHCI variants, DMRG, and DF QPE resource estimates. The paper's central claim, stated in the abstract and Section 2.2, is that fully optimized SHCI achieves near-universal solvability on the benchmark set, DMRG is competitive for low-entanglement systems, and DF QPE is currently limited by runtime and hardware constraints. The authors also explicitly acknowledge in Section 3 that the current dataset is biased toward SHCI-related instances, and they propose future expansion to more strongly correlated systems.

Significance. If the quantitative claims were supported, this would be a useful open infrastructure for comparing GSEE solvers: the repository is public, the schema is standardized, and the inclusion of DMRG and DF QPE resource estimates provides a broader view than most existing benchmarks. The paper's strength is its modular design and its explicit admission of dataset bias. However, the headline 'near-universal solvability' rests on an unvalidated machine-learning extrapolation over synthetic latent-space points, and the paper's own empirical counts contradict that headline. With validation and reframing, the benchmark could still make a solid contribution; as written, the central claim is not supported.

major comments (3)
  1. [Table 2.1, §2.2, Algorithm 1, Appendix B.2] The '1.0000 solvability' for SHCI Opt is not an empirical result. It is the fraction of 10,000 synthetic latent-space points for which an SVM predicts a probability greater than 0.5 (Algorithm 1, §4.4). Appendix B.2 explicitly states that 'we do not yet have a filter for true physical validity for the generated points,' and no calibration or held-out validation of the SVM probabilities is reported. The same table reports 148/226 tasks solved (65%), while the prose in §2.2 says SHCI Opt 'achieves universal solvability' and 'very few problem instances remain unsolved.' This contradiction is load-bearing because the abstract's central claim rests on the ML-derived 1.0000, not on the empirical pass count.
  2. [Table 2.1] The reported solvability ratios are not monotone in the empirical task counts. SHCI 2e-4 has ratio 0.8125 with 83/228 solved; SHCI 1e-4 has ratio 0.6562 with 91/228 solved; SHCI 2e-5 has ratio 0.6486 with 128/228 solved; SHCI Opt has ratio 1.0000 with 148/226 solved. A metric intended to measure solver capability should track empirical success rates more closely. Without calibration, held-out validation, or at least reporting both empirical fractions and ML ratios side by side, the ML-derived ratios cannot be interpreted as 'solvability.' The paper should either validate the SVM probabilities on held-out instances or restrict the headline claims to empirical pass rates.
  3. [§3, §4.4] The dataset-composition circularity is a correctness risk for the central claim. Section 3 admits that many Hamiltonians are drawn from prior SHCI-centric studies, and the pass/fail labels are produced by running SHCI-type solvers on those instances. The ML model is then trained on those labels, and the solvability ratio is computed over synthetic points in the bounding box of the observed data. This makes the 'near-universal solvability' claim largely an echo of the benchmark's construction. I am not claiming the authors are being disingenuous; rather, the paper needs a concrete test of generalization, e.g., held-out instances from independent sources or an explicit demonstration that the ML decision boundary is stable when the training set is resampled. Without such a test, the headline is not about GSEE solvability in general but about this particular curated set.
minor comments (6)
  1. [Abstract] Typo: 'ighlighting' should be 'highlighting'.
  2. [§4.4 and Algorithm 1] There is an inconsistency: §4.4 says PCA was ultimately chosen, while Algorithm 1 step 4 specifies Non-Negative Matrix Factorization (NNMF), and Appendix B.2 also discusses NNMF. Please clarify which latent-space method was used for the results in Table 2.1 and Figures 2.1–2.2.
  3. [§4.4] The phrase 'principle component analysis' appears; it should be 'principal component analysis.'
  4. [Table 2.1] SHCI Opt reports 226 tasks attempted while all other rows report 228. The discrepancy should be explained in the text, especially since it affects the empirical 65% figure.
  5. [§2.2] The sentence 'Lowering ε_var increases the number of tasks solved, but it only results in a 17% improvement over SHCI 2e-5' is unclear; the relative increase from 128 to 148 is approximately 15.6%, not 17%, and it would help to state the comparison explicitly.
  6. [Appendix C.2] The paper notes that for DF QPE, 'solved' means resource estimates are below a runtime threshold, not that the DF-QPE answer was checked against the reference energy. This is an important distinction; consider making it more prominent in the main text, not only in Section 2.3.

Circularity Check

1 steps flagged · score 6.0 of 10

The headline SHCI solvability is an unvalidated ML extrapolation: Table 2.1's 'Solvability' column is the SVM's predicted fraction over synthetic latent points, not the empirical 148/226, so the central claim is a fitted-model output called a prediction.

  1. fitted input called prediction [Section 4.4 (Algorithm 1, steps 3, 5-8) and Table 2.1; Appendix B.2]
    "A Support Vector Machine (SVM) classifier is trained on benchmark data to distinguish between solvable and unsolvable problem instances. Once trained, the model is used to generate 10,000 novel test points in the latent space and predict their probability of being solvable. The solvability ratio is then computed as the fraction of points exceeding a predefined probability threshold of 0.5. ... we do not yet have a filter for true physical validity for the generated points."

    The Table 2.1 'Solvability' value for SHCI Opt (1.0000) is not the measured pass rate on the 226 attempted tasks (148/226 = 65%); it is the fraction of 10,000 synthetic latent-space points that the SVM—trained on the same solver's pass/fail labels—labels as >50% likely solvable. The synthetic points are generated in the latent bounding box and inverse-transformed without a physical-validity filter (App. B.2), so the number is a property of the fitted model, not an independent result. The ratio is non-monotonic in empirical solved counts (SHCI 2e-4: 0.8125 with 83 solved; SHCI 2e-5: 0.6486 with 128 solved), confirming it tracks the model/latent space rather than solver performance. The headline 'near-universal solvability' is thus a fitted-model output, presented as a benchmark measurement.

full rationale

The paper's core empirical contribution—the open QB-GSEE repository and the feature/solvability pipeline—is not circular in itself. However, the central claim that 'fully optimized SHCI achieves near-universal solvability on the benchmark set' rests on the ML solvability ratio in Table 2.1, which is computed by Algorithm 1 as the SVM's predicted fraction over 10,000 synthetic latent points. Appendix B.2 explicitly states there is no filter for true physical validity of generated points, and no calibration or held-out validation of the SVM probabilities is reported. The table's own empirical count (148/226) contradicts the 1.0000 value, and the ratio is non-monotonic in the number of tasks solved, so the ratio is not a proxy for empirical success. The dataset composition also amplifies the self-referential character: Section 3 admits 'many of the Hamiltonians in the current dataset originate from prior studies evaluating SHCI and related algorithms, creating a bias in its favor.' Taken together, the headline result is a fitted-model output and an echo of the benchmark's SHCI-centric construction, rather than an independent, validated measurement. The DMRG and DF QPE comparisons are largely empirical/resource-estimate results and do not exhibit the same circularity; the framework's infrastructure value is independent of the unsupported solvability extrapolation.

Assumptions & free parameters 5 free parameters · 6 assumptions · 0 invented entities

The paper introduces no new physical entities, forces, or conserved quantities. The only 'inventions' are synthetic Hamiltonian instances with planted solutions from the companion paper (ref [31]), which are benchmark artifacts with exactly known ground states, not physical postulates. The framework's headline solvability numbers rest on several choices and unproven premises beyond the solver runs themselves: the 0.5 probability threshold, the latent-space bounding box used to generate synthetic points, unstated per-instance runtime budgets, the 1 mHa DF truncation, and the DMRG first-run protocol. On the physics side, the GSEE promise-problem form, the accuracy of reference energies, the negligible-truncation-error assumption, and the representativeness of the JW-encoded Pauli features are all assumed rather than demonstrated.

free parameters (5)
  • Solvability probability threshold = 0.5
    Algorithm 1 step 8: solvability ratio equals the fraction of 10,000 generated latent points with predicted probability >= 0.5. This threshold directly sets all headline solvability ratios in Table 2.1; no sensitivity analysis is reported.
  • Latent-space bounding box and sampling resolution = min-max of latent W, resolution r (unstated), 10,000 points
    Algorithm 1 steps 4-5: synthetic points are drawn inside the min-max box of the latent coordinates, so the box geometry and resolution directly control the reported fractions. Appendix B.2 admits 'we do not yet have a filter for true physical validity for the generated points'.
  • Per-instance runtime requirement ('solved' threshold) = unstated
    Section 2 and Table 2.1: 'solved' requires computing the energy within chemical accuracy within each Hamiltonian's runtime requirement, but the per-instance runtime budgets are never specified, although they decide pass/fail for every solver including DF QPE.
  • DF QPE truncation threshold = 1 mHa
    Appendix C.2: fixed double-factorization truncation at 1 mHa, with truncation error assumed negligible. This choice sets the DF QPE resource estimates and hence the 4/131 pass count.
  • DMRG bond-dimension ramp protocol = initial bond dimension 4, +10% steps, 23.5 h cap, 5e-5 Ha convergence
    Appendix C.1: the DMRG performer caps runtime at 23.5 h and accepts the lowest variational energy, including runs that converge to excited states. The 0.4126 solvability reflects this protocol, not DMRG's best achievable performance, as the paper concedes.
assumptions (6)
  • domain assumption GSEE promise-problem structure (Eq. 2): an easy-to-prepare state with overlap xi and spectral gap Delta exist for every benchmark instance.
    Section 4.1: the formal GSEE definition assumes these; no per-instance verification is reported.
  • domain assumption Reference energies in the instance database are accurate to within chemical accuracy.
    Section 4.3: 'we aimed for all reference energies to be within chemical accuracy, this was not fully achievable in every case.' Pass/fail labels inherit this uncertainty.
  • ad hoc to paper The PCA/NNMF latent space bounded by the observed data's min-max spans the space of GSEE problems, so the solvability ratio over 10,000 synthetic points estimates the true solvable fraction.
    Section 4.4 and Appendix B.2: the paper admits 'we do not yet have a filter for true physical validity for the generated points'; the reported 1.0000 solvability for SHCI Opt is this extrapolation, not an empirical rate.
  • domain assumption The double-factorization truncation error at 1 mHa is negligible for all 131 DF QPE instances.
    Appendix C.2: 'the error introduced by this truncation is assumed to be negligible', relying on prior studies rather than per-instance checks.
  • domain assumption Pauli-string features are comparable across instances despite dependence on the Jordan-Wigner encoding.
    Appendix A.2: 'the Pauli string features we define are only comparable with molecular GSEE instances that use the same encoding'; the benchmark fixes JW for all instances, constraining the feature space's generality.
  • ad hoc to paper SVM probability outputs are calibrated enough to threshold at 0.5 and interpret as solvability probabilities.
    Algorithm 1 and Section 4.4: no calibration step or held-out validation of the probability estimates is reported, yet ratios are quoted to four decimals in Table 2.1.

how reviews work

0 comments
Cite this review

Pith. "Pith review of QB Ground State Energy Estimation Benchmark." pith.science (2026). https://pith.science/paper/HRS4WQ3F

@misc{pith2026250810873,
  author       = {Pith},
  title        = {Pith review of: QB Ground State Energy Estimation Benchmark},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HRS4WQ3F}},
  note         = {Machine review of arXiv:2508.10873}
}
read the original abstract

Ground State Energy Estimation (GSEE) is a central problem in quantum chemistry and condensed matter physics, demanding efficient algorithms to solve complex electronic structure calculations. This work introduces a structured benchmarking framework for evaluating the performance of both classical and quantum solvers on diverse GSEE problem instances. We assess three prominent methods -- Semistochastic Heat-Bath Configuration Interaction (SHCI), Density Matrix Renormalization Group (DMRG), and Double-Factorized Quantum Phase Estimation (DF QPE) -- ighlighting their respective strengths and limitations. Our results show that fully optimized SHCI achieves near-universal solvability on the benchmark set, DMRG excels for low-entanglement systems, and DF QPE is currently constrained by hardware and algorithmic limitations. However, we observe that many benchmark Hamiltonians are drawn from datasets tailored to SHCI and related approaches, introducing a bias that favors classical solvers. To mitigate this, we propose expanding the benchmark suite to include more challenging, strongly correlated systems to enable a more balanced and forward-looking evaluation of solver capabilities. As quantum hardware and algorithms improve, this benchmarking framework will serve as a vital tool for tracking progress and identifying domains where quantum methods may surpass classical techniques. The QB-GSEE benchmark repository is openly available at https://github.com/isi-usc-edu/qb-gsee-benchmark [1]. By maintaining a scalable and open resource, we aim to accelerate innovation in computational quantum chemistry and quantum computing.

Figures

Figures reproduced from arXiv: 2508.10873 by the authors.

Figure 1.1
Figure 1.1. Overview of the main components of the GSEE benchmark repository [ [PITH_FULL_IMAGE:figures/full_fig_p004_1_1.png] view at source ↗
Figure 2.1
Figure 2.1. Solvability regions for SHCI with different [PITH_FULL_IMAGE:figures/full_fig_p007_2_1.png] view at source ↗
Figure 2.2
Figure 2.2. Solvability for classical and quantum methods. [PITH_FULL_IMAGE:figures/full_fig_p008_2_2.png] view at source ↗
Figures from the paper (3 more)
Figure 2.3
Figure 2.3. Figure 2.3: Principal Component Analysis (PCA) contributions for the solvability regions. The most [PITH_FULL_IMAGE:figures/full_fig_p009_2_3.png]
Figure 4.1
Figure 4.1. Figure 4.1: Hamiltonian features correlation matrix [ [PITH_FULL_IMAGE:figures/full_fig_p013_4_1.png]
Figure 4.2
Figure 4.2. Figure 4.2: Histogram of the number of spatial orbitals in the problem instances, showing the distri [PITH_FULL_IMAGE:figures/full_fig_p015_4_2.png]

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers

    quant-ph 2026-06 unverdicted novelty 5.0 of 10

    An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for qua...

Reference graph

Works this paper leans on

96 extracted references · 34 canonical work pages · cited by 1 Pith paper

  1. [1]

    QB-GSEE-Benchmark

    John Penuel et al. QB-GSEE-Benchmark. https : / / github . com / isi - usc - edu / qb - gsee - benchmark. 2025

    2025

  2. [2]

    Google Quantum Roadmap

    Google. Google Quantum Roadmap. https://quantumai.google/roadmap. Accessed: 2024-12- 09

    2024

  3. [3]

    Microsoft Quantum Roadmap

    Microsoft. Microsoft Quantum Roadmap. https://quantum.microsoft.com/en- us/vision/ quantum-roadmap. Accessed: 2024-12-09

    2024

  4. [4]

    IBM Quantum Roadmap

    IBM. IBM Quantum Roadmap. https://www.ibm.com/roadmaps/quantum/ . Accessed: 2024- 12-09

    2024

  5. [6]

    Version v1.1.0

    J Maxwell Silvester et al.varbench/varbench: v1.1.0. Version v1.1.0. Aug. 2024.doi: 10.5281/ zenodo.13377360. url: https://doi.org/10.5281/zenodo.13377360. 25

    work page doi:10.5281/zenodo.13377360 2024

  6. [7]

    Assessment of Gaussian-2 and density functional theories for the com- putation of enthalpies of formation

    Larry A. Curtiss et al. “Assessment of Gaussian-2 and density functional theories for the com- putation of enthalpies of formation”. In:The Journal of Chemical Physics106.3 (Jan. 1997), pp. 1063–1079. issn: 0021-9606. doi: 10.1063/1.473182. eprint: https://pubs.aip.org/aip/ jcp/article-pdf/106/3/1063/19100768/1063\_1\_online.pdf. url: https://doi.org/10. ...

    doi:10.1063/1.473182 1997

  7. [8]

    Assessment of Gaussian-2 and density functional theories for the com- putation of ionization potentials and electron affinities

    Larry A. Curtiss et al. “Assessment of Gaussian-2 and density functional theories for the com- putation of ionization potentials and electron affinities”. In:The Journal of Chemical Physics 109.1 (July 1998), pp. 42–55. issn: 0021-9606. doi: 10 . 1063 / 1 . 476538. eprint: https : / / pubs . aip . org / aip / jcp / article - pdf / 109 / 1 / 42 / 19137091 ...

    doi:10.1063/1.476538 1998

  8. [9]

    Application-Oriented Performance Benchmarks for Quantum Comput- ing

    Thomas Lubinski et al. “Application-Oriented Performance Benchmarks for Quantum Comput- ing”. In: IEEE Transactions on Quantum Engineering4 (2023), pp. 1–32.doi: 10.1109/TQE. 2023.3253761

    arXiv 2023

Show all 96 references
  1. [10]

    url: https://arxiv.org/abs/2402.08985

    Thomas Lubinski et al.Quantum Algorithm Exploration using Application-Oriented Performance Benchmarks.2024.arXiv: 2402.08985 [quant-ph]. url: https://arxiv.org/abs/2402.08985

    2024 arXiv

  2. [11]

    Benchmarking a trapped-ion quantum computer with 30 qubits

    Jwo-Sy Chen et al. “Benchmarking a trapped-ion quantum computer with 30 qubits”. In:Quan- tum 8 (Nov. 2024), p. 1516. issn: 2521-327X. doi: 10 . 22331 / q - 2024 - 11 - 07 - 1516. url: https://doi.org/10.22331/q-2024-11-07-1516

    2024 doi

  3. [12]

    Etienne Granet and Henrik Dreyer.AppQSim: Application-oriented benchmarks for Hamiltonian simulation on a quantum computer. 2025. arXiv:2503.04298 [quant-ph]. url: https://arxiv. org/abs/2503.04298

    2025

  4. [13]

    Avimita Chatterjee et al.A Comprehensive Cross-Model Framework for Benchmarking the Per- formance of Quantum Hamiltonian Simulations. 2024. arXiv: 2409 . 06919 [quant-ph]. url: https://arxiv.org/abs/2409.06919

    2024 arXiv

  5. [14]

    SupermarQ: A Scalable Quantum Benchmark Suite

    Teague Tomesh et al. “SupermarQ: A Scalable Quantum Benchmark Suite”. In: 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA). 2022, pp. 587–

    2022

  6. [15]

    QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation

    Ang Li et al. “QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation”. In: ACM Transactions on Quantum Computing4.2 (Feb. 2023). doi: 10 . 1145 / 3550488. url: https://doi.org/10.1145/3550488

    2023 doi

  7. [16]

    Oversimplifying quantum factoring

    John A. Smolin, Graeme Smith, and Alexander Vargo. “Oversimplifying quantum factoring”. In: Nature 499.7457 (July 2013), pp. 163–165.issn: 1476-4687. doi: 10.1038/nature12290. url: http://dx.doi.org/10.1038/nature12290

    2013 doi

  8. [17]

    Debunking Algorithmic Qubits

    Quantinuum. Debunking Algorithmic Qubits. Accessed: 2025-03-13. 2024. url: https://www. quantinuum.com/blog/debunking-algorithmic-qubits

    2025

  9. [18]

    Quantum Benchmarking Problem Instance File Schema

    John Penuel et al. Quantum Benchmarking Problem Instance File Schema. https://github. com/isi-usc-edu/qb-gsee-benchmark/raw/refs/heads/main/schemas/problem_instance. schema.0.0.1.json

  10. [19]

    Support-VectorNetworks

    CorinnaCortesandVladimirNaumovichVapnik.“Support-VectorNetworks”.In: Machine Learn- ing 20 (1995), pp. 273–297.url: https://api.semanticscholar.org/CorpusID:52874011

    1995

  11. [20]

    The GSEE Benchmark Standard Report

    John Penuel et al. The GSEE Benchmark Standard Report. Accessed: 2025-03-15. 2024. url: https://github.com/isi-usc-edu/qb-gsee-benchmark/tree/main/standard_report . 26

    2025

  12. [21]

    isi-usc-edu/pyLIQTR: Release 1.1.1

    rroodll et al. isi-usc-edu/pyLIQTR: Release 1.1.1. Version v1.1.1. Apr. 2024. doi: 10 . 5281 / zenodo.10913397. url: https://doi.org/10.5281/zenodo.10913397

    2024 doi

  13. [22]

    Harrigan et al.Expressing and Analyzing Quantum Algorithms with Qualtran

    Matthew P. Harrigan et al.Expressing and Analyzing Quantum Algorithms with Qualtran. 2024. arXiv: 2409.04643 [quant-ph]. url: https://arxiv.org/abs/2409.04643

    2024 arXiv

  14. [23]

    OpenFermion:theelectronicstructurepackageforquantumcomputers

    JarrodRMcCleanetal.“OpenFermion:theelectronicstructurepackageforquantumcomputers”. In: Quantum Science and Technology5.3 (June 2020), p. 034014.doi: 10.1088/2058- 9565/ ab8ebc. url: https://dx.doi.org/10.1088/2058-9565/ab8ebc

    2020 doi

  15. [24]

    Solvability Region using PCA embedding for SHCI with eps_var 2e-4.Accessed: 2025-03-15

    JohnPenueletal. Solvability Region using PCA embedding for SHCI with eps_var 2e-4.Accessed: 2025-03-15. 2024. url: https://github.com/isi-usc-edu/qb-gsee-benchmark/blob/main/ standard_report/supporting_artifacts/PCA_embedding_plot_solver_0db183e3- a86d- 491b-9125-599556e37c7a.png

    2025

  16. [25]

    Solvability Region using PCA embedding for SHCI with eps_var 1e-4.Accessed: 2025-03-15

    JohnPenueletal. Solvability Region using PCA embedding for SHCI with eps_var 1e-4.Accessed: 2025-03-15. 2024. url: https://github.com/isi-usc-edu/qb-gsee-benchmark/blob/main/ standard_report/supporting_artifacts/PCA_embedding_plot_solver_7e730dfb- 57ee- 480b-a8a1-4b73f5f07c54.png

    2025

  17. [26]

    Solvability Region using PCA embedding for SHCI with eps_var 2e-5.Accessed: 2025-03-15

    JohnPenueletal. Solvability Region using PCA embedding for SHCI with eps_var 2e-5.Accessed: 2025-03-15. 2024. url: https://github.com/isi-usc-edu/qb-gsee-benchmark/blob/main/ standard_report/supporting_artifacts/PCA_embedding_plot_solver_86bfe50c- 9342- 4d54-bb68-abc8abd95688.png

    2025

  18. [27]

    Solvability Region using PCA embedding for SHCI with optimized orbitals followed by SHCI+PT

    John Penuel et al. Solvability Region using PCA embedding for SHCI with optimized orbitals followed by SHCI+PT. Accessed: 2025-03-15. 2024. url: https : / / github . com / isi - usc - edu / qb - gsee - benchmark / blob / main / standard _ report / supporting _ artifacts / PCA ...

    2025

  19. [28]

    Accessed: 2025-03-15

    John Penuel et al.Solvability Region using PCA embedding for DMRG with the lowest variational energy. Accessed: 2025-03-15. 2024. url: https : / / github . com / isi - usc - edu / qb - gsee - benchmark / blob / main / standard _ report / supporting _ artifacts / PCA _ embeddin...

    2025

  20. [29]

    Solvability Region using PCA embedding for double factorized QPE resource estimates

    John Penuel et al. Solvability Region using PCA embedding for double factorized QPE resource estimates. Accessed: 2025-03-15. 2024. url: https://github.com/isi- usc- edu/qb- gsee- benchmark / blob / main / standard _ report / supporting _ artifacts / PCA _ embedding _ plot _ s...

    2025

  21. [30]

    Hamiltonian Features Correlation Matrix

    John Penuel et al. Hamiltonian Features Correlation Matrix. Accessed: 2025-03-15. 2024.url: https://github.com/isi- usc- edu/qb- gsee- benchmark/blob/main/standard_report/ supporting_artifacts/hamiltonian_features_correlation_matrix_plot.png

    2025

  22. [31]

    Planted Solutions in Quantum Chemistry: Generating Non-Trivial Hamilto- nians with Known Ground States

    Linjun Wang et al. Planted Solutions in Quantum Chemistry: Generating Non-Trivial Hamilto- nians with Known Ground States. 2025. arXiv:2507.15166 [quant-ph]. url: http://arxiv. org/abs/2507.15166

    2025

  23. [32]

    Distributed implementation of full configuration interaction for one trillion determinants

    Hong Gao et al. “Distributed implementation of full configuration interaction for one trillion determinants”. In:Journal of Chemical Theory and Computation20.3 (2024), pp. 1185–1192

    2024

  24. [33]

    The Ground State Electronic Energy of Benzene

    Janus J. Eriksen et al. “The Ground State Electronic Energy of Benzene”. In:The Journal of Physical Chemistry Letters11.20 (2020). PMID: 33022176, pp. 8922–8929.doi: 10.1021/acs. jpclett.0c02621. eprint: https://doi.org/10.1021/acs.jpclett.0c02621 . url: https: //doi.org/10.10...

    2020 doi

  25. [34]

    The Chromium Dimer: Closing a Chapter of Quantum Chemistry

    Henrik R. Larsson et al. “The Chromium Dimer: Closing a Chapter of Quantum Chemistry”. In: Journal of the American Chemical Society144.35 (2022). PMID: 36001866, pp. 15932–15937. doi: 10 . 1021 / jacs . 2c06357. eprint: https : / / doi . org / 10 . 1021 / jacs . 2c06357. url: ...

    2022 doi

  26. [35]

    Excited states of methylene, polyenes, and ozone from heat-bath configu- ration interaction

    Alan D Chien et al. “Excited states of methylene, polyenes, and ozone from heat-bath configu- ration interaction”. In:The Journal of Physical Chemistry A122.10 (2018), pp. 2714–2722

    2018

  27. [36]

    Variational benchmarks for quantum many-body problems

    Dian Wu et al. “Variational benchmarks for quantum many-body problems”. In:Science 386.6719 (Oct. 2024), pp. 296–301.issn: 1095-9203. doi: 10.1126/science.adg9774. url: http://dx. doi.org/10.1126/science.adg9774

    2024 doi

  28. [37]

    Nicole Bellonzi et al.Feasibility of accelerating homogeneous catalyst discovery with fault-tolerant quantum computers. 2024. arXiv: 2406.06335v1 [quant-ph] . url: https://arxiv.org/abs/ 2406.06335v1

    2024

  29. [38]

    Nam Nguyen et al.Quantum computing for corrosion-resistant materials and anti-corrosive coat- ings design. 2024. arXiv:2406.18759 [quant-ph]. url: https://arxiv.org/abs/2406.18759

    2024 arXiv

  30. [39]

    QuantumResourcesRequiredforBindingAffinityCalculationsofAmyloid beta

    MatthewOttenetal.“QuantumResourcesRequiredforBindingAffinityCalculationsofAmyloid beta”. In:arXiv preprint arXiv:2406.18744(2024)

    2024 arXiv

  31. [40]

    Number of Orbitals Histogram

    John Penuel et al. Number of Orbitals Histogram. Accessed: 2025-03-15. 2024.url: https:// github.com/isi-usc-edu/qb-gsee-benchmark/blob/main/standard_report/supporting_ artifacts/num_orbitals_histogram.png

    2025

  32. [41]

    Jolliffe

    Ian T. Jolliffe. Principal Component Analysis. 2nd. Springer Series in Statistics. Springer, 2002. isbn: 978-0-387-95442-4. doi: 10.1007/b98835

    2002 doi

  33. [42]

    Quantum Parameterized Complexity.2022.arXiv: 2203.08002 [quant-ph]

    MichaelJ.Bremneretal. Quantum Parameterized Complexity.2022.arXiv: 2203.08002 [quant-ph]. url: https://arxiv.org/abs/2203.08002

    2022 arXiv

  34. [43]

    Low-Depth Quantum Simulation of Materials

    Ryan Babbush et al. “Low-Depth Quantum Simulation of Materials”. In:Physical Review X8 (2017), p. 011044.url: https://api.semanticscholar.org/CorpusID:4147326

    2017

  35. [44]

    Hybrid grid/basis set discretizations of the Schrödinger equation

    Steven R. White. “Hybrid grid/basis set discretizations of the Schrödinger equation.” In:The Journal of chemical physics147 24 (2017), p. 244102.url: https://api.semanticscholar. org/CorpusID:35065533

    2017

  36. [45]

    Ostlund.Modern Quantum Chemistry: Introduction to Advanced Elec- tronic Structure Theory

    Attila Szabó and Neil S. Ostlund.Modern Quantum Chemistry: Introduction to Advanced Elec- tronic Structure Theory. McGraw-Hill, 1982. url: https : / / api . semanticscholar . org / CorpusID:94743139

    1982

  37. [46]

    Low rank representations for quantum simulation of electronic structure

    Mario Motta et al. “Low rank representations for quantum simulation of electronic structure”. In: npj Quantum Information7.1(May2021). issn:2056-6387. doi: 10.1038/s41534-021-00416-z. url: http://dx.doi.org/10.1038/s41534-021-00416-z

    doi

  38. [47]

    Encoding Electronic Spectra in Quantum Circuits with Linear T Complex- ity

    Ryan Babbush et al. “Encoding Electronic Spectra in Quantum Circuits with Linear T Complex- ity”. In:Physical Review X8.4 (Oct. 2018).issn: 2160-3308.doi: 10.1103/physrevx.8.041015. url: http://dx.doi.org/10.1103/PhysRevX.8.041015

    2018 doi

  39. [48]

    Even More Efficient Quantum Computations of Chemistry Through Ten- sor Hypercontraction

    Joonho Lee et al. “Even More Efficient Quantum Computations of Chemistry Through Ten- sor Hypercontraction”. In: PRX Quantum 2.3 (July 2021). issn: 2691-3399. doi: 10 . 1103 / prxquantum.2.030305. url: http://dx.doi.org/10.1103/PRXQuantum.2.030305. 28

    2021 doi

  40. [49]

    Watts et al.Fullerene-encapsulated Cyclic Ozone for the Next Generation of Nano- sized Propellants via Quantum Computation

    Thomas W. Watts et al.Fullerene-encapsulated Cyclic Ozone for the Next Generation of Nano- sized Propellants via Quantum Computation. 2024. arXiv:2408.13244 [quant-ph]. url: https: //arxiv.org/abs/2408.13244

    2024 arXiv

  41. [50]

    Ground-State Preparation and Energy Estimation on Early Fault-Tolerant Quantum Computers via Quantum Eigenvalue Transformation of Unitary Matrices

    Yulong Dong, Lin Lin, and Yu Tong. “Ground-State Preparation and Energy Estimation on Early Fault-Tolerant Quantum Computers via Quantum Eigenvalue Transformation of Unitary Matrices”. In: PRX Quantum 3.4 (Oct. 2022). issn: 2691-3399. doi: 10.1103/prxquantum.3. 040305. url: ht...

    2022 doi

  42. [51]

    Heisenberg-Limited Ground-State Energy Estimation for Early Fault- TolerantQuantumComputers

    Lin Lin and Yu Tong. “Heisenberg-Limited Ground-State Energy Estimation for Early Fault- TolerantQuantumComputers”.In: PRX Quantum(2021). url: https://api.semanticscholar. org/CorpusID:232013439

    2021

  43. [53]

    Laura Clinton et al.Quantum Phase Estimation without Controlled Unitaries. 2024. arXiv:2410. 21517 [quant-ph]. url: https://arxiv.org/abs/2410.21517

    2024 arXiv

  44. [54]

    Efficient Strategies for Reducing Sampling Error in Quantum Krylov Subspace Diagonalization

    GwonhakLeeetal. Efficient Strategies for Reducing Sampling Error in Quantum Krylov Subspace Diagonalization. 2024. arXiv: 2409.02504 [quant-ph] . url: https://arxiv.org/abs/2409. 02504

    2024 arXiv

  45. [55]

    Quantum Krylov subspace algorithms for ground- and excited-stateenergyestimation

    Cristian L. Cortes and Stephen K. Gray. “Quantum Krylov subspace algorithms for ground- and excited-stateenergyestimation”.In: Physical Review A(2021). url: https://api.semanticscholar. org/CorpusID:237503498

    2021

  46. [56]

    Quantum Filter Diagonalization: Quantum Eigendecomposition without Full Quantum Phase Estimation

    Robert M. Parrish and Peter Leonard McMahon. “Quantum Filter Diagonalization: Quantum Eigendecomposition without Full Quantum Phase Estimation”. In: arXiv: Quantum Physics (2019). url: https://api.semanticscholar.org/CorpusID:202677212

    2019

  47. [57]

    ÜberdasPaulischeÄquivalenzverbot

    PaulJordanandEugenWigner. “ÜberdasPaulischeÄquivalenzverbot”. In: Zeitschrift für Physik 47 (1928), pp. 631–651.url: https://api.semanticscholar.org/CorpusID:126400679

    1928

  48. [58]

    Fermionic Quantum Computation

    Sergey Bravyi and Alexei Y. Kitaev. “Fermionic Quantum Computation”. In:Annals of Physics 298 (2000), pp. 210–226.url: https://api.semanticscholar.org/CorpusID:16532321

    2000

  49. [59]

    Optimal fermion-to-qubit mapping via ternary trees with applications to re- ducedquantumstateslearning

    Zhang Jiang et al. “Optimal fermion-to-qubit mapping via ternary trees with applications to re- ducedquantumstateslearning”.In: Quantum 4(2019),p.276. url: https://api.semanticscholar. org/CorpusID:204852223

    2019

  50. [60]

    Superfast encodings for fermionic quantum simulation

    Kanav Setia et al. “Superfast encodings for fermionic quantum simulation”. In:Physical Review Research (2018). url: https://api.semanticscholar.org/CorpusID:53593478

    2018

  51. [61]

    A Sierpinski Triangle Fermion-to-Qubit Transform

    Brent Harrison et al. A Sierpinski Triangle Fermion-to-Qubit Transform. Preprint. 2024. url: https://api.semanticscholar.org/CorpusID:272463572

    2024

  52. [62]

    Compact fermion to qubit mappings

    Charles Derby et al. “Compact fermion to qubit mappings”. In:Physical Review B104.3 (July 2021). issn: 2469-9969. doi: 10.1103/physrevb.104.035118 . url: http://dx.doi.org/10. 1103/PhysRevB.104.035118

    2021 doi

  53. [63]

    A Compact Fermion to Qubit Mapping Part 2: Alternative Lattice Geometries

    Charles Derby and Joel Klassen. A Compact Fermion to Qubit Mapping Part 2: Alternative Lattice Geometries. 2021. arXiv: 2101 . 10735 [quant-ph]. url: https : / / arxiv . org / abs / 2101.10735. 29

    2021 arXiv

  54. [65]

    Reducing the qubit requirement of Jordan-Wigner encodings ofN-mode, K-fermion systems from N to ⌈log2 N K ⌉

    Brent Harrison et al. Reducing the qubit requirement of Jordan-Wigner encodings ofN-mode, K-fermion systems from N to ⌈log2 N K ⌉. 2023. arXiv: 2211.04501 [quant-ph] . url: https: //arxiv.org/abs/2211.04501

    2023 arXiv

  55. [66]

    Qubit-efficient encoding scheme for quantum simulations of electronic structure

    Yu Shee et al. “Qubit-efficient encoding scheme for quantum simulations of electronic structure”. In: Phys. Rev. Res.4 (2 May 2022), p. 023154.doi: 10.1103/PhysRevResearch.4.023154. url: https://link.aps.org/doi/10.1103/PhysRevResearch.4.023154

    2022 doi

  56. [67]

    Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer

    Nikolaj Moll et al. “Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer”. In:Journal of Physics A: Mathematical and Theoretical 49.29 (June 2016), p. 295301.doi: 10.1088/1751-8113/49/29/295301. url: https://dx.doi. org/10....

    2016 doi

  57. [68]

    Joseph Carolan and Luke Schaeffer.Succinct Fermion Data Structures. 2024. arXiv:2410.04015 [quant-ph]. url: https://arxiv.org/abs/2410.04015

    2024 arXiv

  58. [69]

    Guaranteed Global Minimum of Electronic Hamiltonian 1-Norm via Linear Programming in the Block Invariant Symmetry Shift (BLISS) Method

    Smik Patel et al. Guaranteed Global Minimum of Electronic Hamiltonian 1-Norm via Linear Programming in the Block Invariant Symmetry Shift (BLISS) Method. 2024. arXiv:2409.18277 [quant-ph]. url: https://arxiv.org/abs/2409.18277

    2024 arXiv

  59. [70]

    Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications

    Emiel Koridon et al. “Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications”. In:Physical Review Research3.3 (Aug. 2021). issn: 2643-1564. doi: 10.1103/physrevresearch.3.033127 . url: http://dx.doi.org/10. 1103/...

    2021 doi

  60. [71]

    ReducingmolecularelectronicHamiltoniansimulationcostforlinearcombi- nation of unitaries approaches

    IgnacioLoaizaetal.“ReducingmolecularelectronicHamiltoniansimulationcostforlinearcombi- nation of unitaries approaches”. In:Quantum Science and Technology8.3 (May 2023), p. 035019. issn: 2058-9565. doi: 10.1088/2058-9565/acd577. url: http://dx.doi.org/10.1088/2058- 9565/acd577

    2023 doi

  61. [72]

    Izmaylov.Deterministic improvements of quantum measurements with grouping of compatible operators, non-local transformations, and covariance estimates

    Tzu-Ching Yen, Aadithya Ganeshram, and Artur F. Izmaylov.Deterministic improvements of quantum measurements with grouping of compatible operators, non-local transformations, and covariance estimates. 2022. arXiv: 2201.01471 [quant-ph] . url: https://arxiv.org/abs/ 2201.01471

    2022 arXiv

  62. [73]

    Low-Overhead Parallelisation of LCU via Commuting Operators

    Gregory Boyd. Low-Overhead Parallelisation of LCU via Commuting Operators. 2024. arXiv: 2312.00696 [quant-ph]. url: https://arxiv.org/abs/2312.00696

    2024 arXiv

  63. [74]

    Theory of Trotter Error with Commutator Scaling

    Andrew M. Childs et al. “Theory of Trotter Error with Commutator Scaling”. In:Physical Review X 11.1 (Feb. 2021). issn: 2160-3308. doi: 10.1103/physrevx.11.011020 . url: http://dx. doi.org/10.1103/PhysRevX.11.011020

    2021 doi

  64. [75]

    Higher order interactions destroy phase transitions in Deffuant opinion dynamics model

    Hendrik Schawe and Laura Hernández. “Higher order interactions destroy phase transitions in Deffuant opinion dynamics model”. In:Communications Physics5.1 (Jan. 2022).issn: 2399-3650. doi: 10.1038/s42005-022-00807-4. url: http://dx.doi.org/10.1038/s42005-022-00807- 4

    2022 doi

  65. [76]

    Hamiltonian Simulation Using Linear Combinations of Unitary Operations

    Andrew M. Childs and Nathan Wiebe. “Hamiltonian Simulation Using Linear Combinations of Unitary Operations”. In:Quantum Information and Computation12.11 & 12 (Nov. 2012).issn: 1533-7146. doi: 10.26421/qic12.11-12. url: http://dx.doi.org/10.26421/QIC12.11-12. 30

    2012 doi

  66. [77]

    Double sparse quantum state preparation

    Tiago M. L. de Veras, Leon D. da Silva, and Adenilton J. da Silva. “Double sparse quantum state preparation”. In:Quantum Information Processing21.6 (June 2022).issn: 1573-1332. doi: 10.1007/s11128-022-03549-y. url: http://dx.doi.org/10.1007/s11128-022-03549-y

    2022 doi

  67. [78]

    Sparse Random Hamiltonians Are Quantumly Easy

    Chi-Fang Chen et al. “Sparse Random Hamiltonians Are Quantumly Easy”. In:Physical Review X 14.1 (Feb. 2024). issn: 2160-3308. doi: 10.1103/physrevx.14.011014 . url: http://dx. doi.org/10.1103/PhysRevX.14.011014

    2024 doi

  68. [79]

    Ryota Kojima, Masahiko Kamoshita, and Keita Kanno.Orbital-rotated Fermi-Hubbard model as a benchmarking problem for quantum chemistry with the exact solution. 2024. arXiv:2402.11869 [quant-ph]. url: https://arxiv.org/abs/2402.11869

    2024 arXiv

  69. [80]

    Parallel Implementation of the Density Matrix Renormalization Group Method Achieving a Quarter petaFLOPS Performance on a Single DGX-H100 GPU Node

    Andor Menczer et al. “Parallel Implementation of the Density Matrix Renormalization Group Method Achieving a Quarter petaFLOPS Performance on a Single DGX-H100 GPU Node”. In: Journal of Chemical Theory and Computation20.19(Sept.2024),pp.8397–8404. issn:1549-9626. doi: 10.1021/...

    2024 doi

  70. [81]

    url: https://scikit-learn.org/1.5/modules/model_evaluation.html

  71. [82]

    A Unified Approach to Interpreting Model Predictions

    Scott M Lundberg and Su-In Lee. “A Unified Approach to Interpreting Model Predictions”. In: Advances in Neural Information Processing Systems 30(2017). Ed. by I. Guyon et al., pp. 4765–

    2017

  72. [83]

    SHAP (SHapley Additive exPlanations)

    Scott M Lundberg and Su-In Lee. SHAP (SHapley Additive exPlanations). https://github. com/shap/shap. Accessed: 2024-12-03. 2017

    2024

  73. [84]

    Algorithms for non-negative matrix factorization

    Daniel D. Lee and H. Sebastian Seung. “Algorithms for non-negative matrix factorization”. In: Proceedings of the 13th International Conference on Neural Information Processing Systems. NIPS’00. Denver, CO: MIT Press, 2000, pp. 535–541

    2000

  74. [85]

    Random Decision Forests

    T.K. Ho. “Random Decision Forests”. In: In Proceedings of 3rd International Conference on Document Analysis and RecognitionVol 2 (1995), pp. 278–282

    1995

  75. [86]

    XGBoost: A Scalable Tree Boosting System

    T. Chen and C. Guestrin. “XGBoost: A Scalable Tree Boosting System”. In:Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(2016), pp. 785–794. url: https://doi.org/10.1145/2939672.2939785

    2016

  76. [87]

    Deploying a Top-100 Supercomputer for Large Parallel Workloads: the Niagara Supercomputer

    Marcelo Ponce et al. “Deploying a Top-100 Supercomputer for Large Parallel Workloads: the Niagara Supercomputer”. In:Proceedings of the Practice and Experience in Advanced Research Computing on Rise of the Machines (learning). Chicago IL USA: ACM, July 2019, pp. 1–8.isbn: 978-...

    2019

  77. [88]

    SciNet: Lessons Learned from Building a Power-efficient Top-20 System and Data Centre

    Chris Loken et al. “SciNet: Lessons Learned from Building a Power-efficient Top-20 System and Data Centre”. In:J. Phys.: Conf. Ser.256 (Nov. 2010), p. 012026. issn: 1742-6596. doi: 10.1088/1742-6596/256/1/012026 . url: https://iopscience.iop.org/article/10.1088/ 1742-6596/256/...

    2010 doi

  78. [89]

    Quantum computing enhanced computational catalysis

    Vera von Burg et al. “Quantum computing enhanced computational catalysis”. In:Phys. Rev. Res. 3 (3 July 2021), p. 033055. doi: 10 . 1103 / PhysRevResearch . 3 . 033055. url: https : //link.aps.org/doi/10.1103/PhysRevResearch.3.033055

    2021 doi

  79. [90]

    Block2: A comprehensive open source framework to develop and apply state-of-the-art DMRG algorithms in electronic structure and beyond

    Huanchen Zhai et al. “Block2: A comprehensive open source framework to develop and apply state-of-the-art DMRG algorithms in electronic structure and beyond”. In:The Journal of Chem- ical Physics159.23 (2023), p. 234801.issn: 0021-9606. doi: 10.1063/5.0180424. 31

    2023 doi

  80. [91]

    Even More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction

    Joonho Lee et al. “Even More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction”. In:PRX Quantum 2 (3 July 2021), p. 030305.doi: 10.1103/PRXQuantum. 2.030305. url: https://link.aps.org/doi/10.1103/PRXQuantum.2.030305

    2021 doi

  81. [92]

    Efficient magic state factories with a catalyzed|CCZ> to 2|T >transformation

    Craig Gidney and Austin G. Fowler. “Efficient magic state factories with a catalyzed|CCZ> to 2|T >transformation”. In:Quantum 3 (Apr. 2019), p. 135.issn: 2521-327X. doi: 10.22331/q- 2019-04-30-135. url: https://doi.org/10.22331/q-2019-04-30-135

    2019 doi

  82. [93]

    Block-Invariant Symmetry Shift: Preprocessing Tech- nique for Second-Quantized Hamiltonians to Improve Their Decompositions to Linear Combi- nation of Unitaries

    Ignacio Loaiza and Artur F. Izmaylov. “Block-Invariant Symmetry Shift: Preprocessing Tech- nique for Second-Quantized Hamiltonians to Improve Their Decompositions to Linear Combi- nation of Unitaries”. In: Journal of Chemical Theory and Computation 19.22 (2023). PMID: 37939198...

    2023 doi

  83. [94]

    Reducing the Runtime of Fault-Tolerant Quantum Simulations in Chem- istry through Symmetry-Compressed Double Factorization

    Dario Rocca et al. “Reducing the Runtime of Fault-Tolerant Quantum Simulations in Chem- istry through Symmetry-Compressed Double Factorization”. In:Journal of Chemical Theory and Computation 20.11 (2024). PMID: 38788209, pp. 4639–4653.doi: 10.1021/acs.jctc.4c00352. eprint: htt...

    2024 doi

  84. [95]

    Faster quantum chemistry simulations on a quantum computer with im- proved tensor factorization and active volume compilation

    Athena Caesura et al. Faster quantum chemistry simulations on a quantum computer with im- proved tensor factorization and active volume compilation. 2025. arXiv:2501.06165 [quant-ph]. url: https://arxiv.org/abs/2501.06165

    2025 arXiv

  85. [96]

    Initial State Preparation for Quantum Chemistry on Quantum Com- puters

    Stepan Fomichev et al. “Initial State Preparation for Quantum Chemistry on Quantum Com- puters”. In: PRX Quantum 5 (4 Dec. 2024), p. 040339.doi: 10.1103/PRXQuantum.5.040339 . url: https://link.aps.org/doi/10.1103/PRXQuantum.5.040339

    2024 doi

  86. [97]

    Berry et al

    Dominic W. Berry et al. Rapid initial state preparation for the quantum simulation of strongly correlated molecules. 2024. arXiv: 2409.11748 [quant-ph] . url: https://arxiv.org/abs/ 2409.11748. 32

    2024

  87. [603]

    doi: 10.1109/HPCA53966.2022.00050

    2022

  88. [4774]

    url: http://papers.nips.cc/paper/7062-a-unified-approach-to-interpreting- model-predictions.pdf

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.