Pith. sign in

REVIEW 3 major objections 3 minor 3 cited by

An Optimized Construction of Lie Algebra Generator Pools for Variational Quantum Eigensolvers in Chemistry

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

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

Pith's one-line read This paper claims that the completeness of a Pauli-operator pool for a Lie algebra can be certified in polynomial time by checking the rank of an anti-commutation matrix, replacing exponential searches for minimal generator sets.

desk verdict The central rank-only MCP criterion is false: a two-qubit counterexample refutes Theorem 19, so the paper's polynomial completeness guarantee does not hold, though the batching heuristics may have some value. read the letter →

arxiv 2511.22593 v3 pith:7ZMPZVDP submitted 2025-11-27 quant-ph

Yaromir Viswanathan , Olivier Adjoua , César Feniou , Siwar Badreddine , Jean-Philip Piquemal This is my paper
classification quant-ph MSC 15A6317B0581P68
keywords LiealgebrasPaulistringsminimalcompletepoolsanti-commutationgraphsmatrixcongruenceADAPT-VQEvariationalquantumeigensolverchemistry
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

The paper tackles the bottleneck of building minimal complete pools (MCPs) of Pauli operators for variational quantum eigensolvers: previously, verifying that a candidate pool generates the full target Lie algebra required constructing the algebra's basis through nested commutators, a process that scales exponentially with system size. The authors claim a pool is an MCP if and only if its associated anti-commutation matrix Γ_A has the same rank and cardinality as a reference MCP's matrix. Because Γ_A is a symmetric zero-diagonal binary matrix, its congruence class — and hence the generated algebra — is determined by its rank alone. If correct, this turns MCP verification into an O(N^3) rank computation and enables user-defined symmetry-preserving pools that scale linearly with qubit count. The authors demonstrate the method in batched ADAPT-VQE and fixed-ansatz NI-DUCC-VQE on molecules up to 26 qubits, reaching chemical accuracy in strongly correlated systems without the previous exponential pre-computation.

What carries the argument

The Γ_A matrix: a symmetric binary matrix whose (i,j) entry is 1 exactly when Pauli strings P_i and P_j anti-commute, and 0 otherwise. Pool contraction — replacing one generator by its commutator with another — is represented as congruence Γ_A → P^T Γ_A P for an invertible binary matrix P, so the entire search for a complete pool becomes a statement in linear algebra. Since symmetric zero-diagonal binary matrices are classified up to congruence by rank, rank(Γ_A) becomes a candidate complete invariant for the Lie algebra generated by the pool, provided bracket-independence filters out redundant generators.

What would settle it

For N=2 qubits, compare the four-string pool {X1, Z1, X1X2, Z2} with {X1, Z1, X2, Z2}. Both have Γ-matrices of rank 4, but explicit DLA-basis closure computations show the first generates su(4) while the second generates su(2)⊕su(2). Existence of such same-rank/different-algebra pairs would directly refute Theorem 19.

Watch

Extended reading notes

Core claim

The central claim is Theorem 19: a bracket-independent set of Pauli strings is a minimal complete pool for a given Lie algebra if and only if the rank of its Γ_A matrix equals the rank of the reference MCP's Γ matrix and the cardinalities match. This descends from the MCP Congruence Theorem, which states that a bracket-independent set is an MCP exactly when its Γ_A matrix is congruent to a canonical matrix for the target algebra under an invertible binary transformation. The proof uses the classical classification of symmetric zero-diagonal binary matrices over F2, where congruence classes are fully determined by rank, together with the observation that the graph contraction procedure of poo

Load-bearing premise

The framework assumes that a congruence transformation of the anti-commutation matrix preserves the Lie algebra generated by the pool — if two pools with congruent Γ matrices can generate different algebras, the rank criterion ceases to certify completeness.

Editorial extensions

If this is right

  • MCP verification and construction become polynomial-time operations, replacing exponential DLA-closure checks with an O(N^3) rank computation.
  • Symmetry-preserving pools that respect molecular symmetries can be built and certified at scale, yielding operator pools of size O(N) instead of O(N^4).
  • Batched ADAPT-VQE using these pools requires far fewer gradient evaluations to reach chemical accuracy, especially in strongly correlated systems such as stretched H6.
  • The fixed-ansatz NI-DUCC-VQE, previously capped near 14 qubits by pool-construction cost, can now simulate 16- and 26-qubit molecules (H8 and H2O) with modest numbers of function evaluations.
  • Since the framework is stated for any Lie algebra with a Pauli-string basis, the same rank criterion applies beyond chemistry, including quantum error correction, quantum control, and Hamiltonian simulation.

