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:2505.22533 · Scientific Reports

TabularQGAN: a quantum generative model for tabular data synthesis

Pallavi Bhardwaj, C. R. Jones, Lasse Dierich, Aleksandar Vučković

Published Jul 29, 2026• 0 citations
arXivHTMLPDF

Abstract

In this paper, we introduce a novel quantum generative model for synthesizing tabular data. Synthetic data is valuable in scenarios where real-world data is scarce or private, as it can be used to augment or replace existing datasets. As enterprise data is predominantly tabular and heterogeneous, often consisting of both categorical and numerical features, this task is relevant across various industries such as healthcare, finance, and software. Existing quantum generative models are designed for homogeneous data; we seek to fill this gap by proposing a quantum generative adversarial network architecture with flexible data encoding and a novel quantum circuit ansatz for effectively modeling tabular data. The proposed approach is tested on the MIMIC-III healthcare and Adult Census datasets, with extensive benchmarking against leading classical models, CTGAN, CopulaGAN, VAE-GMM, and an LLM-based approach using the be-GReaT framework for tabular data synthesis. We evaluated our model as a proof-of-concept on reduced feature subsets using a noiseless statevector simulator on classical hardware. Our simulations show that, for the MIMIC-III dataset, our quantum model achieves competitive, and in some cases, leading performance with respect to an overall similarity score used in the open-source Python library SDMetrics. Additionally, we evaluate the generalization capabilities of the models using two custom-designed metrics that demonstrate the ability of the proposed quantum model to generate useful and novel tabular samples.

DOI
10.1038/s41598-026-62434-1

Related papers

QTabGAN: A Hybrid Quantum-Classical GAN for Tabular Data Synthesis

Subhangi Kumari, Rakesh Achutha, Vignesh Sivaraman

Synthesizing realistic tabular data is challenging due to heterogeneous feature types and high dimensionality. We introduce QTabGAN, a hybrid quantum-classical generative adversarial framework for tabular data synthesis. QTabGAN is especially designed for settings where real data are scarce or restricted by privacy constraints. The model exploits the expressive power of quantum circuits to learn complex data distributions, which are then mapped to tabular features using classical neural networks. We evaluate QTabGAN on multiple classification and regression datasets and benchmark it against leading state-of-the-art generative models. Experiments show that QTabGAN achieves up to 54.07% improvement across various classification datasets and evaluation metrics, thus establishing a scalable quantum approach to tabular data synthesis and highlighting its potential for quantum-assisted generative modelling.

cs.LGCross-listedarXiv:2602.12704•Feb 16, 2026•0 citations

QUGAN: Hybrid Generative Adversarial Networks with Variational Quantum Circuits for Synthetic Medical Data Generation

Ouail EL Bani, Chaïmaâ Kissi, Mohamed Nabil Srifi

The need for synthetic medical data is growing rapidly as machine learning becomes more important in healthcare, especially with strict privacy rules like HIPAA in the United States and GDPR in Europe. While Generative Adversarial Networks (GANs) have shown potential in generating realistic synthetic data, they often face problems such as mode collapse, unstable training, and difficulty handling complex, high-dimensional medical datasets.In this work, we introduce a new Quantum Generative Adversarial Network (QUGAN) that combines the strengths of quantum and classical computing. The generator is built using a Variational Quantum Circuit (VQC), while the discriminator remains a classical neural network. To our knowledge, this is the first time a QUGAN has been applied to structured tabular healthcare data and especially using a VQC circuit in the generator, which makes up most real electronic health records but is rarely explored in quantum machine learning. The model was developed step by step, starting from a simple GAN baseline, and gradually improved into a more powerful hybrid system.The QUGAN performed considerably better compared with the standard baseline when tested on actual cardiovascular dataset. While achieving synthetic precision scores of up to 92%, it decreased the Maximum Mean Discrepancy (MMD) by 50.6%, the Kullback–Leibler (KL) divergence by 65.6%, and the Jensen–Shannon (JS) divergence by 67.7%. These results indicate that the model creates diverse samples close to real data, which are a key factor for safe data sharing and dependable analysis later. In short, our findings suggest that QUGANs that uses VQC circuits can be reliable method to produce tabular medical datasets.

