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:2405.04401 · AIP Advances

Cross-platform hardware benchmark of style-based quantum GANs for data augmentation on superconducting and trapped-ion processors

Julien Baglio

Published Jun 1, 2026• 11 citations
arXivHTMLPDF

Abstract

In the noisy intermediate-scale quantum era, controlled benchmarks of quantum machine-learning workloads across hardware modalities are needed to quantify how given algorithms behave under native provider execution stacks. This work presents such a benchmark for the style-based quantum generative adversarial network (qGAN) on a high-energy physics data-augmentation task. We compare two commercially available gate-model quantum computers: the IBM ibm_torino hardware, based on superconducting transmon qubits from the Heron chip, and the IonQ aria-1 hardware, based on trapped-ion qubits. The generator architecture and trained parameters are kept fixed, and built-in mitigation is disabled when possible. We report quality and runtime metrics under each provider’s native stack. The workflow uses circuit replication across available qubits, up to 48 on IBM and 24 on IonQ, to reduce the number of submitted jobs required for the target sample set. To our knowledge, this is one of the first controlled style-based qGAN hardware-to-hardware comparisons for this data-augmentation task. We observe that both platforms complete the task successfully, with marginal Kullback–Leibler divergences somewhat lower on aria-1, while end-to-end runtime is significantly shorter on ibm_torino. These results are an application-specific trade-off benchmark, not a claim of algorithmic novelty.

DOI
10.1063/5.0322308

Related papers

Style-based quantum generative adversarial networks for Monte Carlo events

Carlos Bravo-Prieto, Julien Baglio, Marco Cè +3 more

We propose and assess an alternative quantum generator architecture in the context of generative adversarial learning for Monte Carlo event generation, used to simulate particle physics processes at the Large Hadron Collider (LHC). We validate this methodology by implementing the quantum network on artificial data generated from known underlying distributions. The network is then applied to Monte Carlo-generated datasets of specific LHC scattering processes. The new quantum generator architecture leads to a generalization of the state-of-the-art implementations, achieving smaller Kullback-Leibler divergences even with shallow-depth networks. Moreover, the quantum generator successfully learns the underlying distribution functions even if trained with small training sample sets; this is particularly interesting for data augmentation applications. We deploy this novel methodology on two different quantum hardware architectures, trapped-ion and superconducting technologies, to test its hardware-independent viability.

arXiv:2110.06933•Quantum•Aug 17, 2022•59 citations

A generative modeling approach for benchmarking and training shallow quantum circuits

Marcello Benedetti, Delfina García Pintos, Oscar Mario Perdomo +3 more

Abstract Hybrid quantum-classical algorithms provide ways to use noisy intermediate-scale quantum computers for practical applications. Expanding the portfolio of such techniques, we propose a quantum circuit learning algorithm that can be used to assist the characterization of quantum devices and to train shallow circuits for generative tasks. The procedure leverages quantum hardware capabilities to its fullest extent by using native gates and their qubit connectivity. We demonstrate that our approach can learn an optimal preparation of the Greenberger-Horne-Zeilinger states, also known as “cat states”. We further demonstrate that our approach can efficiently prepare approximate representations of coherent thermal states, wave functions that encode Boltzmann probabilities in their amplitudes. Finally, complementing proposals to characterize the power or usefulness of near-term quantum devices, such as IBM’s quantum volume, we provide a new hardware-independent metric called the qBAS score. It is based on the performance yield in a specific sampling task on one of the canonical machine learning data sets known as Bars and Stripes. We show how entanglement is a key ingredient in encoding the patterns of this data set; an ideal benchmark for testing hardware starting at four qubits and up. We provide experimental results and evaluation of this metric to probe the trade off between several architectural circuit designs and circuit depths on an ion-trap quantum computer.

arXiv:1801.07686•npj Quantum Information•May 27, 2019•441 citations

Quantum Generative Adversarial Networks (QGANs) for Data Augmentation

Jincheng Zhang

