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:2605.01367

From Characterization To Construction: Generative Quantum Circuit Synthesis from Gate Set Tomography Data

King Yiu Yu, Aritra Sarkar, Erbing Hua, Maximilian Rimbach-Russ, Ryoichi Ishihara, Sebastian Feld

quant-phcs.LGeess.SYSubmitted May 2, 2026• Announced May 5, 2026• 0 citations
arXivHTMLPDF

Abstract

High-fidelity circuit execution on noisy intermediate-scale quantum devices is bottlenecked by compilation pipelines that disregard complex, correlated noise. To address this, this methodology article proposes a quantum machine learning control (QMLC) framework for generative quantum circuit synthesis from gate-set tomography (GST) data that bypasses the traditional two-step pipeline of characterizing native quantum gates via GST followed by unitary decomposition algorithms. Instead, a generative concept space is directly learnt from GST data, enabling conditional synthesis of quantum circuits on a desired output distribution. Our approach tokenizes GST germ circuits and embeds them into a structured latent space using a curriculum-learning-motivated strategy, starting with short circuits and progressively incorporating longer ones with diverse output statistics. The embedded sequences are processed by a set-vision transformer with permutation-invariant pooling, producing k-seed vectors that represent the learned concept space of the quantum device. Aggregating data across multiple circuits makes this latent representation inherently context-aware, capturing the shared physical noise environment (e.g., crosstalk, drift) that isolated gate metrics miss. We propose an unconditional diffusion model to sample from the concept space. During inference, a user provides a target measurement distribution, and the model generates a corresponding circuit. To ensure fidelity and robustness, the output is denoised using a diffusion model that operates on the target conditional covariance matrix. This end-to-end framework is a step towards context-aware, hardware-native circuit synthesis directly from raw GST data, which offers a new paradigm for integrating quantum control and compilation. The QMLC framework is particularly suited for near-term quantum devices with complex calibration procedures.

Comments
19 pages, 3 figures

Related papers

Synthetic data generation on noisy quantum computers

Michael Krebsbach

Generative machine learning aims to model probability distributions from sample data. Quantum computers are widely believed to efficiently sample from certain probability distributions that are intractable for classical computers, making quantum circuits promising candidates for generative machine learning. This dissertation investigates quantum generative machine learning models, with a particular focus on Synthetic Data Generation (SDG) and on the Quantum Circuit Born Machine, an algorithm that can be implemented on current quantum hardware. The first part of this dissertation studies SDG algorithms in noiseless simulations. Most of these algorithms rely on an implicit design choice that has not previously been examined: the binary encoding that maps bitstring samples generated by a quantum circuit to real-valued data points. We show that the training performance depends on this choice and analyze the interplay between data structure, circuit ansatz, and encoding. For continuous target distributions, the reflected binary Gray code is particularly effective because it maps similar data points to similar bitstrings and thus preserves the structure of the data. This provides a useful inductive bias that leads, on average, to faster convergence and better synthetic data. We further investigate extensions of SDG algorithms. Contrary to previous findings, we show that quantum models can also learn conditional probability distributions with quality comparable to that of independently trained models. We develop two sample-efficient strategies that enable conditional models to perform classification without additional training. This yields a unified model with both generative and discriminative capabilities. The second part of this dissertation addresses the implementation of such models on real quantum hardware. While current devices can train small-scale models with reasonable resource, larger-scale implementations remain limited by noise. Understanding and modeling this noise is therefore essential for progress. First, we develop a physically motivated noise model for superconducting transmon systems based on Hamiltonian simulation. We show that frequency collisions between energy levels of neighboring transmons can induce crosstalk and may drive the system out of the computational subspace. This model provides a basis for understanding hardware-level error mechanisms and for developing taylored mitigation or correction strategies. Second, we investigate two-qubit error using Long-Sequence Quantum Process Tomography (LS-QPT), assuming well-characterized single-qubit gates. Compared with standard Quantum Process Tomography, LS-QPT reduces the measurement cost by amplifying noise through germ circuits. We show that germ circuits that ideally implement the identity operation amplify a larger subspace of noise processes than other types of germ circuits. We also show that the precision of LS-QPT is fundamentally limited by unlearnable degrees of freedom in the noise model that cannot be amplified. Despite this limitation, the LS-QPT method reduces the total circuit depth required for process tomography by an order of magnitude.

•Jan 1, 2026•0 citations