Reading between the lines

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

  • The paper's termination condition for symmetry-preserving pools — rank(Γ_A)=2N−4 — is presented as a numerical observation; a formal characterization of the 'odd-string even-flip' subalgebra would make the algorithm fully rigorous.
  • If rank is truly a complete invariant, pool design reduces to a graph classification problem: enumerate all bracket-independent sets whose anti-commutation graph has the reference rank, which could allow systematic exploration of all MCPs for a target algebra.
  • The congruence-preserves-algebra step (Proposition 13) is the logical hinge; before relying on the rank criterion for large systems, one should stress-test it against small sets with equal rank but different generated algebras.
  • Testable extension: for small N, enumerate all bracket-independent pools of a given size and rank, compute their DLA closures explicitly, and check whether equal-rank pools always generate isomorphic algebras; any counterexample would bound the validity of the theorem.
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 / 3 minor

Summary. This paper claims a polynomial-time criterion for verifying Minimal Complete Pools (MCPs) of Pauli-string generators for a prescribed Lie algebra. The central result, Theorem 19, states that a bracket-independent Pauli set A' is an MCP for the same Lie algebra g as a reference MCP A if and only if rank(Γ_A)=rank(Γ_A') and |A|=|A'|, where Γ is the anti-commutation adjacency matrix over F_2. The authors use this to construct symmetry-preserving pools for ADAPT-VQE and NI-DUCC-VQE, reporting numerical benchmarks on LiH, H6, H8, and H2O. The claimed contribution is to replace exponential MCP construction with O(N^3) rank evaluation.

Significance. If Theorem 19 were correct, the paper would provide a substantial advance: exponential verification of complete operator pools would be replaced by a polynomial rank computation, with direct consequences for ADAPT-VQE and fixed-ansatz methods. The numerical study is extensive, and the batched-ADAPT-VQE idea is reasonable. However, the central mathematical claim is false. The failure is not a minor technicality: it invalidates the rank-based completeness criterion, the termination condition of the construction algorithm, and the 'provable' status claimed for the method. The numerical benchmarks, while interesting, cannot substitute for a valid completeness guarantee.

major comments (3)
  1. [Section II C, Theorem 19] The rank criterion is false. Let A={X1,Z1,X1X2,Z2} and B={X1,Z1,X2,Z2} on two qubits. Both sets are bracket-independent, have |A|=|B|=4, and a direct F2 computation gives rank(Γ_A)=rank(Γ_B)=4. Direct bracket closure of A yields the 10 Pauli strings {X1,Z1,X1X2,Z2,Y1,X1Y2,Y1X2,Z1X2,Y1Y2,Z1Y2}, which are closed under commutation, so DLA(A) is 10-dimensional; DLA(B)=su(2)⊕su(2) is 6-dimensional. Take g=DLA(A). Then A is an MCP for g: no 3-element Pauli set can generate a 10-dimensional algebra, since with 3 generators every nested commutator is a product of a subset of the three generators, giving at most 7 nonzero Pauli strings. B satisfies the rank/cardinality hypotheses of Theorem 19 but is not complete for g. Thus the 'if' direction of Theorem 19 is false.
  2. [Section II C, Propositions 13/15 and Theorem 18] The mechanism behind the false theorem is that arbitrary congruence is not a valid contraction sequence. Equation (7) with e_i+e_j describes a contraction only when P_i and P_j anti-commute; when they commute, the contraction produces the zero operator, not the Pauli product used in the formula. The cited F2 classification of symmetric zero-diagonal matrices is a classification of all congruence classes, but not every invertible congruence transformation can be decomposed into the elementary moves that correspond to allowed contractions. Since Γ_A and Γ_B in the counterexample are congruent (same size and rank) yet generate different DLAs, congruence of Γ does not preserve the generated Lie algebra. Therefore Theorem 18 and its corollary Theorem 19 cannot be correct as stated.
  3. [Section IV, Operator pool construction; Section II D] The algorithm's termination condition in the Methods section is rank(Γ_A)=2N−4, and Section II D explicitly states this is 'currently numerical, as a formal proof and detailed characterization of this Lie subalgebra are beyond the scope of this work.' Thus even if Theorems 18–19 were true, the algorithm's output would not be a proven MCP for the prescribed symmetry-preserving algebra; it would rely on an empirical rank target. Since Theorem 19 is false, the numerical convergence in Figures 2–4 cannot provide evidence of mathematically guaranteed completeness. The abstract's claim of 'mathematically verified generator pools' and Table I's 'provable' entry are therefore unsupported.