International Symposium on Advanced Electrical and Communication Technologies (ISAECT)•Dec 18, 2025•0 citations

Quantum-Enhanced Synthetic Data Generation Using Quantum Circuit Born Machines for Imbalanced Tabular Learning

Tanapol Nuatho, Narisorn Sangnakara, Prapong Prechaprapranwong +1 more

Data scarcity and class imbalance are persistent challenges in machine learning that degrade model generalization and introduce predictive bias. We present a hybrid quantum-classical framework for synthetic data generation using a Quantum Circuit Born Machine (QCBM) to address these limitations. The proposed approach exploits quantum mechanical properties -- superposition and entanglement -- within a parameterized variational quantum circuit to model complex probability distributions that are difficult for classical generative methods to capture. Experiments are conducted on two tabular benchmark datasets: the Iris dataset and the Telco Customer Churn dataset. Preprocessing includes normalization and PCA-based dimensionality reduction to enable efficient basis encoding for quantum circuits. The QCBM is trained by minimizing Kullback-Leibler (KL) divergence between real and generated data distributions using a gradient-based parameter-shift optimization rule. Augmenting training data with QCBM-generated synthetic samples at 40-50% of the minority class improves F1-score by approximately 5-15% and minority-class recall by 10-25%. Cross-domain evaluations (Train on Synthetic, Test on Real; and Train on Real, Test on Synthetic) reveal a performance gap of only 3-10%, indicating strong distributional fidelity. Comparative analysis against classical oversampling methods -- SMOTE, Borderline-SMOTE, KMeansSMOTE, and SVM-SMOTE -- shows that QCBM achieves competitive classification performance and produces lower Maximum Mean Discrepancy (MMD) on the Telco dataset, suggesting superior structural similarity in certain imbalanced settings. These findings establish QCBM as a viable complementary tool for data augmentation, particularly for low-dimensional structured tabular data with class imbalance.

quant-pharXiv:2607.09113•Jul 13, 2026•0 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

A Hybrid Quantum–Classical Generative Adversarial Network for Synthetic Biological Data Generation

Arnab Ghosh, Snehasish Saha Arghya, Bommareddy Lokesh

Synthetic biological data play a crucial role in bioinformatics research, particularly in scenarios involving limited data availability and strict privacy constraints. However, conventional generative adversarial networks often face challenges in simultaneously preserving local statistical characteristics and global data distributions, motivating the exploration of quantum-enhanced generative models. This paper proposes and evaluates a hybrid quantum–classical generative adversarial network (QGAN) for efficient and high-quality biological data generation. The generator is implemented using a variational quantum circuit that encodes classical biological features into parameterized quantum states, while the discriminator is realized through a classical neural network architecture. The proposed framework is evaluated against classical GAN models using quantitative metrics, including the Classifier Two-Sample Test (C2ST), Maximum Mean Discrepancy (MMD) and Wasserstein Distance (WD). Experimental results show that the QGAN achieves stronger local statistical distribution matching, reflected by lower MMD values, whereas the Classical GAN demonstrates more stable global distribution alignment through lower WD. Furthermore, the analysis reveals that the stochastic sampling behavior of parameterized quantum circuits contributes to higher output variance during training, influencing large-scale distribution consistency. These findings indicate that hybrid quantum–classical generative models can effectively preserve localized statistical structures while highlighting the trade-off between local fidelity and global distribution stability, supporting their potential for future applications in genomics, drug discovery, and privacy-preserving biomedical data synthesis.

IEEE Access•Jan 1, 2026•0 citations

A Characterization of Quantum Generative Models

Carlos A. Riofrío, Oliver Mitevski, C. R. Jones +6 more

