Pith. sign in

REVIEW 3 major objections 6 minor 56 references

Multi-QIDA method for VQE state preparation in molecular systems

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

Pith's one-line read A VQE ansatz built from a quantum mutual information map, layer by layer, recovers substantially more ground-state correlation energy than a generic hardware-efficient ladder at the same CNOT count, while also preserving spin and particle-n

desk verdict Solid, honest application of the group's Multi-QIDA to small molecules, but the headline advantage over ladder HEA is confounded by SO(4) gates' extra variational parameters, so the QMI-topology story is not yet established. read the letter →

arxiv 2508.11270 v1 pith:URMZXOF5 submitted 2025-08-15 quant-ph physics.comp-ph

classification quant-phphysics.comp-ph
keywords VQEquantummutualinformationMulti-QIDAansatzmoleculargroundstatesnaturalorbitalsactivespaceSO(4)correlatorssymmetrypreservation
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 tries to establish that a VQE trial state built from a quantum-chemistry correlation map, layer by layer, beats a generic hardware pattern at equal circuit resources. The method, Multi-QIDA, takes the quantum mutual information matrix of a moderately accurate classical wavefunction (RCISD), splits qubit pairs into layers by correlation strength, prunes each layer with a spanning-tree rule, and entangles surviving pairs with SO(4) gates, optimizing one layer at a time. Across five small molecules and active-space models, the paper reports that these circuits consistently beat ladder-topology hardware-efficient ansatze at matched CNOT counts: average correlation energy rises from 21% to about 80% for BeH2 and from 21% to roughly 58% for N2 CAS(6,6), with far fewer failed optimizations. The variational states also end up closer to the exact ground state and preserve spin and particle-number symmetries more faithfully. If right, the method gives a cheap, chemistry-informed route to shallow VQE circuits for near-term quantum hardware.

What carries the argument

The engine is the Quantum Mutual Information matrix, $I_{u,v}=S(\rho_u)+S(\rho_v)-S(\rho_{u,v})$, computed from a sparse, approximate classical wavefunction: it identifies which qubit pairs share the correlations that a shallow circuit must reproduce. Finesse-ratio thresholds slice the sorted pair list into layers; each layer is reduced to a minimum or maximum spanning tree (minimizing topological distance or maximizing total QMI); fully parametrized SO(4) gates act as the correlators; and a layer-wise VQE routine optimizes each new layer alone before relaxing the whole circuit.

What would settle it

Take a strongly correlated case where single-reference RCISD is known to fail, for example N2 at a stretched bond length in the same CAS(6,6) active space. Build Multi-QIDA circuits from QMI matrices computed with RCISD and with full configuration interaction, fix the CNOT budget, and compare recovered correlation energies. If the RCISD-driven circuit performs no better than the ladder while the FCI-driven circuit clearly outperforms it, the central premise is refuted.

Watch

Extended reading notes

Core claim

The discovery is that iterating the QIDA construction across correlation-strength thresholds with spanning-tree pruning transfers from lattice spin models to molecules and beats the heuristic standard. Starting from the quantum mutual information matrix of an RCISD wavefunction, Multi-QIDA slices qubit pairs into layers, reduces each layer to a spanning tree, and optimizes incrementally. At matched CNOT counts it reports higher correlation-energy recovery on every system tested, often 30-40 percentage points higher on average, with better $\hat{S}_z$, $\hat{S}^2$, and particle-number preservation.

Load-bearing premise

The load-bearing premise is that the correlation map extracted from a moderately accurate classical wavefunction correctly identifies which qubit pairs must be entangled to represent the exact ground state; if that classical reference misses important correlations, the circuit built from it will miss them too.

Editorial extensions

If this is right

  • For small molecules, using Multi-QIDA instead of a ladder HEA should raise the average correlation energy recovered at a fixed CNOT budget and reduce the number of VQE runs that land in poor local minima.
  • Because the correlation map is cheap to obtain from a classical calculation, the method offers a systematic, chemistry-informed alternative to random hardware-efficient initialization for near-term devices.
  • The better preservation of $\hat{S}_z$, $\hat{S}^2$, and electron number means less post-processing may be needed to filter the variational state onto the correct symmetry sectors.
  • The high-fidelity, symmetry-correct trial states are natural inputs for sampling-based post-processing schemes such as QSCI or QSD, where the quality of sampled determinants depends on the trial wavefunction.
  • The two spanning-tree criteria (maximizing correlation vs. minimizing topological distance) allow the ansatz to be adapted to hardware connectivity without changing the energy target.

