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

IEEE/ACM International Workshop on Quantum Software Engineering (Q-SE)

Learning State Separation for Quantum Circuit Synthesis

Christoph Stein, Stefan Klikovits, Manuel Wimmer

Published Apr 12, 2026• 0 citations
Publisher
DOI
10.1145/3786150.3788615

Related papers

Physical synthesis of quantum circuits using Q-learning

Dengli Bu, Zhiyan Bin, Jing Sun

Quantum Information Processing•Jan 27, 2025•0 citations

Synthesis of quantum circuits based on supervised learning and correlations

Carolina Allende, André Fonseca de Olivera, Efrain Buksman

Quantum Information Processing•May 24, 2024•3 citations

Generalizing Reinforcement Learning-Based Quantum Circuit Synthesis across Multiple Topologies

Giovanni Acampora, Allegra Cuzzocrea, Marco Lapegna +2 more

The optimization of the limited resources of current quantum devices hinges on the implementation of quantum-compiling techniques. The process of transforming high-level quantum algorithms into executable quantum circuits has a significant impact on the performance and fidelity of computations. One of the most critical aspects of the compiling stack is the synthesis of quantum circuits, which aims to minimize the depth and number of gates, as well as the error rate. Nevertheless, the optimal synthesis algorithms are extremely computationally expensive. This is why synthesis algorithms based on reinforcement learning (RL) have recently been introduced. However, such algorithms are constrained by the topology of quantum processors, necessitating retraining of the RL agent for different topologies. To achieve a balance between adaptability, optimality, and computational cost in RL-based quantum circuit synthesis techniques, this work proposes an RL-based quantum circuit synthesis algorithm of Clifford operators that addresses different topologies simultaneously. Experimental tests demonstrate that our synthesizer outperforms state-of-the-art greedy techniques while being significantly faster than boolean satisfiability solvers (SAT).

•Mar 17, 2025•3 citations

TATVA: A Reinforcement Learning Framework for Quantum Circuit Synthesis

Om Bhamare, Aryan Jadhav, Manas Shinde +1 more

One of the most important initial steps in quantum computing is high-fidelity quantum state preparation, because errors in it can affect the final computational result. Therefore, one of the major challenges is to design a quantum circuit that can achieve the desired target state accurately with a smaller number of gates. Traditionally, circuits are designed using predefined rules and mathematical decompositions, but this makes it difficult to design circuits for different and complex target states. This paper presents TATVA, a reinforcement learning (RL) system for synthesizing quantum circuits. TATVA views circuit synthesis as a sequential decision problem in which the agents select one gate at a time and calculate the fidelity after each applied gate, with the gate producing the highest fidelity selected for the circuit. The system introduces a parallel architecture that uses two RL agents, Deep Q-Network (DQN) and Proximal Policy Optimization (PPO), along with Qiskit's statevector simulator. The system can synthesize up to 5 qubits while achieving a fidelity of 0.999999 and producing compact circuits. After achieving the desired fidelity, it performs a post-hoc optimization step that reduces the circuit depth while preserving the achieved fidelity. The circuit is finalized using fidelity, success rate, gate count, and circuit depth. Target states that are not used during training are used to test whether the system has learned effectively and can generalize beyond the training states. This approach aims to enable automatic quantum circuit synthesis with high fidelity using reinforcement learning.

quant-pharXiv:2610.00945•Oct 2, 2026•0 citations

Study on Machine Learning Application in Quantum Circuit Synthesis

Jyoti, Amitabh Wahi, S.B.L Tripathi

In this Research Paper we have highlighted about the Study on Machine Learning Application in Quantum Circuit Synthesis. Quantum circuit synthesis, a fundamental task in quantum computing, involves designing efficient circuits to execute quantum algorithms on quantum computers. Machine learning techniques have been increasingly applied to enhance this process. One key area where machine learning excels is in optimizing quantum circuits for specific tasks. Quantum circuit synthesis often involves a large search space of possible circuit configurations, making it computationally intensive to find optimal solutions. Machine learning algorithms, such as reinforcement learning or genetic algorithms, can efficiently navigate this search space to identify high-performing circuit configurations. These algorithms learn from past experiences and iteratively improve their performance, gradually converging towards optimal solutions. Machine learning can aid in automating the design process by predicting the performance of quantum circuits based on their characteristics. By analyzing large datasets of quantum circuits and their corresponding performance metrics, machine learning models can identify patterns and correlations, enabling the prediction of circuit performance without the need for exhaustive simulations. Additionally, machine learning techniques can assist in error mitigation in quantum circuits. Quantum computers are susceptible to various types of errors, which can degrade the performance of quantum algorithms. Machine learning algorithms can analyze error patterns and devise strategies to mitigate them, leading to more reliable quantum circuits.