Lie Group Diffusion Models for Hardware-Aware Quantum Circuit Synthesis

Jyotirmai Singh

An important task in quantum computing is unitary circuit synthesis compatible with physical hardware constraints. This problem has a natural hybrid structure as local single-qubit gates are continuous variables on the Lie group $SU(2)$ while the entangling circuit structure is discrete and hardware-dependent. In this work, we use generative models to perform quantum circuit synthesis incorporating both the natural $SU(2)$ manifold geometry of quantum gates and hardware constraints that determine the overall circuit structure. Our model comprises two components: a circuit skeleton selector that chooses an entangling circuit and a diffusion model that generates quantum gates on the given circuit template by performing diffusion on the curved manifold $\mathrm{SU(2)} \simeq S^3$ itself. We demonstrate this approach with unitary compilation of physically motivated three-qubit Hamiltonian simulation targets such as the Transverse Field Ising Model and the Heisenberg-XXZ Model and show that Lie group diffusion outperforms comparable baselines. The synthesised circuits can also be customised subject to constraints, which we demonstrate by producing circuits with large and small gate rotation angles for the same target unitary evolution. We also investigate the fidelity-complexity frontier of the synthesised gates to demonstrate that the circuit selector learns to select circuits that balance fidelity with complexity rather than collapsing onto the most expansive entangling template. These results demonstrate that Lie group diffusion provides a natural generative framework for hardware-aware quantum circuit synthesis.

quant-pharXiv:2606.29636•Jun 30, 2026•1 citation

Synthesis of discrete–continuous quantum circuits with multimodal diffusion models

Florian Fürrutter, Zohim Chandani, Ikko Hamamura +2 more

Abstract Efficiently compiling quantum operations remains a major bottleneck in scaling quantum computing. Today’s state-of-the-art methods achieve low compilation error by combining search algorithms with gradient-based parameter optimization, but they incur long runtimes and require multiple calls to quantum hardware or expensive classical simulations, making their scaling prohibitive. Recently, machine-learning models have emerged as an alternative, though they are currently restricted to discrete gate sets. Here, we introduce a multimodal denoising diffusion model that simultaneously generates a circuit’s structure and its continuous parameters for compiling a target unitary. It leverages two independent diffusion processes, one for discrete gate selection and one for parameter prediction. We benchmark the model over different experiments, analyzing the method’s accuracy across varying qubit counts and circuit depths, showcasing the ability of the method to outperform existing approaches in gate counts and under noisy conditions. Additionally, we show that a simple post-optimization scheme allows us to significantly improve the generated ansätze. Finally, by exploiting its rapid circuit generation, we create large datasets of circuits for particular operations and use these to extract valuable heuristics that can help us discover new insights into quantum circuit synthesis. Code and models are publicly available at https://github.com/FlorianFuerrutter/genQC .

arXiv:2506.01666•Machine Learning Science and Technology•Apr 1, 2026•11 citations

Hybrid diffusion-optimization for quantum synthesis with continuous native gates

Dajun Guo, Chukun Hu, Xiaolu Su

Abstract Quantum circuit synthesis becomes increasingly challenging as system sizes grow and hardware-native gate sets diversify. Denoising diffusion models have recently been applied to quantum circuit synthesis as an alternative to expensive classical optimization. Existing diffusion-based approaches, however, either operate on discrete gate alphabets or separate gate identities and continuous parameters into different generative streams, which raises the question of whether a unified representation can more naturally encode structure–parameter dependencies. We propose a hybrid diffusion–optimization framework for quantum circuit synthesis with continuous native gates. Taking a trapped-ion-inspired native gate set as a representative example, our single-stream diffusion model operates directly on a continuous-parameter gate set { R X ( θ ), R Y ( θ ), R XX ( θ )} and produces fully parameterized circuits in a single diffusion sampling run. A lightweight gradient-based post-optimization of the continuous parameters, based on the process infidelity, then corrects residual stochastic errors. Trained and evaluated on random three-qubit unitaries, the model generates compact circuits that accurately approximate unseen targets. Under identical training conditions, the continuous-gate formulation achieves substantially lower process infidelity than both random-circuit and a discrete-gate diffusion baseline. Furthermore, applying gradient-based post-optimization to the continuous-gate diffusion output yields a significant additional improvement in fidelity compared with the same model without post-optimization, demonstrating that this refinement step is an effective strategy for correcting residual stochastic errors in the diffusion-generated parameters. These results point to a practical route toward continuous-parameter quantum circuit synthesis in native gate sets.