Reading between the lines

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

  • The method's dependence on the RCISD reference draws a sharp boundary: in strongly correlated regimes where RCISD's QMI map is wrong, Multi-QIDA's advantage over the ladder should shrink; comparing RCISD-driven versus FCI-driven QMI layers on a stretched bond would locate that boundary.
  • The reported symmetry improvements may come as much from the layer-wise optimization path and the SO(4) gates as from the QMI selection itself; replacing SO(4) with CNOTs inside the same QIDA topology would separate those contributions.
  • The barren-plateau argument is plausible but indirect; a direct check would measure the variance of gradient components at each added layer for Multi-QIDA versus the ladder, rather than only the spread of final energies.
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 extends the Multi-QIDA method, previously introduced for lattice spin models, to molecular VQE problems. The ansatz is constructed from QMI matrices computed with the SparQ tool from RCISD wavefunctions in iterative natural orbital bases; each layer selects qubit pairs by finesse-ratio thresholds, reduces them via maximum-correlation or distance-based spanning trees, and entangles the selected pairs with fully parametrized SO(4) gates. The full circuit is optimized with an incremental layer-wise VQE procedure. Benchmarks on five small systems (H2O, BeH2, NH3 in INO bases; H2O-CAS(4,4) and N2-CAS(6,6)) are compared with ladder-topology hardware-efficient ansatze at matched CNOT counts, reporting higher average correlation energies, better symmetry preservation, and lower dispersion, while admitting a two-to-three-fold increase in optimization iterations. The central claim is that Multi-QIDA 'consistently outperforms the ladder topology ansatze in terms of energy accuracy, correlation recovery, and resource utilization.'

Significance. If the claim is sustained, the work is a useful contribution to near-term quantum chemistry: it offers a concrete, chemically motivated recipe for building shallow VQE circuits that recover substantially more correlation energy than a generic hardware-efficient ladder at a fixed CNOT budget, and it provides detailed symmetry and fidelity diagnostics. The paper has clear strengths: fifty independent VQE runs per system, explicit comparisons to exact diagonalization, honest reporting of the higher iteration count and of the similarity between the two spanning-tree selection criteria, and a modular description of the algorithm. The missing piece is a control that isolates the role of QMI-guided topology from the increased per-CNOT expressibility of SO(4) gates; without that control, the paper's load-bearing attribution of the improvement to the QMI-informed placement of entangling gates is not established.

major comments (3)
  1. [Section 3.1; Tables 2-4] The headline comparison is confounded by variational-parameter count, not just CNOT count. A fully parametrized SO(4) gate decomposes into two SU(2) rotations, i.e., six independent parameters for two CNOTs. In contrast, a depth-d HEA ladder on N qubits has (d+1)N single-qubit parameters and (N-1)d CNOTs. For BeH2 (N=12, d=6) the HEA has 84 parameters and 66 CNOTs, while Multi-QIDA has 70 CNOTs and about 210 parameters. Thus the reported 79.78% vs 21.25% average correlation energy may reflect the greater per-CNOT expressiveness of SO(4) gates rather than the QMI-informed selection of qubit pairs. The manuscript does not include a control with SO(4) correlators in a ladder or random topology, nor a control with QMI-permuted pairs. Without such a control, the central claim that QMI-driven topology is the cause of the improvement is not supported.
  2. [Section 5.3 and Section 6] The 'resource utilization' component of the central claim is not supported by the metrics used. The paper itself states that Multi-QIDA requires on average two to three times more optimization iterations than the corresponding HEA and that most of the procedure is spent in relaxation. Combined with the roughly 2.5x larger number of variational parameters, a resource comparison restricted to CNOT counts is one-dimensional and favorable to the proposed method. A fair resource-utilization claim should also report total optimizer calls, parameter counts, and wall-clock or equivalent simulation cost; as written, the conclusion overstates the practical advantage.
  3. [Section 5.1 and Section 6] The generalization of the result is limited by the choice of reference wavefunction and benchmark systems. All five test cases are near-equilibrium, single-reference-dominated molecules, and the QMI matrix is obtained from RCISD with a 10^-12 Slater-determinant cutoff and at most 10^5 determinants. The ansatz structure therefore inherits the correlation content of RCISD: if the reference misses significant static or multireference correlation, the QMI-derived layer placement will be misaligned. The claim that Multi-QIDA 'consistently outperforms' is too broad for this evidence. A concrete test would be a strongly correlated case (e.g., stretched N2 or a bond-breaking coordinate) or a comparison of QMI maps generated from different reference levels.