minor comments (3)
  1. [Introduction, paragraph 3] The text states both that a minimum of 2N+1 elements is required to generate su(2^N) and that the theoretical minimum MCP size is 2n−2 operators. These statements are inconsistent; please clarify which quantity is intended and under which conditions.
  2. [Definition 16 and Remark 12] Typos: 'bracket-independant' should be 'bracket-independent', and 'foward' should be 'forward'.
  3. [Section IV, Operator pool construction] The line 'rank of Γ_A ∈ R^{|A|×|A|}' should read Γ_A ∈ F_2^{|A|×|A|}; the matrix is over F_2, not R.

Circularity Check

1 steps flagged · score 5.0 of 10

VQE pool 'completeness' is circular: the rank-2N−4 termination criterion is a numerical fit and is then used as the certificate that the pools are complete.

  1. fitted input called prediction [Section II D (Outlook on Applications) and Section IV Methods (Operator pool construction)]
    "We found numerically that the MCPs corresponding to this specific Lie subalgebra, which is a subalgebra of so(2N), have Γ_A matrices of rank 2N−4. This finding is currently numerical, as a formal proof and detailed characterization of this Lie subalgebra are beyond the scope of this work. ... The algorithm terminates if the rank is rank(Γ_A) = 2N−4."

    The rank threshold 2N−4 is not derived from an independent reference MCP or from a proof; the paper explicitly labels it a numerical finding. The pool-construction algorithm then uses exactly this fitted rank as its termination/verification condition. Pools that reach the empirically fitted rank are labeled 'complete' and their convergence behavior is attributed to that completeness. Thus the verification criterion and the property being verified are the same numerically fitted quantity; no independent completeness check is performed for the symmetry-adapted subalgebras used in the benchmarks.

full rationale

The central mathematical claim is not itself circular: Theorem 19 is an attempted algebraic characterization, and its cited inputs—anti-commutation graph classification [4] and the congruence classification of symmetric binary matrices [19]—are external, not self-citations. However, the application-level completeness claim is circular. For the symmetry-adapted subalgebras used in all numerical results, the paper supplies no independent reference MCP. Instead it states that the rank 2N−4 was found numerically and then uses that same rank as the algorithm's termination condition. The resulting pools are described as 'provable' and 'verified,' and their convergence is explained by completeness, even though the completeness certificate is the same empirical rank used to build them. I do not count the false rank invariant itself as circularity—a rank-4 congruence class containing both an su(4) and an su(2)⊕su(2) generating set is a correctness failure, not a self-referential reduction—but it reinforces that the rank target cannot serve as an independent completeness certificate. External benchmarks (Full-CI energies, standard ADAPT-VQE comparisons) provide independent content, so the score is moderate rather than extreme.

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

The ledger shows the central theorem is not self-contained: it imports a rank-only classification and a numerical rank target; the key DLA-preservation assumption is false.

free parameters (1)
  • symmetry-preserving MCP rank target = 2N−4
    Termination condition for pool construction; authors state 'We found numerically ... rank 2N−4. This finding is currently numerical.' It is inferred from the systems tested and then used as proof of completeness.
