AI coding agents evolve simple ground-state protocols into improved versions for VQE, DMRG, and AFQMC on spin models and molecules by using executable energy scores under fixed compute budgets.
Bakalov, Frédéric Sauvage, Alexander F
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 4verdicts
UNVERDICTED 4roles
background 1polarities
unclear 1representative citing papers
Fragment classification is efficiently learnable by quantum neural networks under suitable conditions but resists known classical dequantization techniques.
QTL unifies expectation-value minimization with CVaR and Gibbs heuristics under one tunable operator, amplifying gradients in structured cases while preserving global minima and shifting the bottleneck to measurement variance.
A necessary condition for variational quantum circuits to reach exact ground states requires matching module projection norms between input and solution, enabling classical O(n^5) exact solvers for problems like MaxCut.
citing papers explorer
-
Optimizing ground state preparation protocols with autoresearch
AI coding agents evolve simple ground-state protocols into improved versions for VQE, DMRG, and AFQMC on spin models and molecules by using executable energy scores under fixed compute budgets.
-
Fragmentation is Efficiently Learnable by Quantum Neural Networks
Fragment classification is efficiently learnable by quantum neural networks under suitable conditions but resists known classical dequantization techniques.
-
Quantum Tilted Loss in Variational Optimization: Theory and Applications
QTL unifies expectation-value minimization with CVaR and Gibbs heuristics under one tunable operator, amplifying gradients in structured cases while preserving global minima and shifting the bottleneck to measurement variance.
-
Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module
A necessary condition for variational quantum circuits to reach exact ground states requires matching module projection norms between input and solution, enabling classical O(n^5) exact solvers for problems like MaxCut.