Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2508.21253 · Discover Applied Sciences

Reinforcement learning for optimizing large qubit array based quantum sensor circuits

Laxmisha Ashok Attisara, Kumar Sathish A.P.

Published Jan 5, 2026• 0 citations
arXivHTMLPDF

Abstract

As the number of qubits in a sensor increases, the complexity of designing and controlling the quantum circuits grows exponentially. Manually optimizing these circuits becomes infeasible. Optimizing entanglement distribution in large-scale quantum circuits is critical for enhancing the sensitivity and efficiency of quantum sensors (Yi, in Quantum Sci Technol, 045001, 2022, Thomas et al, in 2021). This paper presents an engineering integration of reinforcement learning with tensor-network-based simulation (MPS) for scalable circuit optimization for optimizing quantum sensor circuits with up to 60 qubits. To enable efficient simulation and scalability, we adopt tensor network methods—specifically, the Matrix Product State (MPS) representation—instead of traditional state vector or density matrix approaches. Our reinforcement learning agent learns to restructure circuits to maximize Quantum Fisher Information (QFI) and entanglement entropy while reducing gate counts and circuit depth. Experimental results show consistent improvements, with QFI values approaching 1, entanglement entropy in the 0.8–1.0 range, and up to 90% reduction in depth and gate count. These results highlight the potential of combining quantum machine learning and tensor networks to optimize complex quantum circuits under realistic constraints.

DOI
10.1007/s42452-025-08139-y

Related papers

Quantum Machine Learning for Optimizing Entanglement Distribution in Quantum Sensor Circuits

Laxmisha Ashok Attisara, Sathish Kumar

In the rapidly evolving field of quantum computing, optimizing quantum circuits for specific tasks is crucial for enhancing performance and efficiency. More recently, quantum sensing has become a distinct and rapidly growing branch of research within the area of quantum science and technology. The field is expected to provide new opportunities, especially regarding high sensitivity and precision. Entanglement is one of the key factors in achieving high sensitivity and measurement precision [3]. This paper presents a novel approach utilizing quantum machine learning techniques to optimize entanglement distribution in quantum sensor circuits. By leveraging reinforcement learning within a quantum environment, we aim to optimize the entanglement layout to maximize Quantum Fisher Information (QFI) and entanglement entropy, which are key indicators of a quantum system's sensitivity and coherence, while minimizing circuit depth and gate counts. Our implementation, based on Qiskit, integrates noise models and error mitigation strategies to simulate realistic quantum environments. The results demonstrate significant improvements in circuit performance and sensitivity, highlighting the potential of machine learning in quantum circuit optimization by measuring high QFI and entropy in the range of 0.84-1.0 with depth and gate count reduction by 20-86%.

arXiv:2508.21252•Aug 28, 2025•2 citations

Reinforcement Learning Based Actor Critic and Policy Agent for Optimized Quantum Sensor Circuit Design

Temitope Bolaji Adeniyi, Sathish Kumar

This paper explores the application of reinforcement learning (RL) algorithms to the domain of quantum sensor circuit design. We focus on the design of four qubits quantum circuits that can efficiently generate states with optimal sensitivity, which maximizes the Quantum Fisher Information (QFI). We formulate the design task as a Markov Decision Process, implementing and comparing two distinct RL strategies: pure policy gradient and actor-critic agents to optimize a Ramsey sequence for maximum QFI. The results demonstrate that both agents are able to find quantum circuit designs with an optimal QFI value of 1. However, the agents differ in the gate sequence of the final Quantum sensor circuit configurations that indicate the optimal state. The policy gradient outperforms the actor-critic method in convergence time and the number of gate sequences for the encoding circuit.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•3 citations

A Reinforcement Learning Environment for Directed Quantum Circuit Synthesis

Michael Kölle, Tom Schubert, Philipp J. Altmann +3 more