This paper investigates the application of Quantum Generative Adversarial Networks (QGANs) to data augmentation for machine learning. Traditional Generative Adversarial Networks (GANs) rely on classical neural networks, while this research explores leveraging quantum circuits as generators within a QGAN architecture. The core idea is to train a quantum generator to produce synthetic data samples, supplementing existing datasets with novel instances. The discriminator remains a classical neural network, tasked with distinguishing between real and generated data. We present a theoretical framework for this approach, outlining the mathematical formulation and key components. Specifically, we introduce the notation (x, s_1, s_2, ..., s_K) to represent data samples, generator states, and relevant parameters. The objective function for the QGAN is defined as minimizing the Jensen-Shannon divergence between the real and generated data distributions. The effectiveness of this approach is discussed, highlighting potential advantages and challenges. This work contributes to the emerging field of quantum machine learning and offers a novel strategy for improving the performance of machine learning models, particularly in scenarios with limited training data.

•Aug 31, 2026•0 citations

Quantum generative adversarial networks with multiple superconducting qubits

Kaixuan Huang, Zheng‐An Wang, Chao Song +11 more

Abstract Generative adversarial networks are an emerging technique with wide applications in machine learning, which have achieved dramatic success in a number of challenging tasks including image and video generation. When equipped with quantum processors, their quantum counterparts—called quantum generative adversarial networks (QGANs)—may even exhibit exponential advantages in certain machine learning applications. Here, we report an experimental implementation of a QGAN using a programmable superconducting processor, in which both the generator and the discriminator are parameterized via layers of single- and two-qubit quantum gates. The programmed QGAN runs automatically several rounds of adversarial learning with quantum gradients to achieve a Nash equilibrium point, where the generator can replicate data samples that mimic the ones from the training set. Our implementation is promising to scale up to noisy intermediate-scale quantum devices, thus paving the way for experimental explorations of quantum advantages in practical applications with near-term quantum technologies.

arXiv:2009.12827•npj Quantum Information•Dec 1, 2021•64 citations

Quantum Generative Adversarial Networks in the NISQ Era: A Survey of Architectures, Objectives, and Evaluation Practices (2023-2025)

Sakthi Prabhu Gunasekar, Prasanna Kumar Rangarajan

Quantum Generative Adversarial Networks (QGANs) incorporate quantum models, predominantly parameterized quantum circuits (PQCs), into adversarial learning frameworks for generative modeling within Noisy Intermediate Scale Quantum (NISQ) limitations. In the past three years, QGAN research has transitioned towards hybrid quantum-classical architectures, patch-based and latent-based scaling methodologies, and stability-focused objectives, including Wasserstein losses, gradient penalties, mutual-information regularization, and learned priors. This survey examines representative QGAN literature from 2023 to 2025, emphasizing algorithmic objectives, reported experimental results, evaluation methodologies, and practical constraints. This paper proposes a multidimensional taxonomy for organizing recent QGAN research based on architectural design, training objectives, scalability strategies, and evaluation practices. It highlights persistent issues in benchmarking, scalability, and hardware realism by comparing datasets, metrics, and architectural patterns across studies, offering a structured overview of the current QGAN research landscape.

International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT)•Apr 1, 2026•0 citations

Quantum Error Management in Practice: A Cross-Stack Benchmark

Daniel Sierra-Sosa, Begonya Garcia-Zapirain, Cristian Marquez +1 more

Quantum processors have crossed the one-hundred-qubit mark, but noise continues to limit circuit performance, while full quantum error correction remains too costly for routine use. Error suppression and mitigation therefore play an important role in extracting value from current hardware, yet independent comparisons of commercial solutions on identical workloads and devices remain scarce. We benchmark IBM Qiskit Runtime, Q-CTRL Performance Management, and Qedma QESEM on IBM Pittsburgh, a 156-qubit IBM Quantum Heron r3 processor. For Sampler workloads, we run Bernstein-Vazirani, quantum phase estimation, GHZ-state preparation, and randomized mirror circuits with up to 100 measured qubits, comparing raw execution, IBM measurement twirling, and Q-CTRL. For Estimator workloads, we measure chain-averaged magnetization and correlation observables of an eight-layer transverse-field Ising circuit at 25, 50, and 75 qubits against an exact matrix-product-state reference, comparing IBM raw execution, IBM TREX plus twirling, Q-CTRL, and QESEM. Q-CTRL produced the best results on the three structured Sampler workloads while keeping reported QPU times within the same order as the IBM configurations. Across six Ising observable and system-size cases, aggregate mean absolute error was 0.0883 for IBM raw execution, 0.0807 for IBM TREX plus twirling, 0.0285 for Q-CTRL, and 0.0188 for QESEM. Relative to raw execution, Q-CTRL and QESEM reduced aggregate error by factors of 3.10 and 4.70, respectively, while QESEM used 7.5 to 11.1 times the reported QPU time of Q-CTRL. These results show that managed error suppression and mitigation can substantially improve current hardware performance, but with distinct accuracy and execution-time tradeoffs.