minor comments (6)
  1. [Figure 8] The numbers in the first violin of Figure 8 are inconsistent with Table 3: the text and table give the HEA average correlation energy for H2O as -111.50%, while the figure shows -108.47%. The caption's explanation of the three numbers is also confusing: it says they show CNOTs, epsilon_avg, and epsilon_best, but the vertical positions and values suggest otherwise.
  2. [Tables 5-6] Decimal commas are used inconsistently (e.g., '99, 95724' vs '99.88125'), and some entries use periods while others use commas. This should be normalized.
  3. [Notation] The HEA label is written inconsistently: Section 4.2 defines pLqCX^d, but Tables 3 and 4 use pLqcx_5 / pLqcx_6, and Figure captions use (L)CX. Please unify notation.
  4. [Figure 7 caption] The caption labels both panel (d) and the N2 panel as (d); the N2 panel should be (e).
  5. [Appendix A, Figure A8 caption] The caption says 'N2 cc-PVDZ' but the text and Table 1 use 'cc-pVTZ'. This typo should be fixed.
  6. [Miscellaneous] There are numerous typographical errors: 'employnment', 'Hartee-Fock', 'Equation2' in Section 2.1, 'increasad' in Section 6, 'RMD' for reduced density matrix, and the garbled product notation in Eq. (16). A careful proofreading pass is needed.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: new benchmarks against external FCI/CASCI energies; self-citations are methodological continuity, and the SO(4) parameter-count asymmetry is a confound, not a tautology.

full rationale

The paper's derivation chain is not circular. The QMI matrix is a classical input computed from an RCISD wavefunction (Sections 2.4 and 5.1), but the VQE parameters are variationally optimized against the qubit Hamiltonian (Eq. 5), and all performance claims are evaluated against externally computed FCI or CASCI energies (Eqs. 17-18; Tables 3-4). The self-citations to QIDA [23], Multi-QIDA [29], and SparQ [30] supply the layer-construction and QMI-extraction tools, but the present paper's numerical benchmarks are new and externally falsifiable. No fitted parameter is renamed as a prediction: thresholds ('finesse-ratios') are chosen heuristically from the QMI distribution, not from the target energies, and the layer-selection criteria are explicit graph algorithms. The SO(4) correlators have more variational parameters per CNOT than the HEA ladder's single-qubit rotations, which is a potential confound in the 'resource utilization' comparison, but it is an internal-validity concern, not a circular reduction; no equation of the paper reduces to itself or to the benchmark. The paper honestly notes its limitations (Section 6: open questions; Section 5.3: higher iteration cost), which further supports that the claims are empirical rather than tautological.

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

The paper introduces no new physical entities. Its main dependencies are: (1) the accuracy of the RCISD QMI as a guide for circuit structure, (2) the expressiveness of SO(4) gates, and (3) several hand-tuned numerical parameters (finesse ratios, noise offset, cutoff, stopping rule). These are method choices rather than fitted physical constants.

free parameters (4)
  • finesse-ratio thresholds mu_bar = H2O INOs: [0.5,0.3,0.1]; BeH2: [0.7,0.4,0.35,0.3,0.2]; NH3: [0.75,0.5,0.25,0.2]; H2O CAS: [0.5,0.20,0.15]; N2 CAS: [0.80
    Chosen per system by inspecting the QMI distribution (Section 5.1); they determine the number and composition of QIDA layers, so they are hand-fitted inputs to the method, not derived automatically.
  • Initial offset standard deviation for new layers = 0.1
    Empirically estimated 'by selecting the lowest value that allowed escaping the local minima' (Section 3.4).
  • SparQ Slater determinant cutoff and max SD count = 10^-12 and 10^5
    Settings for the QMI calculation (Section 5.1); chosen to balance accuracy and cost.
  • Stop threshold for QMI layer addition = 0.2
    The authors stop adding layers once the QMI value falls below 0.2 (Section 5.1), an arbitrary stopping rule.
assumptions (6)
  • domain assumption The RCISD-derived QMI matrix in the chosen orbital basis is a reliable guide to the correlation structure of the exact ground state needed for the ansatz.
    Central premise of the method; stated in Sections 2.4 and 3. If false (e.g., strong correlation), the ansatz layers are misaligned.
  • standard math Jordan-Wigner mapping from fermionic to qubit operators.
    Used throughout Section 2.1 to build the qubit Hamiltonian.
  • standard math Variational principle (Rayleigh-Ritz) guarantees VQE energy is an upper bound to the ground state.
    Section 2.1, Eq. 6.
  • domain assumption SO(4) gates acting on pairs of qubits can express the required electron correlation and symmetries.
    The paper only uses SO(4) correlators; the paper notes in Section 5.2 that no double excitations are included directly in the active-space ansatze, so the gate set may be insufficient for full correlation recovery.
  • domain assumption Natural orbitals (INO) sparsify the CI expansion and QMI map, improving ansatz compactness.
    Based on prior work (Section 2.3); assumed valid for the tested systems.
  • domain assumption MST/mST reduction preserves the energetically relevant correlations.
    The spanning-tree selection is a heuristic; the paper notes in Section 5.2 that the two selection criteria perform similarly, but optimality for energy is not proven.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Multi-QIDA method for VQE state preparation in molecular systems." pith.science (2026). https://pith.science/paper/URMZXOF5

@misc{pith2026250811270,
  author       = {Pith},
  title        = {Pith review of: Multi-QIDA method for VQE state preparation in molecular systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/URMZXOF5}},
  note         = {Machine review of arXiv:2508.11270}
}
read the original abstract