assumptions (4)
  • domain assumption Congruence transformations of Γ_A (arbitrary invertible P over F2) correspond to contraction operations that preserve the generated Lie algebra.
    Used in Propositions 13/15 and Theorem 18 to equate matrix congruence with MCP status; false: the rank-4 congruence class contains both su(4)-generating and su(2)⊕su(2)-generating sets.
  • standard math Symmetric zero-diagonal binary matrices are classified up to congruence by rank.
    Taken from [19]; correct for these matrices, but insufficient for the DLA claim.
  • ad hoc to paper The symmetry-preserving subalgebra of so(2^N) has MCPs whose Γ matrices have rank 2N−4.
    Stated as numerical finding in Section II D; no proof, load-bearing for the chemistry applications.
  • ad hoc to paper Bracket-independence plus same size/rank as a reference MCP is sufficient for MCP (Theorem 19).
    Central theorem; false by counterexample, and proof deferred to Supplementary Material.

how reviews work

0 comments
Cite this review

Pith. "Pith review of An Optimized Construction of Lie Algebra Generator Pools for Variational Quantum Eigensolvers in Chemistry." pith.science (2026). https://pith.science/paper/7ZMPZVDP

@misc{pith2026251122593,
  author       = {Pith},
  title        = {Pith review of: An Optimized Construction of Lie Algebra Generator Pools for Variational Quantum Eigensolvers in Chemistry},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7ZMPZVDP}},
  note         = {Machine review of arXiv:2511.22593}
}
read the original abstract

Lie algebras are essential mathematical structures used in physics to describe sets of quantum operators. Identifying a minimal set of generators to construct these algebras is a central challenge. The traditional search for such generators relies on greedy construction steps applied to an exponentially growing number of candidate operators, making it computationally intractable. Here we show a general, polynomial-scaling strategy, based on fundamental Lie-algebraic properties, to overcome this bottleneck. We apply this framework to quantum chemistry, specifically to adaptive variational algorithms that simulate molecular ground states. By integrating our mathematically verified generator pools into a batched algorithmic framework, we reduce the required quantum resources and improve convergence for strongly correlated systems. Furthermore, this approach eliminates computational bottlenecks that previously restricted fixed-ansatz non-iterative coupled-cluster methods to small molecules, enabling simulations of complex systems well beyond previous limits. This foundational framework also presents broad applications across quantum computing, including quantum error correction, machine learning, and hardware control.

Figures

Figures reproduced from arXiv: 2511.22593 by the authors.

