pith. sign in

arxiv: 2507.01013 · v1 · pith:RAVUGUAAnew · submitted 2025-07-01 · 🪐 quant-ph · cond-mat.str-el· hep-th

Running Quantum Computers in Discovery Mode

classification 🪐 quant-ph cond-mat.str-elhep-th
keywords quantumcircuitinterestlearningmany-bodyclassicalcomputersdiscover
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.