The development of quantum algorithms and their application to quantum chemistry has introduced new opportunities for solving complex molecular problems that are computationally infeasible for classical methods. In quantum chemistry, the Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm designed to estimate ground-state energies of molecular systems. Despite its promise, VQE faces challenges such as scalability issues, high circuit depths, and barren plateaus that make the optimization of the variational wavefunction. To mitigate these challenges, the Quantum Information Driven Ansatz (QIDA) leverages Quantum Mutual Information (QMI) to construct compact, correlation-driven circuits. In this work, we go back to the original field of application of QIDA, by applying the already defined Multi-Threshold Quantum Information Driven Ansatz (Multi-QIDA) methodology on Molecular Systems. to systematically construct shallow, layered quantum circuits starting from approximate QMI matrices obtained by Quantum Chemistry calculations. The Multi-QIDA approach combines efficient creation of the QMI map, reduction of the number of correlators required by exploiting Minimum/Maximum spanning tress, and an iterative layer-wise VQE optimization routine. These enhancements allow the method to recover missing correlations in molecular systems while maintaining computational efficiency. Additionally, the approach incorporates alternative gate constructions, such as SO(4) correlators, to enhance the circuit expressibility without significantly increasing the circuit complexity. We benchmark Multi-QIDA on systems ranging from small molecules like H2O, BeH2, and NH3 in Iterative Natural Orbitals (INOs) basis set, to active-space models such as H2O-6-31G-CAS(4,4) and N2-cc-pVTZ-CAS(6,6), comparing it to traditional hardware-efficient ansatze.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

56 extracted references · 33 canonical work pages

  1. [1]

    A variational eigenvalue solver on a photonic quantum processor

    Alberto Peruzzo, Jarrod McClean, Peter Shad- bolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Al´ an Aspuru-Guzik, and Jeremy L. O’Brien. “A variational eigenvalue solver on a photonic quantum processor”. In: Nature Com- munications 5.1 (2014), p. 4213. issn: 2041-

  2. [3]

    Hardware- efficient variational quantum eigensolver for small molecules and quantum magnets

    Abhinav Kandala, Antonio Mezzacapo, Kris- tan Temme, Maika Takita, Markus Brink, Jerry M. Chow, and Jay M. Gambetta. “Hardware- efficient variational quantum eigensolver for small molecules and quantum magnets”. In: Nature 549.7671 (2017), pp. 242–246. issn: 1476-4687. doi: 10 . 1038 / nature23879. url: http://dx.doi.org/10.1038/nature23879

  3. [4]

    Variational quantum algorithms

    M. Cerezo, Andrew Arrasmith, Ryan Babbush, Simon C. Benjamin, Suguru Endo, Keisuke Fu- jii, Jarrod R. McClean, Kosuke Mitarai, Xiao Yuan, Lukasz Cincio, and Patrick J. Coles. “Variational quantum algorithms”. In: Nature Reviews Physics 3.9 (2021), pp. 625–644. issn: 2522-5820. doi: 10.1038/s42254-021-00348-

  4. [5]

    Fedorov, Bo Peng, Niranjan Govind, and Yuri Alexeev

    Dmitry A. Fedorov, Bo Peng, Niranjan Govind, and Yuri Alexeev. VQE Method: A Short Sur- vey and Recent Developments . 2021. arXiv: 2103.08505 [quant-ph]

  5. [6]

    Noisy intermediate-scale quantum algorithms

    Kishor Bharti, Alba Cervera-Lierta, Thi Ha Kyaw, Tobias Haug, Sumner Alperin-Lea, Abhinav Anand, Matthias Degroote, Her- manni Heimonen, Jakob S. Kottmann, Tim Menke, Wai-Keong Mok, Sukin Sim, Leong- Chuan Kwek, and Al´ an Aspuru-Guzik. “Noisy intermediate-scale quantum algorithms”. In: Reviews of Modern Physics 94.1 (2022). issn: 1539-0756. doi: 10 . 110...

  6. [7]

    The Varia- tional Quantum Eigensolver: A review of meth- ods and best practices

    Jules Tilly, Hongxiang Chen, Shuxiang Cao, Dario Picozzi, Kanav Setia, Ying Li, Edward Grant, Leonard Wossnig, Ivan Rungger, George H. Booth, and Jonathan Tennyson. “The Varia- tional Quantum Eigensolver: A review of meth- ods and best practices”. In: Physics Reports 986 (2022), pp. 1–128. issn: 0370-1573. doi: 10 . 1016 / j . physrep . 2022 . 08 . 003. u...

  7. [8]

    Quantum al- gorithms for electronic structure calculations: Particle-hole Hamiltonian and optimized wave- function expansions

    Panagiotis Kl. Barkoutsos, Jerome F. Gonthier, Igor Sokolov, Nikolaj Moll, Gian Salis, An- dreas Fuhrer, Marc Ganzhorn, Daniel J. Eg- ger, Matthias Troyer, Antonio Mezzacapo, Ste- fan Filipp, and Ivano Tavernelli. “Quantum al- gorithms for electronic structure calculations: Particle-hole Hamiltonian and optimized wave- function expansions”. In: Physical R...

  8. [9]

    url: http : / / dx . doi . org / 10 . 1038 / s42254-021-00348-9