Figure 1
Figure 1. FIG. 1: We analyze the anti-commutation graph corresponding to the set of Pauli strings [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2: Convergence plots for ADAPT-VQE and MB-ADAPT-VQE methods across various molecules: LiH [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3: Convergence plots for NI-DUCC-VQE method across various molecules using different pool operators: the [PITH_FULL_IMAGE:figures/full_fig_p010_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: FIG. 4: Convergence plots for ADAPT-VQE and MB-ADAPT-VQE methods across H [PITH_FULL_IMAGE:figures/full_fig_p011_4.png]
Figure 5
Figure 5. Figure 5: FIG. 5: Schematic of necessary steps towards a user-defined operator pool [PITH_FULL_IMAGE:figures/full_fig_p013_5.png]

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. From Pauli Strings to Quantum Dynamics: A Unified Characterization

    quant-ph 2026-06 unverdicted novelty 6.0 of 10

    Develops an invariant-based framework connecting Pauli Lie algebras to transvection-generated Clifford subgroups for quantum reachability and dynamics analysis.

  2. Projector Quantum Variational Ansatz

    quant-ph 2026-06 unverdicted novelty 6.0 of 10

    The Projector Variational Ansatz (PVA) is a new VQE ansatz that can match ISQ-QSP or ADAPT-VQE structures and converges with shallower circuits than standard ADAPT-VQE in experiments.

  3. A Dynamical Lie-Algebraic Framework for Hamiltonian Engineering and Quantum Control

    quant-ph 2026-03 reject novelty 5.0 of 10

    A Lie-algebra toolkit that composes, preserves, and reduces Hamiltonian generator sets, including a nearest-neighbor su(2^N) generating set and a filtering-operator reduction, though the reduction proof and one error-...

Reference graph

Works this paper leans on

39 extracted references · 3 linked inside Pith · cited by 3 Pith papers

  1. [1]

    Select operator to add

  2. [2]

    Verify bracket-independence

  3. [3]

    5: Schematic of necessary steps towards a user-defined operator pool 14

    Verify rank of Required rank is: 2N-4 ● ADAPT-VQE and MB-ADAPT-VQE ● Fixed ansatz (NIDUCC) FIG. 5: Schematic of necessary steps towards a user-defined operator pool 14

  4. [4]

    Albertini and D

    F. Albertini and D. D’Alessandro. Notions of controlla- bility for quantum mechanical systems. InProceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228), volume 2 ofCDC-01, page 1589–1594. IEEE, 2001

    2001

  5. [5]

    Kem- per, and Bojko N

    Roeland Wiersema, Efekan K¨ okc¨ u, Alexander F. Kem- per, and Bojko N. Bakalov. Classification of dynamical lie algebras of 2-local spin systems on linear, circular and fully connected topologies.npj Quantum Information, 10(1), November 2024

    2024

  6. [6]

    Goh, Martin Larocca, Lukasz Cincio, M

    Matthew L. Goh, Martin Larocca, Lukasz Cincio, M. Cerezo, and Fr´ ed´ eric Sauvage. Lie-algebraic classi- cal simulations for quantum computing.Physical Review Research, 7(3), September 2025

    2025

  7. [7]

    Full classification of pauli lie algebras.ArX- viv:2408.00081 https://arxiv.org/abs/2408.00081, 2024

    Gerard Aguilar, Simon Cichy, Jens Eisert, and Lennart Bittel. Full classification of pauli lie algebras.ArX- viv:2408.00081 https://arxiv.org/abs/2408.00081, 2024

    arXiv 2024

  8. [8]

    Smith, Maxime Cautr` es, David T

    Isaac D. Smith, Maxime Cautr` es, David T. Stephen, and Hendrik Poulsen Nautrup. Optimally generatingsu(2 N ) using pauli strings.Physical Review Letters, 134(20), May 2025

    2025

Show all 39 references
  1. [9]

    Kem- per, and Bojko N

    Efekan K¨ okc¨ u, Roeland Wiersema, Alexander F. Kem- per, and Bojko N. Bakalov. Classification of dynamical lie algebras generated by spin interactions on undirected graphs, 2024

    2024

  2. [10]

    Coles, M

    Sujay Kazi, Mart ´ ın Larocca, Marco Farinati, Patrick J. Coles, M. Cerezo, and Robert Zeier. Analyzing the quan- tum approximate optimization algorithm: Ans¨ atze, sym- metries, and lie algebras.PRX Quantum, 6(4), November 2025

    2025

  3. [11]

    V. O. Shkolnikov, Nicholas J. Mayhall, Sophia E. Economou, and Edwin Barnes. Avoiding symmetry road- blocks and minimizing the measurement overhead of adaptive variational quantum eigensolvers.Quantum, 7:1040, June 2023

    2023

  4. [12]

    Sapova and Aleksey K

    Mariia D. Sapova and Aleksey K. Fedorov. Variational quantum eigensolver techniques for simulating carbon monoxide oxidation.Communications Physics, 5(1), Au- gust 2022

    2022

  5. [13]

    Non- iterative disentangled unitary coupled-cluster based on lie-algebraic structure.Quantum Science and Technol- ogy, 10(2):025031, February 2025

    Mohammad Haidar, Olivier Adjoua, Siwar Badreddine, Alberto Peruzzo, and Jean-Philip Piquemal. Non- iterative disentangled unitary coupled-cluster based on lie-algebraic structure.Quantum Science and Technol- ogy, 10(2):025031, February 2025

    2025

  6. [14]

    Shkolnikov, George S

    Ho Lun Tang, V.O. Shkolnikov, George S. Barron, Harper R. Grimsley, Nicholas J. Mayhall, Edwin Barnes, and Sophia E. Economou. Qubit-adapt-vqe: An adaptive algorithm for constructing hardware-efficient ans¨ atze on a quantum processor.PRX Quantum, 2(2), April 2021

    2021

  7. [15]

    On the order problem in construction of unitary operators for the variational quantum eigensolver.Phys- ical Chemistry Chemical Physics, 22(23):12980–12986, 2020

    Artur F Izmaylov, Manuel D ´ ıaz-Tinoco, and Robert A Lang. On the order problem in construction of unitary operators for the variational quantum eigensolver.Phys- ical Chemistry Chemical Physics, 22(23):12980–12986, 2020

    2020

  8. [16]

    Grimsley, Sophia E

    Harper R. Grimsley, Sophia E. Economou, Edwin Barnes, and Nicholas J. Mayhall. An adaptive variational algorithm for exact molecular simulations on a quantum computer.Nature Communications, 10(1), July 2019

    2019

  9. [17]

    Greedy gradient-free adaptive varia- tional quantum algorithms on a noisy intermediate scale quantum computer.Scientific Reports, 15(1):1–18, 2025

    C´ esar Feniou, Muhammad Hassan, Baptiste Claudon, Axel Courtat, Olivier Adjoua, Yvon Maday, and Jean- Philip Piquemal. Greedy gradient-free adaptive varia- tional quantum algorithms on a noisy intermediate scale quantum computer.Scientific Reports, 15(1):1–18, 2025

    2025

  10. [18]

    Fast numerical generation of lie closure, 2025

    Yutaro Iiyama. Fast numerical generation of lie closure, 2025

    2025

  11. [19]

    S. G. Schirmer, H. Fu, and A. I. Solomon. Complete controllability of quantum systems.Physical Review A, 63(6), May 2001

    2001

  12. [20]

    An introduction to quantum machine learning.Contem- porary Physics, 56(2):172–185, October 2014

    Maria Schuld, Ilya Sinayskiy, and Francesco Petruccione. An introduction to quantum machine learning.Contem- porary Physics, 56(2):172–185, October 2014

    2014

  13. [21]

    Exploiting symmetry in vari- ational quantum machine learning.PRX Quantum, 4(1), March 2023

    Johannes Jakob Meyer, Marian Mularski, Elies Gil- Fuster, Antonio Anna Mele, Francesco Arzani, Alissa Wilms, and Jens Eisert. Exploiting symmetry in vari- ational quantum machine learning.PRX Quantum, 4(1), March 2023

    2023

  14. [22]

    Two congruence classes for symmetric binary matrices over f2.WSEAS Transactions on Mathematics, 7, 01 2008

    Yong-Hyuk Kim and Keomkyo Seo. Two congruence classes for symmetric binary matrices over f2.WSEAS Transactions on Mathematics, 7, 01 2008

    2008

  15. [23]

    and Qubit Pharmaceuticals

    Sorbonne Universit´ e Olivier Adjoua et al. and Qubit Pharmaceuticals. The hyperion emulator, 2025

    2025

  16. [24]

    Yordanov, V

    Yordan S. Yordanov, V. Armaos, Crispin H. W. Barnes, and David R. M. Arvidsson-Shukur. Qubit-excitation- based adaptive variational quantum eigensolver.Com- munications Physics, 4(1), October 2021

    2021

  17. [25]

    Development of a compactansatzvia operator commutativity screening: Digital quantum sim- ulation of molecular systems.The Journal of Chemical Physics, 159(1), July 2023

    Dibyendu Mondal, Dipanjali Halder, Sonaldeep Halder, and Rahul Maitra. Development of a compactansatzvia operator commutativity screening: Digital quantum sim- ulation of molecular systems.The Journal of Chemical Physics, 159(1), July 2023

    2023

  18. [26]

    Noise-independent route toward the genesis of a compact ansatz for molecular energetics: A dynamic approach

    Dipanjali Halder, Dibyendu Mondal, and Rahul Maitra. Noise-independent route toward the genesis of a compact ansatz for molecular energetics: A dynamic approach. The Journal of Chemical Physics, 160(12), March 2024

    2024

  19. [27]

    Barren plateaus in quantum neural network training landscapes.Nature Communications, 9(1):4812, 2018

    Jarrod R McClean, Sergio Boixo, Vadim N Smelyanskiy, Ryan Babbush, and Hartmut Neven. Barren plateaus in quantum neural network training landscapes.Nature Communications, 9(1):4812, 2018

    2018

  20. [28]

    Coles, Lukasz Cincio, Jarrod R

    Mart ´ ın Larocca, Supanut Thanasilp, Samson Wang, Ku- nal Sharma, Jacob Biamonte, Patrick J. Coles, Lukasz Cincio, Jarrod R. McClean, Zo¨ e Holmes, and M. Cerezo. Barren plateaus in variational quantum computing.Na- ture Reviews Physics, 7(4):174–189, March 2025

    2025

  21. [29]

    Quantum gambling: Best-arm strategies for generator selection in adaptive variational algorithms.arXiv preprint arXiv:2509.14917, 2025

    Rick Huang and Artur F Izmaylov. Quantum gambling: Best-arm strategies for generator selection in adaptive variational algorithms.arXiv preprint arXiv:2509.14917, 2025

    2025

  22. [30]

    How to really mea- sure operator gradients in adapt-vqe.arXiv preprint arXiv:2306.03227, 2023

    Panagiotis G Anastasiou, Nicholas J Mayhall, Edwin Barnes, and Sophia E Economou. How to really mea- sure operator gradients in adapt-vqe.arXiv preprint arXiv:2306.03227, 2023

    2023 arXiv

  23. [31]

    An efficient adap- tive variational quantum solver of the schr¨ odinger equa- tion based on reduced density matrices.The Journal of chemical physics, 154(24), 2021

    Jie Liu, Zhenyu Li, and Jinlong Yang. An efficient adap- tive variational quantum solver of the schr¨ odinger equa- tion based on reduced density matrices.The Journal of chemical physics, 154(24), 2021

    2021

  24. [32]

    Amplitude reordering accelerates the adaptive variational quantum eigensolver algorithms.Journal of Chemical Theory and Computa- tion, 18(9):5267–5275, 2022

    Zhihao Lan and WanZhen Liang. Amplitude reordering accelerates the adaptive variational quantum eigensolver algorithms.Journal of Chemical Theory and Computa- tion, 18(9):5267–5275, 2022

    2022

  25. [33]

    Stabilizer codes and quantum er- ror correction.arXiv preprint arXiv:quant-ph/9705052, 1997

    Daniel Gottesman. Stabilizer codes and quantum er- ror correction.arXiv preprint arXiv:quant-ph/9705052, 1997. 15

    1997 arXiv

  26. [34]

    M. A. Nielsen and I. L. Chuang.Quantum Computation and Quantum Information. Cambridge University Press, 2000

    2000

  27. [35]

    Stabilizer formalism for operator algebra quantum error correction.Quantum, 8:1261, 2024

    Guillaume Dauphinais, David W Kribs, and Michael Vas- mer. Stabilizer formalism for operator algebra quantum error correction.Quantum, 8:1261, 2024

    2024

  28. [36]

    Quantum optimal control for pauli operators based on spin-1/2 system.International Journal of Theoretical Physics, 61(12):268, 2022

    Jin-Fang Li, Zi-Xuan Xin, Jie-Ru Hu, and Dong-Shan He. Quantum optimal control for pauli operators based on spin-1/2 system.International Journal of Theoretical Physics, 61(12):268, 2022

    2022

  29. [37]

    Ex- tension of exactly-solvable hamiltonians using symme- tries of lie algebras.The Journal of Physical Chemistry A, 128(20):4150–4159, 2024

    Smik Patel, Tzu-Ching Yen, and Artur F Izmaylov. Ex- tension of exactly-solvable hamiltonians using symme- tries of lie algebras.The Journal of Physical Chemistry A, 128(20):4150–4159, 2024

    2024

  30. [38]

    Overlap-adapt-vqe: practical quantum chemistry on quantum computers via overlap-guided compact ans¨ atze

    C´ esar Feniou, Muhammad Hassan, Diata Traor´ e, Em- manuel Giner, Yvon Maday, and Jean-Philip Pique- mal. Overlap-adapt-vqe: practical quantum chemistry on quantum computers via overlap-guided compact ans¨ atze. Communications Physics, 6(1):192, 2023

    2023

  31. [39]

    Sparse quantum state preparation for strongly correlated systems.The Journal of Physical Chemistry Letters, 15:3197–3205, 2024

    C´ esar Feniou, Olivier Adjoua, Baptiste Claudon, Julien Zylberman, Emmanuel Giner, and Jean-Philip Piquemal. Sparse quantum state preparation for strongly correlated systems.The Journal of Physical Chemistry Letters, 15:3197–3205, 2024. PMID: 38483286

    2024

Pith tools

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