Physica Scripta•May 7, 2026•0 citations

Design Automation of Quantum Circuits for Engineering Systems: Gate Optimization and Noise-Aware Compilation in NISQ-Aware Hardware

Erim Engin

The rapid advancement of Noisy Intermediate-Scale Quantum (NISQ) devices has driven the need for efficient design automation tools that can translate complex engineering models into executable quantum circuits. This study explores the development of automated quantum circuit design frameworks focused on gate optimization and noise-aware compilation, enabling practical quantum computation for engineering applications such as optimization, simulation, and control systems. Traditional circuit design methods often fail to account for hardware constraints, decoherence, and gate infidelity, which significantly affect computational accuracy on NISQ devices. To address these challenges, this research introduces a hybrid automation approach combining quantum transpilation, variational circuit pruning, and error-aware synthesis algorithms to enhance circuit reliability and scalability. The framework integrates quantum-classical co-design principles to optimize both logical and physical circuit layers, leveraging hardware-specific calibration data to adapt compilation strategies dynamically. Through simulations and benchmark analysis, the proposed system demonstrates significant improvements in quantum resource utilization, error mitigation, and gate depth reduction compared to conventional compilation methods. This work underscores the growing importance of design automation in quantum engineering, where algorithmic efficiency must be harmonized with physical constraints to realize functional and scalable quantum workflows. By establishing a methodology for gate-level optimization and noise-adaptive design, the study contributes to bridging the gap between theoretical quantum algorithms and real-world engineering implementations within the NISQ computing era.

Next generation.•Nov 13, 2025•0 citations

Transformer models for quantum gate set tomography

King Yiu Yu, Aritra Sarkar, Maximilian Rimbach-Russ +2 more

Abstract Quantum computation represents a promising frontier in the domain of high-performance computing, blending quantum information theory with practical applications to overcome the limitations of classical computation. This study investigates the challenges of manufacturing high-fidelity and scalable quantum processors. Quantum gate set tomography (QGST) is a critical method for characterizing quantum processors and understanding their operational capabilities and limitations. This paper introduces Ml4Qgst as a novel approach to QGST by integrating machine learning techniques, specifically utilizing a transformer neural network model. Adapting the transformer model for QGST addresses the computational complexity of modeling quantum systems. Advanced training strategies, including data grouping and curriculum learning, are employed to enhance model performance, demonstrating significant congruence with ground-truth values. We benchmark this training pipeline on the constructed learning model, to successfully perform QGST for 2 and 3 gates on single-qubit and two-qubit systems, with over-rotation error and depolarizing noise estimation with comparable accuracy to pyGSTi. This research marks a pioneering step in applying deep neural networks to the complex problem of quantum gate set tomography, showcasing the potential of machine learning to tackle nonlinear tomography challenges in quantum computing.

