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

Systems and Control Transactions

Enhanced Reinforcement Learning-driven Process Design via Quantum Machine Learning

Austin Braniff, Fengqi You, Yuhe Tian

Published Jun 30, 2025• 3 citations
Publisher

Abstract

In this work, we introduce a quantum-enhanced reinforcement learning (RL) framework for process design synthesis. RL-driven methods for generating process designs have gained momentum due to their ability to intelligently identify optimal configurations without requiring pre-defined superstructures or flowsheet configurations. This eliminates reliance on prior expert knowledge, offering a comprehensive and robust design strategy. However, navigating the vast combinatorial design space poses computational challenges. To address this, a novel approach integrating RL with quantum machine learning (QML) is proposed. QML leverages theoretical advantages over classical methods to accelerate searches in large spaces. Built upon our prior work, the approach begins with a maximum set of available unit operations, represented in a flowsheet structure using an input-output stream matrix as RL observations. A Deep Q-Network (DQN) algorithm trains a parameterized quantum circuit (PQC) in place of a classical neural network (NN). The design structures generated by the RL agent are optimized using the IDAES Process Systems Engineering Framework, with the optimization objectives used as rewards to RL (e.g., cost, productivity). This quantum-enhanced algorithm is performed on a hydrodealkylation process case study, showcasing its efficiency and improved performance in navigating complex design spaces.

DOI
10.69997/sct.149501

Related papers

Process Flowsheet Synthesis via Quantum Reinforcement Learning with Improved Scalability

Austin Braniff, Fengqi You, Yuhe Tian

In this work, we present quantum reinforcement learning algorithms for process flowsheet synthesis. Particularly, we discuss the implementation of encoding strategies to improve the algorithmic scalability. Reinforcement learning (RL)-driven flowsheet synthesis techniques provide a promising approach for conceptual process design, in addition to traditional optimization-based methods. These RL-based strategies identify the optimal flowsheet configurations from a maximum set of available processing units, without requiring to pre-postulate an interconnected superstructure. However, the resulting combinatorial design space for RL can scale extensively with the increased number of available processing units, which can render the algorithms to be computationally intensive or even intractable. To address this challenge, our prior work has introduced a quantum-enhanced approach to RL-driven process synthesis. However, this algorithm was limited in its capacity to solve larger flowsheeting problems as a large number of qubits were needed. To reduce qubit requirements and improve scalability, this work presents two different encoding strategies to embed information into the gates of quantum circuits instead of embedding it into qubits alone. We demonstrate the efficacy of these algorithms on three different scenarios of a flowsheet synthesis problem and interpret the results obtained from the IonQ quantum computing platform.

Systems and Control Transactions•Jun 19, 2026•2 citations

Enhanced Reinforcement Learning-based Process Synthesis via Quantum Computing

Austin Braniff, Fengqi You, Yuhe Tian

In this work, we present quantum reinforcement learning (RL) as a solution strategy for process synthesis problems. Building on our prior work, we develop a generalized framework that formally poses process synthesis as a Markov decision process and introduces quantum-enhanced RL algorithms to solve it with improved scalability. Earlier implementations of quantum-based RL for process synthesis were limited by qubit requirements, which scaled poorly with problem complexity. This work overcomes this challenge by introducing state encoding algorithms to decouple qubit requirements from problem size. A classical RL-based solution strategy is used as a baseline to benchmark the quantum algorithms under identical training conditions. All algorithms are evaluated across a flowsheet synthesis problem of increasing unit counts to analyze their performance and scalability. Results show that all approaches are capable of identifying the optimal flowsheet designs in small design spaces. For moderate-scale unit counts, quantum approaches demonstrate competitive performance on a per-episode basis and improved efficiency on a per-parameter basis versus the classical RL benchmark. This work provides a foundation for future quantum computing applications within process systems engineering, establishes a controlled benchmark for comparing classical and quantum algorithms, and shows that the proposed quantum variants remain competitive for the process synthesis problem examined in this work.

quant-pharXiv:2605.21213•Chinese Journal of Chemical Engineering•May 21, 2026•0 citations

Autonomous Quantum System Design Using Reinforcement Learning and Evolutionary Strategies

Thirunavukarasu, Elanchezhian, Mohamed Ashraf +1 more