Quantum generative modeling is a growing area of interest for industry-relevant applications. This work systematically compares a broad range of techniques to guide quantum computing practitioners when deciding which models and methods to use in their applications. We compare fundamentally different architectural ansatzes of parametric quantum circuits: (1) A continuous architecture, which produces continuous-valued data samples, and (2) a discrete architecture, which samples on a discrete grid. We also compare the performance of different data transformations: the min-max and the probability integral transforms. We use two popular training methods: (1) quantum circuit Born machines (QCBM), and (2) quantum generative adversarial networks (QGAN). We study their performance and tradeoffs as the number of model parameters increases, with a baseline comparison of similarly trained classical neural networks. The study is performed on six low-dimensional synthetic and two real financial data sets. Our two key findings are that: (1) For all data sets, our quantum models require similar or fewer parameters than their classical counterparts. In the extreme case, the quantum models require two orders of magnitude less parameters. (2) We empirically find that a variant of the discrete architecture, which learns the copula of the probability distribution, outperforms all other methods.

arXiv:2301.09363•ACM Transactions on Quantum Computing•Apr 4, 2024•31 citations
In this paper, we introduce a novel quantum generative model for synthesizing tabular data. Synthetic data is valuable in scenarios where real-world data is scarce or private, as it can be used to augment or replace existing datasets. As enterprise data is predominantly tabular and heterogeneous, often consisting of both categorical and numerical features, this task is relevant across various industries such as healthcare, finance, and software. Existing quantum generative models are designed for homogeneous data; we seek to fill this gap by proposing a quantum generative adversarial network architecture with flexible data encoding and a novel quantum circuit ansatz for effectively modeling tabular data. The proposed approach is tested on the MIMIC-III healthcare and Adult Census datasets, with extensive benchmarking against leading classical models, CTGAN, CopulaGAN, VAE-GMM, and an LLM-based approach using the be-GReaT framework for tabular data synthesis. We evaluated our model as a proof-of-concept on reduced feature subsets using a noiseless statevector simulator on classical hardware. Our simulations show that, for the MIMIC-III dataset, our quantum model achieves competitive, and in some cases, leading performance with respect to an overall similarity score used in the open-source Python library SDMetrics. Additionally, we evaluate the generalization capabilities of the models using two custom-designed metrics that demonstrate the ability of the proposed quantum model to generate useful and novel tabular samples.
Synthesizing realistic tabular data is challenging due to heterogeneous feature types and high dimensionality. We introduce QTabGAN, a hybrid quantum-classical generative adversarial framework for tabular data synthesis. QTabGAN is especially designed for settings where real data are scarce or restricted by privacy constraints. The model exploits the expressive power of quantum circuits to learn complex data distributions, which are then mapped to tabular features using classical neural networks. We evaluate QTabGAN on multiple classification and regression datasets and benchmark it against leading state-of-the-art generative models. Experiments show that QTabGAN achieves up to 54.07% improvement across various classification datasets and evaluation metrics, thus establishing a scalable quantum approach to tabular data synthesis and highlighting its potential for quantum-assisted generative modelling.
The need for synthetic medical data is growing rapidly as machine learning becomes more important in healthcare, especially with strict privacy rules like HIPAA in the United States and GDPR in Europe. While Generative Adversarial Networks (GANs) have shown potential in generating realistic synthetic data, they often face problems such as mode collapse, unstable training, and difficulty handling complex, high-dimensional medical datasets.In this work, we introduce a new Quantum Generative Adversarial Network (QUGAN) that combines the strengths of quantum and classical computing. The generator is built using a Variational Quantum Circuit (VQC), while the discriminator remains a classical neural network. To our knowledge, this is the first time a QUGAN has been applied to structured tabular healthcare data and especially using a VQC circuit in the generator, which makes up most real electronic health records but is rarely explored in quantum machine learning. The model was developed step by step, starting from a simple GAN baseline, and gradually improved into a more powerful hybrid system.The QUGAN performed considerably better compared with the standard baseline when tested on actual cardiovascular dataset. While achieving synthetic precision scores of up to 92%, it decreased the Maximum Mean Discrepancy (MMD) by 50.6%, the Kullback–Leibler (KL) divergence by 65.6%, and the Jensen–Shannon (JS) divergence by 67.7%. These results indicate that the model creates diverse samples close to real data, which are a key factor for safe data sharing and dependable analysis later. In short, our findings suggest that QUGANs that uses VQC circuits can be reliable method to produce tabular medical datasets.
Data scarcity and class imbalance are persistent challenges in machine learning that degrade model generalization and introduce predictive bias. We present a hybrid quantum-classical framework for synthetic data generation using a Quantum Circuit Born Machine (QCBM) to address these limitations. The proposed approach exploits quantum mechanical properties -- superposition and entanglement -- within a parameterized variational quantum circuit to model complex probability distributions that are difficult for classical generative methods to capture. Experiments are conducted on two tabular benchmark datasets: the Iris dataset and the Telco Customer Churn dataset. Preprocessing includes normalization and PCA-based dimensionality reduction to enable efficient basis encoding for quantum circuits. The QCBM is trained by minimizing Kullback-Leibler (KL) divergence between real and generated data distributions using a gradient-based parameter-shift optimization rule. Augmenting training data with QCBM-generated synthetic samples at 40-50% of the minority class improves F1-score by approximately 5-15% and minority-class recall by 10-25%. Cross-domain evaluations (Train on Synthetic, Test on Real; and Train on Real, Test on Synthetic) reveal a performance gap of only 3-10%, indicating strong distributional fidelity. Comparative analysis against classical oversampling methods -- SMOTE, Borderline-SMOTE, KMeansSMOTE, and SVM-SMOTE -- shows that QCBM achieves competitive classification performance and produces lower Maximum Mean Discrepancy (MMD) on the Telco dataset, suggesting superior structural similarity in certain imbalanced settings. These findings establish QCBM as a viable complementary tool for data augmentation, particularly for low-dimensional structured tabular data with class imbalance.
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.
Synthetic biological data play a crucial role in bioinformatics research, particularly in scenarios involving limited data availability and strict privacy constraints. However, conventional generative adversarial networks often face challenges in simultaneously preserving local statistical characteristics and global data distributions, motivating the exploration of quantum-enhanced generative models. This paper proposes and evaluates a hybrid quantum–classical generative adversarial network (QGAN) for efficient and high-quality biological data generation. The generator is implemented using a variational quantum circuit that encodes classical biological features into parameterized quantum states, while the discriminator is realized through a classical neural network architecture. The proposed framework is evaluated against classical GAN models using quantitative metrics, including the Classifier Two-Sample Test (C2ST), Maximum Mean Discrepancy (MMD) and Wasserstein Distance (WD). Experimental results show that the QGAN achieves stronger local statistical distribution matching, reflected by lower MMD values, whereas the Classical GAN demonstrates more stable global distribution alignment through lower WD. Furthermore, the analysis reveals that the stochastic sampling behavior of parameterized quantum circuits contributes to higher output variance during training, influencing large-scale distribution consistency. These findings indicate that hybrid quantum–classical generative models can effectively preserve localized statistical structures while highlighting the trade-off between local fidelity and global distribution stability, supporting their potential for future applications in genomics, drug discovery, and privacy-preserving biomedical data synthesis.
Quantum generative modeling is a growing area of interest for industry-relevant applications. This work systematically compares a broad range of techniques to guide quantum computing practitioners when deciding which models and methods to use in their applications. We compare fundamentally different architectural ansatzes of parametric quantum circuits: (1) A continuous architecture, which produces continuous-valued data samples, and (2) a discrete architecture, which samples on a discrete grid. We also compare the performance of different data transformations: the min-max and the probability integral transforms. We use two popular training methods: (1) quantum circuit Born machines (QCBM), and (2) quantum generative adversarial networks (QGAN). We study their performance and tradeoffs as the number of model parameters increases, with a baseline comparison of similarly trained classical neural networks. The study is performed on six low-dimensional synthetic and two real financial data sets. Our two key findings are that: (1) For all data sets, our quantum models require similar or fewer parameters than their classical counterparts. In the extreme case, the quantum models require two orders of magnitude less parameters. (2) We empirically find that a variant of the discrete architecture, which learns the copula of the probability distribution, outperforms all other methods.