Quantum Circuit Structure Optimization for Quantum Reinforcement Learning

Seok Bin Son, Joongheon Kim
7/1/2025
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Reinforcement learning (RL) enables agents to learn optimal policies through environmental interaction. However, RL suffers from reduced learning efficiency due to the curse of dimensionality in high-dimensional spaces. Quantum reinforcement learning (QRL) addresses this issue by leveraging superposition and entanglement in quantum computing, allowing efficient handling of high-dimensional problems with fewer resources. QRL combines quantum neural networks (QNNs) with RL, where the parameterized quantum circuit (PQC) acts as the core computational module. The PQC performs linear and nonlinear transformations through gate operations, similar to hidden layers in classical neural networks. Previous QRL studies, however, have used fixed PQC structures based on empirical intuition without verifying their optimality. This paper proposes a QRL-NAS algorithm that integrates quantum neural architecture search (QNAS) to optimize PQC structures within QRL. Experiments demonstrate that QRL-NAS achieves higher rewards than QRL with fixed circuits, validating its effectiveness and practical utility.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{son2025quantum,
  title  = {Quantum Circuit Structure Optimization for Quantum Reinforcement Learning},
  author = {Seok Bin Son and Joongheon Kim},
  year   = {2025},
  eprint = {2507.00589},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.00589v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.00589.svg)](https://codeofpaper.com/paper/2507.00589)

Discussion