Alchemically Transferable Parameters for Variational Quantum Eigensolvers
Organizations: Institute for Computer Science, University of Augsburg, Germany · Center for Advanced Analytics and Predictive Sciences, University of Augsburg, Germany
Abstract
Machine-learned circuit parameters could remove one of the main bottlenecks of variational quantum eigensolvers: the classical optimization loop, with its typical barren plateaus, local minima, and costly energy and gradient evaluations, is replaced by a direct prediction. Prior work showed that machine-learning models paired with a structured circuit design can transfer across system size and structure within hydrogenic systems. The next step: Extending them to organic molecules would seem to require re-training on use-case-specific training sets. In this work, we show that this is not necessary by establishing an alchemical approach. A geometric projection places surrogate hydrogen atoms along the bond directions of the target molecule and so maps its local bonding environment onto small hydrogenic fragments. Existing hydrogenic solvers can then be reused as they are. The only new quantity is a single projection radius per bond type, which is fitted once on a small reference molecule and reused unchanged thereafter. We demonstrate the approach on the separable-pair circuit designs that have been used in prior work and extend the approach to multi-circuit approaches that span effective bases for quantum subspaces.
Figures & tables
| Molecule | Prediction | E (mE h ) | E (mE h ) |
| Methane | C-H | 0.022 | 0.124 |
| Ethane | C-H | 0.049 | 0.364 |
| C-C | 0.074 | 0.866 | |
| Both | 0.131 | 1.230 | |
| Propane | C-H | 0.072 | 0.387 |
| C-C | 0.108 | 1.785 |
| Molecule | Default | Projection |
| Methane | 18 | 12 |
| Ethane | 39 | 22 |
| Propane | 69 | 30 |
| Norbornane | 103 | 56 |
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
| Molecule | Error (mEh) | Iterations | |||
| 2-point | analytical | ||||
| H 2 | 0.00 | – | 8 | – | 4 |
| H 4 | 0.26 | 7 | 13 | 2 | 4 |
| H 6 | 1.01 | 11 | 20 | 3 | 5 |
| H 8 | 1.75 | 13 | 25 | 3 | 5 |
Variational Quantum Algorithms
Variational quantum algorithms use parameterized quantum circuits and classical optimization to approximate solutions to quantum and optimization problems.
See all 32 papers