quant-pharXiv:2608.05202•Aug 6, 2026•0 citations
In the noisy intermediate-scale quantum era, controlled benchmarks of quantum machine-learning workloads across hardware modalities are needed to quantify how given algorithms behave under native provider execution stacks. This work presents such a benchmark for the style-based quantum generative adversarial network (qGAN) on a high-energy physics data-augmentation task. We compare two commercially available gate-model quantum computers: the IBM ibm_torino hardware, based on superconducting transmon qubits from the Heron chip, and the IonQ aria-1 hardware, based on trapped-ion qubits. The generator architecture and trained parameters are kept fixed, and built-in mitigation is disabled when possible. We report quality and runtime metrics under each provider’s native stack. The workflow uses circuit replication across available qubits, up to 48 on IBM and 24 on IonQ, to reduce the number of submitted jobs required for the target sample set. To our knowledge, this is one of the first controlled style-based qGAN hardware-to-hardware comparisons for this data-augmentation task. We observe that both platforms complete the task successfully, with marginal Kullback–Leibler divergences somewhat lower on aria-1, while end-to-end runtime is significantly shorter on ibm_torino. These results are an application-specific trade-off benchmark, not a claim of algorithmic novelty.
We propose and assess an alternative quantum generator architecture in the context of generative adversarial learning for Monte Carlo event generation, used to simulate particle physics processes at the Large Hadron Collider (LHC). We validate this methodology by implementing the quantum network on artificial data generated from known underlying distributions. The network is then applied to Monte Carlo-generated datasets of specific LHC scattering processes. The new quantum generator architecture leads to a generalization of the state-of-the-art implementations, achieving smaller Kullback-Leibler divergences even with shallow-depth networks. Moreover, the quantum generator successfully learns the underlying distribution functions even if trained with small training sample sets; this is particularly interesting for data augmentation applications. We deploy this novel methodology on two different quantum hardware architectures, trapped-ion and superconducting technologies, to test its hardware-independent viability.
Abstract Hybrid quantum-classical algorithms provide ways to use noisy intermediate-scale quantum computers for practical applications. Expanding the portfolio of such techniques, we propose a quantum circuit learning algorithm that can be used to assist the characterization of quantum devices and to train shallow circuits for generative tasks. The procedure leverages quantum hardware capabilities to its fullest extent by using native gates and their qubit connectivity. We demonstrate that our approach can learn an optimal preparation of the Greenberger-Horne-Zeilinger states, also known as “cat states”. We further demonstrate that our approach can efficiently prepare approximate representations of coherent thermal states, wave functions that encode Boltzmann probabilities in their amplitudes. Finally, complementing proposals to characterize the power or usefulness of near-term quantum devices, such as IBM’s quantum volume, we provide a new hardware-independent metric called the qBAS score. It is based on the performance yield in a specific sampling task on one of the canonical machine learning data sets known as Bars and Stripes. We show how entanglement is a key ingredient in encoding the patterns of this data set; an ideal benchmark for testing hardware starting at four qubits and up. We provide experimental results and evaluation of this metric to probe the trade off between several architectural circuit designs and circuit depths on an ion-trap quantum computer.
This paper investigates the application of Quantum Generative Adversarial Networks (QGANs) to data augmentation for machine learning. Traditional Generative Adversarial Networks (GANs) rely on classical neural networks, while this research explores leveraging quantum circuits as generators within a QGAN architecture. The core idea is to train a quantum generator to produce synthetic data samples, supplementing existing datasets with novel instances. The discriminator remains a classical neural network, tasked with distinguishing between real and generated data. We present a theoretical framework for this approach, outlining the mathematical formulation and key components. Specifically, we introduce the notation (x, s_1, s_2, ..., s_K) to represent data samples, generator states, and relevant parameters. The objective function for the QGAN is defined as minimizing the Jensen-Shannon divergence between the real and generated data distributions. The effectiveness of this approach is discussed, highlighting potential advantages and challenges. This work contributes to the emerging field of quantum machine learning and offers a novel strategy for improving the performance of machine learning models, particularly in scenarios with limited training data.
Abstract Generative adversarial networks are an emerging technique with wide applications in machine learning, which have achieved dramatic success in a number of challenging tasks including image and video generation. When equipped with quantum processors, their quantum counterparts—called quantum generative adversarial networks (QGANs)—may even exhibit exponential advantages in certain machine learning applications. Here, we report an experimental implementation of a QGAN using a programmable superconducting processor, in which both the generator and the discriminator are parameterized via layers of single- and two-qubit quantum gates. The programmed QGAN runs automatically several rounds of adversarial learning with quantum gradients to achieve a Nash equilibrium point, where the generator can replicate data samples that mimic the ones from the training set. Our implementation is promising to scale up to noisy intermediate-scale quantum devices, thus paving the way for experimental explorations of quantum advantages in practical applications with near-term quantum technologies.
Quantum Generative Adversarial Networks (QGANs) incorporate quantum models, predominantly parameterized quantum circuits (PQCs), into adversarial learning frameworks for generative modeling within Noisy Intermediate Scale Quantum (NISQ) limitations. In the past three years, QGAN research has transitioned towards hybrid quantum-classical architectures, patch-based and latent-based scaling methodologies, and stability-focused objectives, including Wasserstein losses, gradient penalties, mutual-information regularization, and learned priors. This survey examines representative QGAN literature from 2023 to 2025, emphasizing algorithmic objectives, reported experimental results, evaluation methodologies, and practical constraints. This paper proposes a multidimensional taxonomy for organizing recent QGAN research based on architectural design, training objectives, scalability strategies, and evaluation practices. It highlights persistent issues in benchmarking, scalability, and hardware realism by comparing datasets, metrics, and architectural patterns across studies, offering a structured overview of the current QGAN research landscape.
Quantum processors have crossed the one-hundred-qubit mark, but noise continues to limit circuit performance, while full quantum error correction remains too costly for routine use. Error suppression and mitigation therefore play an important role in extracting value from current hardware, yet independent comparisons of commercial solutions on identical workloads and devices remain scarce. We benchmark IBM Qiskit Runtime, Q-CTRL Performance Management, and Qedma QESEM on IBM Pittsburgh, a 156-qubit IBM Quantum Heron r3 processor. For Sampler workloads, we run Bernstein-Vazirani, quantum phase estimation, GHZ-state preparation, and randomized mirror circuits with up to 100 measured qubits, comparing raw execution, IBM measurement twirling, and Q-CTRL. For Estimator workloads, we measure chain-averaged magnetization and correlation observables of an eight-layer transverse-field Ising circuit at 25, 50, and 75 qubits against an exact matrix-product-state reference, comparing IBM raw execution, IBM TREX plus twirling, Q-CTRL, and QESEM. Q-CTRL produced the best results on the three structured Sampler workloads while keeping reported QPU times within the same order as the IBM configurations. Across six Ising observable and system-size cases, aggregate mean absolute error was 0.0883 for IBM raw execution, 0.0807 for IBM TREX plus twirling, 0.0285 for Q-CTRL, and 0.0188 for QESEM. Relative to raw execution, Q-CTRL and QESEM reduced aggregate error by factors of 3.10 and 4.70, respectively, while QESEM used 7.5 to 11.1 times the reported QPU time of Q-CTRL. These results show that managed error suppression and mitigation can substantially improve current hardware performance, but with distinct accuracy and execution-time tradeoffs.