arXiv:2405.02097•Quantum Machine Intelligence•Jan 21, 2025•5 citations
High-fidelity circuit execution on noisy intermediate-scale quantum devices is bottlenecked by compilation pipelines that disregard complex, correlated noise. To address this, this methodology article proposes a quantum machine learning control (QMLC) framework for generative quantum circuit synthesis from gate-set tomography (GST) data that bypasses the traditional two-step pipeline of characterizing native quantum gates via GST followed by unitary decomposition algorithms. Instead, a generative concept space is directly learnt from GST data, enabling conditional synthesis of quantum circuits on a desired output distribution. Our approach tokenizes GST germ circuits and embeds them into a structured latent space using a curriculum-learning-motivated strategy, starting with short circuits and progressively incorporating longer ones with diverse output statistics. The embedded sequences are processed by a set-vision transformer with permutation-invariant pooling, producing k-seed vectors that represent the learned concept space of the quantum device. Aggregating data across multiple circuits makes this latent representation inherently context-aware, capturing the shared physical noise environment (e.g., crosstalk, drift) that isolated gate metrics miss. We propose an unconditional diffusion model to sample from the concept space. During inference, a user provides a target measurement distribution, and the model generates a corresponding circuit. To ensure fidelity and robustness, the output is denoised using a diffusion model that operates on the target conditional covariance matrix. This end-to-end framework is a step towards context-aware, hardware-native circuit synthesis directly from raw GST data, which offers a new paradigm for integrating quantum control and compilation. The QMLC framework is particularly suited for near-term quantum devices with complex calibration procedures.
Generative machine learning aims to model probability distributions from sample data. Quantum computers are widely believed to efficiently sample from certain probability distributions that are intractable for classical computers, making quantum circuits promising candidates for generative machine learning. This dissertation investigates quantum generative machine learning models, with a particular focus on Synthetic Data Generation (SDG) and on the Quantum Circuit Born Machine, an algorithm that can be implemented on current quantum hardware. The first part of this dissertation studies SDG algorithms in noiseless simulations. Most of these algorithms rely on an implicit design choice that has not previously been examined: the binary encoding that maps bitstring samples generated by a quantum circuit to real-valued data points. We show that the training performance depends on this choice and analyze the interplay between data structure, circuit ansatz, and encoding. For continuous target distributions, the reflected binary Gray code is particularly effective because it maps similar data points to similar bitstrings and thus preserves the structure of the data. This provides a useful inductive bias that leads, on average, to faster convergence and better synthetic data. We further investigate extensions of SDG algorithms. Contrary to previous findings, we show that quantum models can also learn conditional probability distributions with quality comparable to that of independently trained models. We develop two sample-efficient strategies that enable conditional models to perform classification without additional training. This yields a unified model with both generative and discriminative capabilities. The second part of this dissertation addresses the implementation of such models on real quantum hardware. While current devices can train small-scale models with reasonable resource, larger-scale implementations remain limited by noise. Understanding and modeling this noise is therefore essential for progress. First, we develop a physically motivated noise model for superconducting transmon systems based on Hamiltonian simulation. We show that frequency collisions between energy levels of neighboring transmons can induce crosstalk and may drive the system out of the computational subspace. This model provides a basis for understanding hardware-level error mechanisms and for developing taylored mitigation or correction strategies. Second, we investigate two-qubit error using Long-Sequence Quantum Process Tomography (LS-QPT), assuming well-characterized single-qubit gates. Compared with standard Quantum Process Tomography, LS-QPT reduces the measurement cost by amplifying noise through germ circuits. We show that germ circuits that ideally implement the identity operation amplify a larger subspace of noise processes than other types of germ circuits. We also show that the precision of LS-QPT is fundamentally limited by unlearnable degrees of freedom in the noise model that cannot be amplified. Despite this limitation, the LS-QPT method reduces the total circuit depth required for process tomography by an order of magnitude.
An important task in quantum computing is unitary circuit synthesis compatible with physical hardware constraints. This problem has a natural hybrid structure as local single-qubit gates are continuous variables on the Lie group SU(2)SU(2)SU(2) while the entangling circuit structure is discrete and hardware-dependent. In this work, we use generative models to perform quantum circuit synthesis incorporating both the natural SU(2)SU(2)SU(2) manifold geometry of quantum gates and hardware constraints that determine the overall circuit structure. Our model comprises two components: a circuit skeleton selector that chooses an entangling circuit and a diffusion model that generates quantum gates on the given circuit template by performing diffusion on the curved manifold SU(2)≃S3\mathrm{SU(2)} \simeq S^3SU(2)≃S3 itself. We demonstrate this approach with unitary compilation of physically motivated three-qubit Hamiltonian simulation targets such as the Transverse Field Ising Model and the Heisenberg-XXZ Model and show that Lie group diffusion outperforms comparable baselines. The synthesised circuits can also be customised subject to constraints, which we demonstrate by producing circuits with large and small gate rotation angles for the same target unitary evolution. We also investigate the fidelity-complexity frontier of the synthesised gates to demonstrate that the circuit selector learns to select circuits that balance fidelity with complexity rather than collapsing onto the most expansive entangling template. These results demonstrate that Lie group diffusion provides a natural generative framework for hardware-aware quantum circuit synthesis.
Abstract Efficiently compiling quantum operations remains a major bottleneck in scaling quantum computing. Today’s state-of-the-art methods achieve low compilation error by combining search algorithms with gradient-based parameter optimization, but they incur long runtimes and require multiple calls to quantum hardware or expensive classical simulations, making their scaling prohibitive. Recently, machine-learning models have emerged as an alternative, though they are currently restricted to discrete gate sets. Here, we introduce a multimodal denoising diffusion model that simultaneously generates a circuit’s structure and its continuous parameters for compiling a target unitary. It leverages two independent diffusion processes, one for discrete gate selection and one for parameter prediction. We benchmark the model over different experiments, analyzing the method’s accuracy across varying qubit counts and circuit depths, showcasing the ability of the method to outperform existing approaches in gate counts and under noisy conditions. Additionally, we show that a simple post-optimization scheme allows us to significantly improve the generated ansätze. Finally, by exploiting its rapid circuit generation, we create large datasets of circuits for particular operations and use these to extract valuable heuristics that can help us discover new insights into quantum circuit synthesis. Code and models are publicly available at https://github.com/FlorianFuerrutter/genQC .
Abstract Quantum circuit synthesis becomes increasingly challenging as system sizes grow and hardware-native gate sets diversify. Denoising diffusion models have recently been applied to quantum circuit synthesis as an alternative to expensive classical optimization. Existing diffusion-based approaches, however, either operate on discrete gate alphabets or separate gate identities and continuous parameters into different generative streams, which raises the question of whether a unified representation can more naturally encode structure–parameter dependencies. We propose a hybrid diffusion–optimization framework for quantum circuit synthesis with continuous native gates. Taking a trapped-ion-inspired native gate set as a representative example, our single-stream diffusion model operates directly on a continuous-parameter gate set { R X ( θ ), R Y ( θ ), R XX ( θ )} and produces fully parameterized circuits in a single diffusion sampling run. A lightweight gradient-based post-optimization of the continuous parameters, based on the process infidelity, then corrects residual stochastic errors. Trained and evaluated on random three-qubit unitaries, the model generates compact circuits that accurately approximate unseen targets. Under identical training conditions, the continuous-gate formulation achieves substantially lower process infidelity than both random-circuit and a discrete-gate diffusion baseline. Furthermore, applying gradient-based post-optimization to the continuous-gate diffusion output yields a significant additional improvement in fidelity compared with the same model without post-optimization, demonstrating that this refinement step is an effective strategy for correcting residual stochastic errors in the diffusion-generated parameters. These results point to a practical route toward continuous-parameter quantum circuit synthesis in native gate sets.
The rapid advancement of Noisy Intermediate-Scale Quantum (NISQ) devices has driven the need for efficient design automation tools that can translate complex engineering models into executable quantum circuits. This study explores the development of automated quantum circuit design frameworks focused on gate optimization and noise-aware compilation, enabling practical quantum computation for engineering applications such as optimization, simulation, and control systems. Traditional circuit design methods often fail to account for hardware constraints, decoherence, and gate infidelity, which significantly affect computational accuracy on NISQ devices. To address these challenges, this research introduces a hybrid automation approach combining quantum transpilation, variational circuit pruning, and error-aware synthesis algorithms to enhance circuit reliability and scalability. The framework integrates quantum-classical co-design principles to optimize both logical and physical circuit layers, leveraging hardware-specific calibration data to adapt compilation strategies dynamically. Through simulations and benchmark analysis, the proposed system demonstrates significant improvements in quantum resource utilization, error mitigation, and gate depth reduction compared to conventional compilation methods. This work underscores the growing importance of design automation in quantum engineering, where algorithmic efficiency must be harmonized with physical constraints to realize functional and scalable quantum workflows. By establishing a methodology for gate-level optimization and noise-adaptive design, the study contributes to bridging the gap between theoretical quantum algorithms and real-world engineering implementations within the NISQ computing era.
Abstract Quantum computation represents a promising frontier in the domain of high-performance computing, blending quantum information theory with practical applications to overcome the limitations of classical computation. This study investigates the challenges of manufacturing high-fidelity and scalable quantum processors. Quantum gate set tomography (QGST) is a critical method for characterizing quantum processors and understanding their operational capabilities and limitations. This paper introduces Ml4Qgst as a novel approach to QGST by integrating machine learning techniques, specifically utilizing a transformer neural network model. Adapting the transformer model for QGST addresses the computational complexity of modeling quantum systems. Advanced training strategies, including data grouping and curriculum learning, are employed to enhance model performance, demonstrating significant congruence with ground-truth values. We benchmark this training pipeline on the constructed learning model, to successfully perform QGST for 2 and 3 gates on single-qubit and two-qubit systems, with over-rotation error and depolarizing noise estimation with comparable accuracy to pyGSTi. This research marks a pioneering step in applying deep neural networks to the complex problem of quantum gate set tomography, showcasing the potential of machine learning to tackle nonlinear tomography challenges in quantum computing.