With recent advancements in quantum computing technology, optimizing quantum circuits and ensuring reliable quantum state preparation have become increasingly vital. Traditional methods often demand extensive expertise and manual calculations, posing challenges as quantum circuits grow in qubit- and gate-count. Therefore, harnessing machine learning techniques to handle the growing variety of gate-to-qubit combinations is a promising approach. In this work, we introduce a comprehensive reinforcement learning environment for quantum circuit synthesis, where circuits are constructed utilizing gates from the the Clifford+T gate set to prepare specific target states. Our experiments focus on exploring the relationship between the depth of synthesized quantum circuits and the circuit depths used for target initialization, as well as qubit count. We organize the environment configurations into multiple evaluation levels and include a range of well-known quantum states for benchmarking purposes. We also lay baselines for evaluating the environment using Proximal Policy Optimization. By applying the trained agents to benchmark tests, we demonstrated their ability to reliably design minimal quantum circuits for a selection of 2-qubit Bell states.

arXiv:2401.07054•International Conference on Agents and Artificial Intelligence (ICAART)•Jan 1, 2024•24 citations

Rethinking Quantum Circuit Optimization as a Reinforcement Learning Problem

Arjun Mehta, Sven Richter

Quantum circuit optimization is a foundational challenge in realizing practical quantum computation, requiring the reduction of gate counts and circuit depth while preserving logical equivalence across noisy intermediate-scale quantum (NISQ) devices. Conventional rule-based and heuristic compilation approaches demonstrate diminishing effectiveness as circuit complexity grows, motivating the search for adaptive, data-driven alternatives. This paper reformulates quantum circuit optimization as a Markov decision process (MDP), enabling deep reinforcement learning (RL) agents to autonomously discover efficient transformation strategies. A graph neural network (GNN)-based actor-critic architecture is developed to encode circuit topology and guide transformation selection. Drawing on empirical evidence from phase-structured quantum control tasks, neural feedback architectures, and convergence behavior in active learning agents, we demonstrate that the proposed framework achieves an average two-qubit gate count reduction of 31.4% and a circuit depth reduction of 27.8% across standard benchmark circuits, outperforming established compilation baselines. This work provides a principled theoretical foundation for the RL-as-optimizer paradigm and contributes an extensible experimental platform suited to NISQ-era constraints.

American Journal Of Big Data•Apr 1, 2026•0 citations

TensorRL-QAS: Reinforcement learning with tensor networks for improved quantum architecture search

Akash Kundu, Stefano Mangini

Variational quantum algorithms hold the promise to address meaningful quantum problems already on noisy intermediate-scale quantum hardware.In spite of the promise, they face the challenge of designing quantum circuits that both solve the target problem and comply with device limitations.Quantum architecture search (QAS) automates the design process of quantum circuits, with reinforcement learning (RL) emerging as a promising approach.Yet, RL-based QAS methods encounter significant scalability issues, as computational and training costs grow rapidly with the number of qubits, circuit depth, and hardware noise.To address these challenges, we introduce TensorRL-QAS, an improved framework that combines tensor network methods with RL for QAS.By warm-starting the QAS with a matrix product state approximation of the target solution, TensorRL-QAS effectively narrows the search space to physically meaningful circuits and accelerates the convergence to the desired solution.Tested on several quantum chemistry problems of up to 12-qubit, TensorRL-QAS achieves up to a 10-fold reduction in CNOT count and circuit depth compared to baseline methods, while maintaining or surpassing chemical accuracy.It reduces classical optimizer function evaluation by up to 100-fold, accelerates training episodes by up to 98%, and can achieve 50% success probability for 10-qubit systems, far exceeding the <1% rates of baseline.Robustness and versatility are demonstrated both in the noiseless and noisy scenarios, where we report a simulation of an 8-qubit system.Furthermore, TensorRL-QAS demonstrates effectiveness on systems on 20-qubit quantum systems, positioning it as a state-of-the-art quantum circuit discovery framework for near-term hardware and beyond.

arXiv:2505.09371•neural information processing systems•Jan 1, 2025•8 citations

Adaptive Quantum Circuit Compilation via Tensor Networks

Jincheng Zhang

