English

Quantum Architecture Search for Solving Quantum Machine Learning Tasks

Quantum Physics 2025-09-16 v1 Artificial Intelligence Machine Learning

Abstract

Quantum computing leverages quantum mechanics to address computational problems in ways that differ fundamentally from classical approaches. While current quantum hardware remains error-prone and limited in scale, Variational Quantum Circuits offer a noise-resilient framework suitable for today's devices. The performance of these circuits strongly depends on the underlying architecture of their parameterized quantum components. Identifying efficient, hardware-compatible quantum circuit architectures -- known as Quantum Architecture Search (QAS) -- is therefore essential. Manual QAS is complex and error-prone, motivating efforts to automate it. Among various automated strategies, Reinforcement Learning (RL) remains underexplored, particularly in Quantum Machine Learning contexts. This work introduces RL-QAS, a framework that applies RL to discover effective circuit architectures for classification tasks. We evaluate RL-QAS using the Iris and binary MNIST datasets. The agent autonomously discovers low-complexity circuit designs that achieve high test accuracy. Our results show that RL is a viable approach for automated architecture search in quantum machine learning. However, applying RL-QAS to more complex tasks will require further refinement of the search strategy and performance evaluation mechanisms.

Keywords

Cite

@article{arxiv.2509.11198,
  title  = {Quantum Architecture Search for Solving Quantum Machine Learning Tasks},
  author = {Michael Kölle and Simon Salfer and Tobias Rohe and Philipp Altmann and Claudia Linnhoff-Popien},
  journal= {arXiv preprint arXiv:2509.11198},
  year   = {2025}
}
R2 v1 2026-07-01T05:35:21.972Z