The design of autonomous quantum systems constitutes an entirely new paradigm for next-generation computing by having machine intelligence do the engineering work to build and optimise successful quantum architectures. We address the problem of self-optimizing quantum systems that perform adaptive control, circuit synthesis and decision making in both accurate and uncertain controllable environments via a two-pronged approach: Reinforcement Learning (RL) together with Evolutionary Strategies (ES). In this work, we find that reinforcement learning provides a general framework for sequential decision-making, where agents learn optimal policies from reward signals by interacting with quantum environments. Evolutionary strategies, which are based on ideas from biological evolution, provide an alternative to RL by performing global optimization of quantum circuit parameters and architectures using the standard canonical processes of mutation, selection and recombination. Recent developments in quantum technologies show, again, that machine learning tools (ML), especially RL can be very useful to optimize unavailable closed blow-ups related with quantity functions. Moreover, evolutionary optimization based hybrids with RL have demonstrated better performance on the complex multi-objective quantum problems due to balanced exploitation and exploration. In this paper, we provide an overview of a versatile framework for autonomous quantum system design that showcases example algorithmic architectures, hybrid machine learning models and real world applications in areas such as quantum control, quantum circuit synthesis and energy optimization. In addition, we discuss well-known obstacles such as the scalability problem, the noise sensitivity issue, barren plateaus of quantum optimization and computational complexity. Comparisons to traditional methods show that reinforcement learning (RL) when combined with evolutionary strategies enables a significant improvement in efficiency, adaptability, and robustness for quantum system design as supported by experimental studies and case analyses. Future research directions are then discussed, including quantum-native learning algorithms, multi-agent quantum reinforcement learning and hardware-aware optimization techniques

International Journal of Quantum Computing and Artificial Intelligence (IJQCAI)•Mar 29, 2026•0 citations

Quantum Machine Learning: A Reinforcement Learning Framework

Jincheng Zhang

Quantum Machine Learning (QML) represents a paradigm shift in machine learning, leveraging quantum mechanical principles to accelerate computation and potentially unlock new algorithms. This paper investigates a novel reinforcement learning (RL) framework, termed "Adaptive Neural Network Reinforcement Learning" (ANNR), which employs dynamic parameter adjustment within a self-adaptive neural network to enhance learning efficiency and generalization capabilities. We demonstrate that this approach overcomes limitations of traditional RL methods, offering a promising path towards more robust and adaptable reinforcement learning agents. The core mechanism focuses on iteratively refining neural network weights through a feedback loop, enabling the system to explore complex environments effectively. The research explores the impact of parameter adjustment on both training speed and final performance across various RL tasks.

•Aug 31, 2026•0 citations

Learning to Build Quantum Kernels: A Reinforcement Learning Framework for Quantum SVC Optimization

Luigi , Giuseppe Buonaiuto, Lidia Marassi +4 more

Abstract This work introduces a novel hybrid quantum-classical machine learning framework in which a Reinforcement Learning (RL) agent autonomously constructs quantum circuits to optimize kernels for a Quantum Support Vector Classifier (QSVC). Unlike traditional approaches that rely on fixed or manually designed quantum feature maps, the proposed method employs a Deep Q-Network (DQN) agent to dynamically select quantum gates and their parameters. These configurations define a parameterized quantum circuit whose fidelity-based kernel is used to perform classification tasks. The RL agent is trained to maximize classification accuracy by interacting with an environment that evaluates circuit performance. Experiments conducted on a realistic and potentially biased educational dataset demonstrate that the RL-optimized QSVC outperforms both classical SVC and standard QSVC baselines in terms of accuracy and fairness. Furthermore, SHAP-based explainability analysis reveals a reduction in model bias, suggesting improved interpretability and robustness. This study highlights the potential of reinforcement learning for automated quantum circuit design and kernel optimization in quantum machine learning.

•Mar 4, 2026•0 citations

Quantum Circuit Structure Optimization for Quantum Reinforcement Learning