RESEARCH REVIEW International Journal of Multidisciplinary•Apr 20, 2025•0 citations

Learning Based Hardware-Centric Quantum Circuit Generation

Merel A. Schalkers, Matthias Möller

Communications in computer and information science•Jan 1, 2022•1 citation
The optimization of the limited resources of current quantum devices hinges on the implementation of quantum-compiling techniques. The process of transforming high-level quantum algorithms into executable quantum circuits has a significant impact on the performance and fidelity of computations. One of the most critical aspects of the compiling stack is the synthesis of quantum circuits, which aims to minimize the depth and number of gates, as well as the error rate. Nevertheless, the optimal synthesis algorithms are extremely computationally expensive. This is why synthesis algorithms based on reinforcement learning (RL) have recently been introduced. However, such algorithms are constrained by the topology of quantum processors, necessitating retraining of the RL agent for different topologies. To achieve a balance between adaptability, optimality, and computational cost in RL-based quantum circuit synthesis techniques, this work proposes an RL-based quantum circuit synthesis algorithm of Clifford operators that addresses different topologies simultaneously. Experimental tests demonstrate that our synthesizer outperforms state-of-the-art greedy techniques while being significantly faster than boolean satisfiability solvers (SAT).
One of the most important initial steps in quantum computing is high-fidelity quantum state preparation, because errors in it can affect the final computational result. Therefore, one of the major challenges is to design a quantum circuit that can achieve the desired target state accurately with a smaller number of gates. Traditionally, circuits are designed using predefined rules and mathematical decompositions, but this makes it difficult to design circuits for different and complex target states. This paper presents TATVA, a reinforcement learning (RL) system for synthesizing quantum circuits. TATVA views circuit synthesis as a sequential decision problem in which the agents select one gate at a time and calculate the fidelity after each applied gate, with the gate producing the highest fidelity selected for the circuit. The system introduces a parallel architecture that uses two RL agents, Deep Q-Network (DQN) and Proximal Policy Optimization (PPO), along with Qiskit's statevector simulator. The system can synthesize up to 5 qubits while achieving a fidelity of 0.999999 and producing compact circuits. After achieving the desired fidelity, it performs a post-hoc optimization step that reduces the circuit depth while preserving the achieved fidelity. The circuit is finalized using fidelity, success rate, gate count, and circuit depth. Target states that are not used during training are used to test whether the system has learned effectively and can generalize beyond the training states. This approach aims to enable automatic quantum circuit synthesis with high fidelity using reinforcement learning.
In this Research Paper we have highlighted about the Study on Machine Learning Application in Quantum Circuit Synthesis. Quantum circuit synthesis, a fundamental task in quantum computing, involves designing efficient circuits to execute quantum algorithms on quantum computers. Machine learning techniques have been increasingly applied to enhance this process. One key area where machine learning excels is in optimizing quantum circuits for specific tasks. Quantum circuit synthesis often involves a large search space of possible circuit configurations, making it computationally intensive to find optimal solutions. Machine learning algorithms, such as reinforcement learning or genetic algorithms, can efficiently navigate this search space to identify high-performing circuit configurations. These algorithms learn from past experiences and iteratively improve their performance, gradually converging towards optimal solutions. Machine learning can aid in automating the design process by predicting the performance of quantum circuits based on their characteristics. By analyzing large datasets of quantum circuits and their corresponding performance metrics, machine learning models can identify patterns and correlations, enabling the prediction of circuit performance without the need for exhaustive simulations. Additionally, machine learning techniques can assist in error mitigation in quantum circuits. Quantum computers are susceptible to various types of errors, which can degrade the performance of quantum algorithms. Machine learning algorithms can analyze error patterns and devise strategies to mitigate them, leading to more reliable quantum circuits.