Running Quantum Computers in Discovery Mode
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915368034893824 |
|---|---|
| author | Placke, Benedikt Sreejith, G. J. Lerose, Alessio Sondhi, S. L. |
| author_facet | Placke, Benedikt Sreejith, G. J. Lerose, Alessio Sondhi, S. L. |
| contents | We propose using quantum computers in conjunction with classical machine learning to discover instances of interesting quantum many-body dynamics. Concretely, an ``interest function'' is defined for a given circuit (family) instance that can be evaluated on a quantum computer. The circuit is then adapted by a classical learning agent to maximize interest. We illustrate this approach using two examples and show numerically that, within a sufficiently general circuit family, two simple interest functions based on (i) classifiability of evolved states and (ii) spectral properties of the unitary circuit, are maximized by discrete time crystals (DTCs) and dual-unitary circuits, respectively. For (i), we also simulate the adaptive optimization and show that it indeed finds DTCs with high probability. Our study suggests that learning agents with access to quantum-computing resources can discover new phenomena in many-body quantum dynamics, and establishes the design of good interest functions as a future research paradigm for quantum many-body physics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_01013 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Running Quantum Computers in Discovery Mode Placke, Benedikt Sreejith, G. J. Lerose, Alessio Sondhi, S. L. Quantum Physics Strongly Correlated Electrons High Energy Physics - Theory We propose using quantum computers in conjunction with classical machine learning to discover instances of interesting quantum many-body dynamics. Concretely, an ``interest function'' is defined for a given circuit (family) instance that can be evaluated on a quantum computer. The circuit is then adapted by a classical learning agent to maximize interest. We illustrate this approach using two examples and show numerically that, within a sufficiently general circuit family, two simple interest functions based on (i) classifiability of evolved states and (ii) spectral properties of the unitary circuit, are maximized by discrete time crystals (DTCs) and dual-unitary circuits, respectively. For (i), we also simulate the adaptive optimization and show that it indeed finds DTCs with high probability. Our study suggests that learning agents with access to quantum-computing resources can discover new phenomena in many-body quantum dynamics, and establishes the design of good interest functions as a future research paradigm for quantum many-body physics. |
| title | Running Quantum Computers in Discovery Mode |
| topic | Quantum Physics Strongly Correlated Electrons High Energy Physics - Theory |
| url | https://arxiv.org/abs/2507.01013 |