Automated near-term quantum algorithm discovery for molecular ground states
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911554100789248 |
|---|---|
| author | Finger, Fabian Rapp, Frederic Kalidindi, Pranav He, Kerry Yin, Kante Koziell-Pipe, Alexander Manrique, David Zsolt Greene-Diniz, Gabriel Clark, Stephen Fawzi, Hamza Romera-Paredes, Bernardino Fawzi, Alhussein Meichanetzidis, Konstantinos |
| author_facet | Finger, Fabian Rapp, Frederic Kalidindi, Pranav He, Kerry Yin, Kante Koziell-Pipe, Alexander Manrique, David Zsolt Greene-Diniz, Gabriel Clark, Stephen Fawzi, Hamza Romera-Paredes, Bernardino Fawzi, Alhussein Meichanetzidis, Konstantinos |
| contents | Designing quantum algorithms is a complex and counterintuitive task, making it an ideal candidate for AI-driven algorithm discovery. To this end, we employ the Hive, an AI platform for program synthesis, which utilises large language models to drive a highly distributed evolutionary process for discovering new algorithms. We focus on the ground state problem in quantum chemistry, and discover efficient quantum heuristic algorithms that solve it for molecules LiH, H2O, and F2 while exhibiting significant reductions in quantum resources relative to state-of-the-art near-term quantum algorithms. Further, we perform an interpretability study on the discovered algorithms and identify the key functions responsible for the efficiency gains. Finally, we benchmark the Hive-discovered circuits on the Quantinuum System Model H2 quantum computer and identify minimum system requirements for chemical precision. We envision that this novel approach to quantum algorithm discovery applies to other domains beyond chemistry, as well as to designing quantum algorithms for fault-tolerant quantum computers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_26359 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Automated near-term quantum algorithm discovery for molecular ground states Finger, Fabian Rapp, Frederic Kalidindi, Pranav He, Kerry Yin, Kante Koziell-Pipe, Alexander Manrique, David Zsolt Greene-Diniz, Gabriel Clark, Stephen Fawzi, Hamza Romera-Paredes, Bernardino Fawzi, Alhussein Meichanetzidis, Konstantinos Quantum Physics Artificial Intelligence Designing quantum algorithms is a complex and counterintuitive task, making it an ideal candidate for AI-driven algorithm discovery. To this end, we employ the Hive, an AI platform for program synthesis, which utilises large language models to drive a highly distributed evolutionary process for discovering new algorithms. We focus on the ground state problem in quantum chemistry, and discover efficient quantum heuristic algorithms that solve it for molecules LiH, H2O, and F2 while exhibiting significant reductions in quantum resources relative to state-of-the-art near-term quantum algorithms. Further, we perform an interpretability study on the discovered algorithms and identify the key functions responsible for the efficiency gains. Finally, we benchmark the Hive-discovered circuits on the Quantinuum System Model H2 quantum computer and identify minimum system requirements for chemical precision. We envision that this novel approach to quantum algorithm discovery applies to other domains beyond chemistry, as well as to designing quantum algorithms for fault-tolerant quantum computers. |
| title | Automated near-term quantum algorithm discovery for molecular ground states |
| topic | Quantum Physics Artificial Intelligence |
| url | https://arxiv.org/abs/2603.26359 |