Quantum circuit compilation is a critical step in realizing quantum computation, aiming to translate high-level quantum algorithms into a sequence of gates executable on a specific quantum hardware. However, traditional compilation methods often struggle with the inherent complexities of quantum circuits, including their high dimensionality, susceptibility to noise, and the diverse characteristics of different quantum devices. This work proposes a novel approach to adaptive quantum circuit compilation that leverages the power of tensor networks (TNs) and reinforcement learning (RL). The core idea is to represent quantum circuits as TNs, dynamically adjusting the network's structure to capture the relevant circuit features while minimizing computational overhead and mitigating noise effects. A reinforcement learning agent is trained to iteratively construct and refine these TN representations, guided by feedback signals derived from circuit fidelity metrics and computational cost estimates. This dynamic adaptation allows for a more efficient and robust compilation process, potentially leading to improved performance and reduced error rates in quantum computations. The key contribution lies in the integration of TNs with RL for a self-optimizing compilation pipeline. This approach offers a promising direction for tackling the challenges inherent in quantum hardware limitations and diverse quantum device architectures.

•Sep 5, 2026•0 citations
As the number of qubits in a sensor increases, the complexity of designing and controlling the quantum circuits grows exponentially. Manually optimizing these circuits becomes infeasible. Optimizing entanglement distribution in large-scale quantum circuits is critical for enhancing the sensitivity and efficiency of quantum sensors (Yi, in Quantum Sci Technol, 045001, 2022, Thomas et al, in 2021). This paper presents an engineering integration of reinforcement learning with tensor-network-based simulation (MPS) for scalable circuit optimization for optimizing quantum sensor circuits with up to 60 qubits. To enable efficient simulation and scalability, we adopt tensor network methods—specifically, the Matrix Product State (MPS) representation—instead of traditional state vector or density matrix approaches. Our reinforcement learning agent learns to restructure circuits to maximize Quantum Fisher Information (QFI) and entanglement entropy while reducing gate counts and circuit depth. Experimental results show consistent improvements, with QFI values approaching 1, entanglement entropy in the 0.8–1.0 range, and up to 90% reduction in depth and gate count. These results highlight the potential of combining quantum machine learning and tensor networks to optimize complex quantum circuits under realistic constraints.
In the rapidly evolving field of quantum computing, optimizing quantum circuits for specific tasks is crucial for enhancing performance and efficiency. More recently, quantum sensing has become a distinct and rapidly growing branch of research within the area of quantum science and technology. The field is expected to provide new opportunities, especially regarding high sensitivity and precision. Entanglement is one of the key factors in achieving high sensitivity and measurement precision [3]. This paper presents a novel approach utilizing quantum machine learning techniques to optimize entanglement distribution in quantum sensor circuits. By leveraging reinforcement learning within a quantum environment, we aim to optimize the entanglement layout to maximize Quantum Fisher Information (QFI) and entanglement entropy, which are key indicators of a quantum system's sensitivity and coherence, while minimizing circuit depth and gate counts. Our implementation, based on Qiskit, integrates noise models and error mitigation strategies to simulate realistic quantum environments. The results demonstrate significant improvements in circuit performance and sensitivity, highlighting the potential of machine learning in quantum circuit optimization by measuring high QFI and entropy in the range of 0.84-1.0 with depth and gate count reduction by 20-86%.
This paper explores the application of reinforcement learning (RL) algorithms to the domain of quantum sensor circuit design. We focus on the design of four qubits quantum circuits that can efficiently generate states with optimal sensitivity, which maximizes the Quantum Fisher Information (QFI). We formulate the design task as a Markov Decision Process, implementing and comparing two distinct RL strategies: pure policy gradient and actor-critic agents to optimize a Ramsey sequence for maximum QFI. The results demonstrate that both agents are able to find quantum circuit designs with an optimal QFI value of 1. However, the agents differ in the gate sequence of the final Quantum sensor circuit configurations that indicate the optimal state. The policy gradient outperforms the actor-critic method in convergence time and the number of gate sequences for the encoding circuit.
With recent advancements in quantum computing technology, optimizing quantum circuits and ensuring reliable quantum state preparation have become increasingly vital. Traditional methods often demand extensive expertise and manual calculations, posing challenges as quantum circuits grow in qubit- and gate-count. Therefore, harnessing machine learning techniques to handle the growing variety of gate-to-qubit combinations is a promising approach. In this work, we introduce a comprehensive reinforcement learning environment for quantum circuit synthesis, where circuits are constructed utilizing gates from the the Clifford+T gate set to prepare specific target states. Our experiments focus on exploring the relationship between the depth of synthesized quantum circuits and the circuit depths used for target initialization, as well as qubit count. We organize the environment configurations into multiple evaluation levels and include a range of well-known quantum states for benchmarking purposes. We also lay baselines for evaluating the environment using Proximal Policy Optimization. By applying the trained agents to benchmark tests, we demonstrated their ability to reliably design minimal quantum circuits for a selection of 2-qubit Bell states.
Quantum circuit optimization is a foundational challenge in realizing practical quantum computation, requiring the reduction of gate counts and circuit depth while preserving logical equivalence across noisy intermediate-scale quantum (NISQ) devices. Conventional rule-based and heuristic compilation approaches demonstrate diminishing effectiveness as circuit complexity grows, motivating the search for adaptive, data-driven alternatives. This paper reformulates quantum circuit optimization as a Markov decision process (MDP), enabling deep reinforcement learning (RL) agents to autonomously discover efficient transformation strategies. A graph neural network (GNN)-based actor-critic architecture is developed to encode circuit topology and guide transformation selection. Drawing on empirical evidence from phase-structured quantum control tasks, neural feedback architectures, and convergence behavior in active learning agents, we demonstrate that the proposed framework achieves an average two-qubit gate count reduction of 31.4% and a circuit depth reduction of 27.8% across standard benchmark circuits, outperforming established compilation baselines. This work provides a principled theoretical foundation for the RL-as-optimizer paradigm and contributes an extensible experimental platform suited to NISQ-era constraints.
Variational quantum algorithms hold the promise to address meaningful quantum problems already on noisy intermediate-scale quantum hardware.In spite of the promise, they face the challenge of designing quantum circuits that both solve the target problem and comply with device limitations.Quantum architecture search (QAS) automates the design process of quantum circuits, with reinforcement learning (RL) emerging as a promising approach.Yet, RL-based QAS methods encounter significant scalability issues, as computational and training costs grow rapidly with the number of qubits, circuit depth, and hardware noise.To address these challenges, we introduce TensorRL-QAS, an improved framework that combines tensor network methods with RL for QAS.By warm-starting the QAS with a matrix product state approximation of the target solution, TensorRL-QAS effectively narrows the search space to physically meaningful circuits and accelerates the convergence to the desired solution.Tested on several quantum chemistry problems of up to 12-qubit, TensorRL-QAS achieves up to a 10-fold reduction in CNOT count and circuit depth compared to baseline methods, while maintaining or surpassing chemical accuracy.It reduces classical optimizer function evaluation by up to 100-fold, accelerates training episodes by up to 98%, and can achieve 50% success probability for 10-qubit systems, far exceeding the <1% rates of baseline.Robustness and versatility are demonstrated both in the noiseless and noisy scenarios, where we report a simulation of an 8-qubit system.Furthermore, TensorRL-QAS demonstrates effectiveness on systems on 20-qubit quantum systems, positioning it as a state-of-the-art quantum circuit discovery framework for near-term hardware and beyond.
Quantum circuit compilation is a critical step in realizing quantum computation, aiming to translate high-level quantum algorithms into a sequence of gates executable on a specific quantum hardware. However, traditional compilation methods often struggle with the inherent complexities of quantum circuits, including their high dimensionality, susceptibility to noise, and the diverse characteristics of different quantum devices. This work proposes a novel approach to adaptive quantum circuit compilation that leverages the power of tensor networks (TNs) and reinforcement learning (RL). The core idea is to represent quantum circuits as TNs, dynamically adjusting the network's structure to capture the relevant circuit features while minimizing computational overhead and mitigating noise effects. A reinforcement learning agent is trained to iteratively construct and refine these TN representations, guided by feedback signals derived from circuit fidelity metrics and computational cost estimates. This dynamic adaptation allows for a more efficient and robust compilation process, potentially leading to improved performance and reduced error rates in quantum computations. The key contribution lies in the integration of TNs with RL for a self-optimizing compilation pipeline. This approach offers a promising direction for tackling the challenges inherent in quantum hardware limitations and diverse quantum device architectures.