Seok Bin Son, Joongheon Kim

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 QRLNAS 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.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations
In this work, we introduce a quantum-enhanced reinforcement learning (RL) framework for process design synthesis. RL-driven methods for generating process designs have gained momentum due to their ability to intelligently identify optimal configurations without requiring pre-defined superstructures or flowsheet configurations. This eliminates reliance on prior expert knowledge, offering a comprehensive and robust design strategy. However, navigating the vast combinatorial design space poses computational challenges. To address this, a novel approach integrating RL with quantum machine learning (QML) is proposed. QML leverages theoretical advantages over classical methods to accelerate searches in large spaces. Built upon our prior work, the approach begins with a maximum set of available unit operations, represented in a flowsheet structure using an input-output stream matrix as RL observations. A Deep Q-Network (DQN) algorithm trains a parameterized quantum circuit (PQC) in place of a classical neural network (NN). The design structures generated by the RL agent are optimized using the IDAES Process Systems Engineering Framework, with the optimization objectives used as rewards to RL (e.g., cost, productivity). This quantum-enhanced algorithm is performed on a hydrodealkylation process case study, showcasing its efficiency and improved performance in navigating complex design spaces.
In this work, we present quantum reinforcement learning algorithms for process flowsheet synthesis. Particularly, we discuss the implementation of encoding strategies to improve the algorithmic scalability. Reinforcement learning (RL)-driven flowsheet synthesis techniques provide a promising approach for conceptual process design, in addition to traditional optimization-based methods. These RL-based strategies identify the optimal flowsheet configurations from a maximum set of available processing units, without requiring to pre-postulate an interconnected superstructure. However, the resulting combinatorial design space for RL can scale extensively with the increased number of available processing units, which can render the algorithms to be computationally intensive or even intractable. To address this challenge, our prior work has introduced a quantum-enhanced approach to RL-driven process synthesis. However, this algorithm was limited in its capacity to solve larger flowsheeting problems as a large number of qubits were needed. To reduce qubit requirements and improve scalability, this work presents two different encoding strategies to embed information into the gates of quantum circuits instead of embedding it into qubits alone. We demonstrate the efficacy of these algorithms on three different scenarios of a flowsheet synthesis problem and interpret the results obtained from the IonQ quantum computing platform.
In this work, we present quantum reinforcement learning (RL) as a solution strategy for process synthesis problems. Building on our prior work, we develop a generalized framework that formally poses process synthesis as a Markov decision process and introduces quantum-enhanced RL algorithms to solve it with improved scalability. Earlier implementations of quantum-based RL for process synthesis were limited by qubit requirements, which scaled poorly with problem complexity. This work overcomes this challenge by introducing state encoding algorithms to decouple qubit requirements from problem size. A classical RL-based solution strategy is used as a baseline to benchmark the quantum algorithms under identical training conditions. All algorithms are evaluated across a flowsheet synthesis problem of increasing unit counts to analyze their performance and scalability. Results show that all approaches are capable of identifying the optimal flowsheet designs in small design spaces. For moderate-scale unit counts, quantum approaches demonstrate competitive performance on a per-episode basis and improved efficiency on a per-parameter basis versus the classical RL benchmark. This work provides a foundation for future quantum computing applications within process systems engineering, establishes a controlled benchmark for comparing classical and quantum algorithms, and shows that the proposed quantum variants remain competitive for the process synthesis problem examined in this work.
The design of autonomous quantum systems constitutes an entirely new paradigm for next-generation computing by having machine intelligence do the engineering work to build and optimise successful quantum architectures. We address the problem of self-optimizing quantum systems that perform adaptive control, circuit synthesis and decision making in both accurate and uncertain controllable environments via a two-pronged approach: Reinforcement Learning (RL) together with Evolutionary Strategies (ES). In this work, we find that reinforcement learning provides a general framework for sequential decision-making, where agents learn optimal policies from reward signals by interacting with quantum environments. Evolutionary strategies, which are based on ideas from biological evolution, provide an alternative to RL by performing global optimization of quantum circuit parameters and architectures using the standard canonical processes of mutation, selection and recombination. Recent developments in quantum technologies show, again, that machine learning tools (ML), especially RL can be very useful to optimize unavailable closed blow-ups related with quantity functions. Moreover, evolutionary optimization based hybrids with RL have demonstrated better performance on the complex multi-objective quantum problems due to balanced exploitation and exploration. In this paper, we provide an overview of a versatile framework for autonomous quantum system design that showcases example algorithmic architectures, hybrid machine learning models and real world applications in areas such as quantum control, quantum circuit synthesis and energy optimization. In addition, we discuss well-known obstacles such as the scalability problem, the noise sensitivity issue, barren plateaus of quantum optimization and computational complexity. Comparisons to traditional methods show that reinforcement learning (RL) when combined with evolutionary strategies enables a significant improvement in efficiency, adaptability, and robustness for quantum system design as supported by experimental studies and case analyses. Future research directions are then discussed, including quantum-native learning algorithms, multi-agent quantum reinforcement learning and hardware-aware optimization techniques
Quantum Machine Learning (QML) represents a paradigm shift in machine learning, leveraging quantum mechanical principles to accelerate computation and potentially unlock new algorithms. This paper investigates a novel reinforcement learning (RL) framework, termed "Adaptive Neural Network Reinforcement Learning" (ANNR), which employs dynamic parameter adjustment within a self-adaptive neural network to enhance learning efficiency and generalization capabilities. We demonstrate that this approach overcomes limitations of traditional RL methods, offering a promising path towards more robust and adaptable reinforcement learning agents. The core mechanism focuses on iteratively refining neural network weights through a feedback loop, enabling the system to explore complex environments effectively. The research explores the impact of parameter adjustment on both training speed and final performance across various RL tasks.
Abstract This work introduces a novel hybrid quantum-classical machine learning framework in which a Reinforcement Learning (RL) agent autonomously constructs quantum circuits to optimize kernels for a Quantum Support Vector Classifier (QSVC). Unlike traditional approaches that rely on fixed or manually designed quantum feature maps, the proposed method employs a Deep Q-Network (DQN) agent to dynamically select quantum gates and their parameters. These configurations define a parameterized quantum circuit whose fidelity-based kernel is used to perform classification tasks. The RL agent is trained to maximize classification accuracy by interacting with an environment that evaluates circuit performance. Experiments conducted on a realistic and potentially biased educational dataset demonstrate that the RL-optimized QSVC outperforms both classical SVC and standard QSVC baselines in terms of accuracy and fairness. Furthermore, SHAP-based explainability analysis reveals a reduction in model bias, suggesting improved interpretability and robustness. This study highlights the potential of reinforcement learning for automated quantum circuit design and kernel optimization in quantum machine learning.
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 QRLNAS 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.