Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2507.01013

Running Quantum Computers in Discovery Mode

Aydin Deger·Benedikt Placke·G. J. Sreejith·Alessio Lerose·S. L. Sondhi
View original source ↗Read source document ↗Export metadata ↓

Abstract

Using a 36-qubit quantum processor, we demonstrate that, by operating in conjunction with a classical machine learning agent, quantum computers can discover instances of interesting quantum many-body dynamics. The central object in this new mode of use of a quantum device is an "interest function" defined for a given circuit (family) instance that can be evaluated on a quantum computer. The circuit is adapted by the learning agent to maximize interest. We illustrate this approach using two examples and show that, within a sufficiently general circuit family, two simple interest functions based on (i) binary 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 the classifiability-based interest function, we implement the protocol on a superconducting quantum processor and find that it indeed discovers DTCs with high probability. For the dual-unitaries, our simulations of the dynamics suggest that an interest-function optimization would have set us close to a discovery of such unitaries. Our results using quantum devices and accompanying simulations suggest that learning agents with access to quantum-computing resources can almost autonomously discover new phenomena in many-body quantum dynamics, and establish the design of good interest functions optimizable in hybrid devices as a paradigm for quantum many-body physics.

Explore related subjects

quant-phcond-mat.str-elhep-th

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aydin Deger, Benedikt Placke, G. J. Sreejith, Alessio Lerose, S. L. Sondhi. 2026-08-05. Running Quantum Computers in Discovery Mode. https://arxiv.org/abs/2507.01013

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quantum Mechanics as a Reversible Diffusion Theory

This paper proposes an interpretation of quantum mechanics, relying on the time-symmetric stochastic dynamics of quantum particles and on non-classical probability theory. Our main purpose is to demonstrate that the wave function and its complex conjugate can be interpreted as complex probability distributions in two complex diffusion equations related to non-real forward and backward in time stochastic motions respectively. We say non-real because Schroedinger forward and backward diffusions describe both reversible (real trajectories) and irreversible trajectories (non-real trajectories). The reversible trajectories are the only real trajectories and are given by the intersection of those forward and backward processes. It turns out that if we translate this intersection using set-theoretic language, we are led to a reversible diffusion described by Born rule probabilities. This proposal is useful also for explaining more about the role of complex numbers in quantum mechanics that produces this so-called "wave-like" nature of quantum reality. Our perspective also challenges the notion of physical superposition and aims at a derivation of superposition principle not based on the linearity of Schroedinger's equation but relying on pure probability theory. Moreover, it is suggested that, embracing the idea of stochastic processes in quantum theory, explains the reasons for the appearance of classical behavior in large objects, in contrast to the quantum behavior of small ones. In other words, we claim that a combination of a probabilistic and no-ontic view (neither epistemic though) of the wave function with a stochastic hidden-variables approach, may provide some insight into the quantum physical reality and potentially establish the groundwork for a novel interpretation of quantum mechanics.

quant-ph↗
arXiv2026

Flexible Qubit Allocation of Network Resource States

The Quantum Internet is still in its infancy, yet identifying scalable and resilient quantum network resource states is an essential task for realizing it. We explore the use of graph states with flexible, non-trivial qubit-to-node assignments. This flexibility enables adaptable engineering of the entanglement topology of an arbitrary quantum network. In particular, we focus on cluster states with arbitrary allocation as network resource states and as a promising candidate for a \textit{network core}-level entangled resource, due to its intrinsic flexible connectivity properties and resilience to particle losses. We introduce a modeling framework for overlaying entanglement topologies on physical networks and demonstrate how optimized and even random qubit assignment creates shortcuts and improves robustness and memory savings, while reducing the worst-case hop distance between remote network nodes, when compared to conventional approaches.

quant-ph↗
arXiv2026

Convergence of the Cumulant Expansion and Polynomial-Time Algorithm for Weakly Interacting Fermions

We propose a randomized algorithm to compute the log-partition function of weakly interacting fermions with polynomial runtime in both the system size and precision. Although weakly interacting fermionic systems are considered tractable for many computational methods such as the diagrammatic quantum Monte Carlo, a mathematically rigorous proof of polynomial runtime has been lacking. In this work we first extend the proof techniques developed in previous works for proving the convergence of the cumulant expansion in periodic systems to the non-periodic case. A key equation used to analyze the sum of connected Feynman diagrams, which we call the tree-determinant expansion, reveals an underlying tree structure in the summation. This enables us to design a new randomized algorithm to compute the log-partition function through importance sampling augmented by belief propagation. This approach differs from the traditional method based on Markov chain Monte Carlo, whose efficiency is hard to guarantee, and enables us to obtain a algorithm with provable polynomial runtime.

quant-ph↗