Show all 56 references
  1. [10]

    Qubit-excitation-based adaptive vari- ational quantum eigensolver

    Yordan S. Yordanov, V. Armaos, Crispin H. W. Barnes, and David R. M. Arvidsson- Shukur. “Qubit-excitation-based adaptive vari- ational quantum eigensolver”. In: Communica- tions Physics 4.1 (2021). issn: 2399-3650. doi: 10.1038/s42005- 021- 00730- 0. url: http: //dx.doi.org/10...

  2. [11]

    An adaptive variational algorithm for exact molec- ular simulations on a quantum computer

    Harper R. Grimsley, Sophia E. Economou, Ed- win Barnes, and Nicholas J. Mayhall. “An adaptive variational algorithm for exact molec- ular simulations on a quantum computer”. In: Nature Communications 10.1 (2019). issn: 2041-1723. doi: 10.1038/s41467-019-10988-

  3. [12]

    url: http : / / dx . doi . org / 10 . 1038 / s41467-019-10988-2

  4. [13]

    Rattew, Shaohan Hu, Marco Pistoia, Richard Chen, and Steve Wood

    Arthur G. Rattew, Shaohan Hu, Marco Pistoia, Richard Chen, and Steve Wood. A Domain- agnostic, Noise-resistant, Hardware-efficient Evolutionary Variational Quantum Eigen- solver. 2020. arXiv: 1910.09694 [quant-ph]

  5. [14]

    Barkoutsos, Pauline J

    Francesco Benfenati, Guglielmo Mazzola, Chiara Capecci, Panagiotis Kl. Barkoutsos, Pauline J. Ollitrault, Ivano Tavernelli, and Leonardo Guidoni. Improved accuracy on noisy devices by non-unitary Variational Quantum Eigensolver for chemistry applications . 2021. arXiv: 2101.09...

  6. [15]

    Gate-Efficient Simulation of Molec- ular Eigenstates on a Quantum Computer

    M. Ganzhorn, D.J. Egger, P. Barkoutsos, P. Ol- litrault, G. Salis, N. Moll, M. Roth, A. Fuhrer, P. Mueller, S. Woerner, I. Tavernelli, and S. Filipp. “Gate-Efficient Simulation of Molec- ular Eigenstates on a Quantum Computer”. In: Physical Review Applied 11.4 (2019). issn: 23...

  7. [16]

    A unitary multiconfigurational coupled-cluster method: Theory and applications

    Mark R. Hoffmann and Jack Simons. “A unitary multiconfigurational coupled-cluster method: Theory and applications”. In: The Journal of Chemical Physics 88.2 (1988), pp. 993–1002. issn: 0021-9606. doi: 10.1063/ 1 . 454125. eprint: https : / / pubs . aip . org / aip/jcp/article-...

  8. [17]

    Correlation-Informed Permu- tation of Qubits for Reducing Ansatz Depth in the Variational Quantum Eigensolver

    Nikolay V. Tkachenko, James Sud, Yu Zhang, Sergei Tretiak, Petr M. Anisimov, Andrew T. Arrasmith, Patrick J. Coles, Lukasz Cincio, and Pavel A. Dub. “Correlation-Informed Permu- tation of Qubits for Reducing Ansatz Depth in the Variational Quantum Eigensolver”. In: PRX Quantum...

  9. [18]

    Qubit-ADAPT-VQE: An Adaptive Algorithm for Constructing Hardware-Efficient Ans¨ atze on a Quantum Processor

    Ho Lun Tang, V.O. Shkolnikov, George S. Bar- ron, Harper R. Grimsley, Nicholas J. May- hall, Edwin Barnes, and Sophia E. Economou. “Qubit-ADAPT-VQE: An Adaptive Algorithm for Constructing Hardware-Efficient Ans¨ atze on a Quantum Processor”. In: PRX Quantum 2.2 (2021). issn: 2...

  10. [19]

    McClean, Cornelius Hempel, Peter Love, and Al´ an Aspuru-Guzik

    Jonathan Romero, Ryan Babbush, Jarrod R. McClean, Cornelius Hempel, Peter Love, and Al´ an Aspuru-Guzik. Strategies for quantum computing molecular energies using the uni- tary coupled cluster ansatz . 2018. arXiv: 1701. 02691 [quant-ph]

  11. [21]

    Alternative single- reference coupled cluster approaches for mul- tireference problems: The simpler, the better

    Francesco A. Evangelista. “Alternative single- reference coupled cluster approaches for mul- tireference problems: The simpler, the better”. In: The Journal of Chemical Physics 134.22 (2011), p. 224102. issn: 0021-9606. doi: 10 . 1063/1.3598471. eprint: https://pubs.aip. org/a...

  12. [22]

    Wave Func- tion Adapted Hamiltonians for Quantum Com- puting

    Leonardo Ratini, Chiara Capecci, Francesco Benfenati, and Leonardo Guidoni. “Wave Func- tion Adapted Hamiltonians for Quantum Com- puting”. In: Journal of Chemical Theory and Computation 18.2 (2022). PMID: 35041784, pp. 899–909. doi: 10 . 1021 / acs . jctc . 1c01170. eprint: h...

  13. [23]

    Unitary Coupled Cluster: Seizing the Quan- tum Moment

    Ilias Magoulas and Francesco A. Evangelista. “Unitary Coupled Cluster: Seizing the Quan- tum Moment”. In: The Journal of Physical Chemistry A 127 (31 Aug. 2023), pp. 6567–

  14. [24]

    Nakagawa

    Keita Kanno, Masaya Kohda, Ryosuke Imai, Sho Koh, Kosuke Mitarai, Wataru Mizukami, and Yuya O. Nakagawa. Quantum-Selected Configuration Interaction: classical diagonal- ization of Hamiltonians in subspaces selected by quantum computers . 2023. arXiv: 2302.11320 [quant-ph]. url...

  15. [25]

    Coles, Lukasz Cincio, Jarrod R

    Martin Larocca, Supanut Thanasilp, Samson Wang, Kunal Sharma, Jacob Biamonte, Patrick J. Coles, Lukasz Cincio, Jarrod R. McClean, Zo¨ e Holmes, and M. Cerezo.A Review of Bar- ren Plateaus in Variational Quantum Comput- ing. 2024. arXiv: 2405.00781 [quant-ph]

  16. [26]

    Sung, Maika Takita, Minh C

    Javier Robledo-Moreno, Mario Motta, Hol- ger Haas, Ali Javadi-Abhari, Petar Jurcevic, William Kirby, Simon Martiel, Kunal Sharma, Sandeep Sharma, Tomonori Shirakawa, Iskan- dar Sitdikov, Rong-Yang Sun, Kevin J. Sung, Maika Takita, Minh C. Tran, Seiji Yunoki, and Antonio Mezzac...

  17. [27]

    Quantum In- formation Driven Ansatz (QIDA): shallow- depth empirical quantum circuits from Quan- tum Chemistry

    Davide Materia, Leonardo Ratini, Celestino Angeli, and Leonardo Guidoni. Quantum In- formation Driven Ansatz (QIDA): shallow- depth empirical quantum circuits from Quan- tum Chemistry . 2023. arXiv: 2309 . 15287 [quant-ph]

  18. [29]

    A Theory of Quantum Subspace Di- agonalization

    Ethan N. Epperly, Lin Lin, and Yuji Nakat- sukasa. “A Theory of Quantum Subspace Di- agonalization”. In: SIAM Journal on Matrix Analysis and Applications 43.3 (Aug. 2022), pp. 1263–1290. issn: 1095-7162. doi: 10.1137/ 21m145954x. url: http://dx.doi.org/10. 1137/21M145954X

  19. [30]

    Quantum information theory on sparse wavefunctions and applica- tions for Quantum Chemistry

    Davide Materia, Leonardo Ratini, and Leonardo Guidoni. Quantum information theory on sparse wavefunctions and applica- tions for Quantum Chemistry . 2024. arXiv: 2408 . 02631 [quant-ph] . url: https : //arxiv.org/abs/2408.02631

  20. [31]

    Solving an industrially relevant quan- tum chemistry problem on quantum hard- ware

    Ludwig N¨ utzel, Alexander Gresch, Lukas Hehn, Lucas Marti, Robert Freund, Alex Steiner, Christian D Marciniak, Timo Eck- stein, Nina Stockinger, Stefan Wolf, Thomas Monz, Michael K¨ uhn, and Michael J Hart- mann. “Solving an industrially relevant quan- tum chemistry problem o...

  21. [32]

    A fast in- trinsic localization procedure applicable for ab- initio and semiempirical linear combination of atomic orbital wave functions

    J´ anos Pipek and Paul G. Mezey. “A fast in- trinsic localization procedure applicable for ab- initio and semiempirical linear combination of atomic orbital wave functions”. In: The Jour- nal of Chemical Physics 90.9 (May 1989), pp. 4916–4926. issn: 0021-9606. doi: 10.1063/ 1 ...

  22. [33]

    Compact Multi-Threshold Quantum Information Driven Ansatz For Strongly Interactive Lattice Spin Models

    Fabio Tarocco, Davide Materia, Leonardo Ratini, and Leonardo Guidoni. Compact Multi-Threshold Quantum Information Driven Ansatz For Strongly Interactive Lattice Spin Models. 2024. arXiv: 2408.02639 [quant-ph]. url: https://arxiv.org/abs/2408.02639

  23. [34]

    Natu- ral Orbitals in the Quantum Theory of Two- Electron Systems

    Per-Olov L¨ owdin and Harrison Shull. “Natu- ral Orbitals in the Quantum Theory of Two- Electron Systems”. In: Phys. Rev. 101 (6 Mar. 1956), pp. 1730–1739. doi: 10.1103/PhysRev. 101.1730. url: https://link.aps.org/doi/ 10.1103/PhysRev.101.1730

  24. [35]

    Construction of Some Molecu- lar Orbitals to Be Approximately Invariant for Changes from One Molecule to Another

    S. F. Boys. “Construction of Some Molecu- lar Orbitals to Be Approximately Invariant for Changes from One Molecule to Another”. In: Rev. Mod. Phys. 32 (2 Apr. 1960), pp. 296–

  25. [36]

    ¨Uber eine neue Methode zur L¨ osung gewisser Variationsprobleme der math- ematischen Physik

    Walter Ritz. “ ¨Uber eine neue Methode zur L¨ osung gewisser Variationsprobleme der math- ematischen Physik.” ger. In: Journal f¨ ur die reine und angewandte Mathematik 135 (1909), pp. 1–61. url: http : / / eudml . org / doc / 149295

  26. [37]

    Daniel Marti-Dafcik, Hugh G. A. Burton, and David P. Tew. Spin coupling is all you need: Encoding strong electron correlation on quan- tum computers . 2024. arXiv: 2404 . 18878 [quant-ph]. url: https://arxiv.org/abs/ 2404.18878

  27. [38]

    Lo- calized Atomic and Molecular Orbitals

    Clyde Edmiston and Klaus Ruedenberg. “Lo- calized Atomic and Molecular Orbitals”. In: Rev. Mod. Phys. 35 (3 July 1963), pp. 457–

  28. [39]

    Concept of Or- bital Entanglement and Correlation in Quan- tum Chemistry

    Lexin Ding, Sam Mardazad, Sreetama Das, Szil´ ard Szalay, Ulrich Schollw¨ ock, Zolt´ an Zim- bor´ as, and Christian Schilling. “Concept of Or- bital Entanglement and Correlation in Quan- tum Chemistry”. In: Journal of Chemical The- ory and Computation 17.1 (Dec. 2020), pp. 79–

  29. [40]

    Natural orbitals and sparsity of quantum mutual information

    Leonardo Ratini, Chiara Capecci, and Leonardo Guidoni. Natural orbitals and sparsity of quantum mutual information

  30. [41]

    ¨Uber das Paulische ¨Aquivalenzverbot

    Paul Jordan and Eugen Wigner. “ ¨Uber das Paulische ¨Aquivalenzverbot”. In: Zeitschrift f¨ ur Physik 47 (1928), pp. 631–651. url: https : / / api . semanticscholar . org / CorpusID : 126400679

  31. [42]

    Lo- cal, expressive, quantum-number-preserving VQE ans¨ atze for fermionic systems

    Gian-Luca R Anselmetti, David Wierichs, Christian Gogolin, and Robert M Parrish. “Lo- cal, expressive, quantum-number-preserving VQE ans¨ atze for fermionic systems”. In: New Journal of Physics 23.11 (Nov. 2021), p. 113010. doi: 10.1088/1367- 2630/ac2cb3. url: https://dx.doi.o...

  32. [43]

    Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quan- tum Computers

    Xiaoyuan Liu, Anthony Angone, Ruslan Shay- dulin, Ilya Safro, Yuri Alexeev, and Lukasz Cin- cio. “Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quan- tum Computers”. In: IEEE Transactions on Quantum Engineering 3 (2022), pp. 1–20. issn: 2689-1808. d...

  33. [44]

    Mathematische Grundla- gen der Quantenmechanik

    John von Neumann. “Mathematische Grundla- gen der Quantenmechanik”. In: Mathematische Grundlagen der Quantenmechanik (1996). doi: 10.1007/978-3-642-61409-5

  34. [45]

    PySCF: the Python-based simulations of chemistry frame- work

    Qiming Sun, Timothy C Berkelbach, Nick S Blunt, George H Booth, Sheng Guo, Zhendong Li, Junzi Liu, James D McClain, Elvira R Say- futyarova, Sandeep Sharma, et al. “PySCF: the Python-based simulations of chemistry frame- work”. In: WIREs Comput. Mol. Sci. 8.1 (2018), e1340

  35. [46]

    Recent developments in the PySCF program package

    Qiming Sun, Xing Zhang, Samragni Banerjee, Peng Bao, Marc Barbry, Nick S Blunt, Nikolay A Bogdanov, George H Booth, Jia Chen, Zhi- Hao Cui, et al. “Recent developments in the PySCF program package”. In: The Journal of chemical physics 153.2 (2020)

  36. [47]

    Recent developments in the PySCF program package

    Qiming Sun et al. “Recent developments in the PySCF program package”. In: J. Phys. Chem. 153.2 (July 2020), p. 024109. issn: 0021-9606. doi: 10 . 1063 / 5 . 0006074. eprint: https : / / pubs.aip.org/aip/jcp/article- pdf/doi/ 10.1063/5.0006074/16722275/024109\_1\ _online . pdf....

  37. [48]

    Quantum @ L’Aquila

    Fabio Tarocco, Davide Materia, Leonardo Ra- tini, Chiara Capecci, and Leonardo Guidoni. Quantum @ L’Aquila . https://gitlab.com/ leonardoguidoni/quaq. 2025

  38. [49]

    Itera- tive natural orbitals for configuration interac- tion using perturbation theory

    Jawed A. Jafri and Jerry L. Whitten. “Itera- tive natural orbitals for configuration interac- tion using perturbation theory”. In: Theoretica Chimica Acta 44 (3 1977), pp. 305–313. issn: 0040-5744. doi: 10.1007/BF00551172. 23

  39. [50]

    Practical Methods of Optimiza- tion

    Roger Fletcher. Practical Methods of Optimiza- tion. Second. New York, NY, USA: John Wiley & Sons, 1987. Appendix A Complete results 24 A.1 Violin plots and Trajectories Convergence percentage correlation energy/absolute energy HEA against Multi-QIDA configurations for INOs mo...

  40. [52]

    A complete active space SCF method (CASSCF) using a density matrix formulated super-CI approach

    Bj¨ orn O. Roos, Peter R. Taylor, and Per E.M. Sigbahn. “A complete active space SCF method (CASSCF) using a density matrix formulated super-CI approach”. In: Chemical Physics 48.2 (1980), pp. 157–173. issn: 0301-

  41. [58]

    Qiskit: An Open-source Framework for Quantum Computing

    Qiskit contributors. Qiskit: An Open-source Framework for Quantum Computing . 2023. doi: 10.5281/zenodo.2573505

  42. [95]

    doi: 10.1021/acs.jctc

    issn: 1549-9626. doi: 10.1021/acs.jctc. 0c00559. url: http://dx.doi.org/10.1021/ acs.jctc.0c00559

  43. [104]

    org / 10

    doi: https : / / doi . org / 10 . 1016 / 0301-0104(80)80045-0 . url: https://www. sciencedirect.com/science/article/pii/ 0301010480800450

  44. [299]

    url: https : / / link

    doi: 10.1103/RevModPhys.32.296 . url: https : / / link . aps . org / doi / 10 . 1103 / RevModPhys.32.296

  45. [464]

    url: https : / / link

    doi: 10.1103/RevModPhys.35.457 . url: https : / / link . aps . org / doi / 10 . 1103 / RevModPhys.35.457

  46. [1723]

    url: https: //doi.org/10.1038/ncomms5213

    doi: 10.1038/ncomms5213. url: https: //doi.org/10.1038/ncomms5213

  47. [2023]

    08056 [quant-ph]

    arXiv: 2308 . 08056 [quant-ph]. url: https://arxiv.org/abs/2308.08056

  48. [6576]

    issn: 1089-5639. doi: 10 . 1021 / acs . jpca.3c02781

Pith tools

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