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:2501.14185 · International Conference on Quantum Communications, Networking, and Computing (QCNC)

Tensor-Based Binary Graph Encoding for Variational Quantum Classifiers

Shiwen An, Konstantinos Slavakis

Published Mar 31, 2025• 1 citation
arXivHTMLPDF

Abstract

Quantum computing has been a prominent research area for decades, inspiring transformative fields such as quantum simulation, quantum teleportation, and quantum machine learning (QML), which are undergoing rapid development. Within QML, hybrid classical-quantum algorithms like Quantum Neural Networks (QNNs) and Variational Quantum Classifiers (VQCs) have shown promise in leveraging quantum circuits and classical optimizers to classify classical data efficiently. Simultaneously, classical machine learning has made significant strides in graph classification, employing Graph Neural Networks (GNNs) to analyze systems ranging from large-scale structures like the Large Hadron Collider to molecular and biological systems like proteins and DNA. Combining the advancements in quantum computing and graph classification presents a unique opportunity to develop quantum algorithms capable of extracting features from graphs and performing their classification effectively. In this paper, we propose a novel quantum encoding framework for graph classification using VQCs. Unlike existing approaches such as PCA-VQC, which rely on dimensionality reduction techniques like Principal Component Analysis (PCA) and may lead to information loss, our method preserves the integrity of graph data. Furthermore, our encoding approach is optimized for Noise-Intermediate Scale Quantum (NISQ) devices, requiring a limited number of qubits while achieving comparable or superior classification performance to PCA-VQC. By constructing slightly more complex circuits tailored for graph encoding, we demonstrate that VQCs can effectively classify graphs within the constraints of current quantum hardware.

DOI
10.1109/qcnc64685.2025.00095

Related papers

Quantum Machine Learning for Classification Tasks:Variational Quantum Classifiers and Quantum Neural Networks

Dr K N S Lakshmi, Bondalapu Sandhya, Nasari Durga Prasad +2 more

Quantum Machine Learning (QML) has emerged as a compelling research domain that unites quantum computing principles with classical learning theory to address computationally demanding classification problems.This paper investigates two principal QML architectures-Variational Quantum Classifiers (VQC) and Quantum Neural Networks (QNN)-within the context of binary classification.We present an end-to-end hybrid quantum-classical pipeline applied to the UCI Mushroom dataset, comprising 22 categorical attributes, and demonstrate that quantumenhanced models can achieve competitive classification performance under present-day hardware constraints.The pipeline integrates Quantum Random Access Code (QRAC) encoding for dimensionality reduction, ZZFeatureMapbased quantum feature mapping, RealAmplitudes parameterized ansatz, and classical optimizer-driven parameter updates using the COBYLA algorithm.The complete system is deployed through a Flask web interface and containerized with Docker for reproducibility.Experimental results on a quantum simulator indicate a classification accuracy of 87.4%, precision of 0.891, and recall of 0.863, establishing the practical viability of NISQ-era quantum classifiers for structured categorical data.The paper further analyzes convergence behavior, circuit depth effects, and comparative performance against classical baselines, providing insights into the strengths and limitations of current QML architectures for real-world classification deployment.

Journal of Science Engineering Technology and Management Sciences•Mar 1, 2026•0 citations

Hybrid Quantum-Classical Graph Neural Networks for Tumor Classification in Digital Pathology

Anupama Ray, Dhiraj Madan, Srushti Patil +8 more

Advances in classical machine learning and single-cell technologies have paved the way for understanding interactions between disease cells and tumor microenvironments towards accelerating therapeutic discovery. However, challenges in these machine learning methods and NP-hard problems in spatial biology create an opportunity to explore quantum computing algorithms. Here, we present a hybrid quantum-classical graph neural network (GNN) that combines a classical GNN with a type of quantum neural network (QNN) called a variational quantum classifier (VQC) for classifying binary sub-tasks in breast cancer subtyping. We explore two variants of the framework, the first with fixed pretrained GNN parameters and the second with end-to-end training of GNN+VQC. The results demonstrate that the hybrid quantum-classical neural network is at par with the state-of-the-art classical graph neural networks in terms of weighted precision, recall, and F1-score at higher dimensions. We also show that by means of amplitude encoding, we can compress information in logarithmic number of qubits and attain better performance in comparison to classical compression (which leads to information loss), while keeping the number of qubits required constant in both regimes. Finally, we show some results that end-to-end training enables an improvement over fixed GNN parameters and also slightly improves over vanilla GNN with the same number of dimensions.

arXiv:2310.11353•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•19 citations

Variational Quantum Circuits for Molecular Classification Using Graph Neural Network

Don Roosan, Md Rahatul Ashakin, Rubayat Islam Khan +4 more

The study explores the integration of quantum-enhanced feature mapping and optimization within Graph Neural Networks (GNNs) for molecular classification tasks. Utilizing IBM's Qiskit platform, we implement Variational Quantum Circuits (VQCs) to transform classical molecular features into quantum states, capturing complex correlations through quantum entanglement. Additionally, the Quantum Approximate Optimization Algorithm (QAOA) is employed for hyperparameter tuning to enhance model convergence and performance. Comparative analyses against traditional machine learning models demonstrate the superiority of the quantum-enhanced GNN, highlighting the potential of quantum computing in advancing molecular property prediction.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•19 citations

Exploring the potential of Quantum Graph Neural Networks in analyzing Large-Scale Structure of Universe

Farida Farsian, Francesco Schillirò, Andrea A. Bulgarelli +12 more

The large-scale structure (LSS) of the Universe, characterized by the distribution of clusters, filaments, walls, and voids, encodes fundamental information about cosmology and structure formation. Standard cosmological analyses, based on abundances as well as two-point and higher-order correlation functions, have been widely used to extract information from LSS. While powerful, these techniques can only access a subset of the full information content, leaving much of the encoded structure underexploited. This motivates the use of more flexible approaches capable of learning directly from the raw, graph-like nature of the cosmic web without relying on strong compression or dimensionality reduction. Recent advances in machine learning, particularly graph neural networks (GNNs), provide a natural framework for this task by capturing the non-Euclidean connectivity of cosmic structures. Building on these developments, recent progress in quantum machine learning (QML) offers an intriguing opportunity to further enhance representation power through quantum-enhanced models. In this work, we investigate the potential of quantum graph neural networks (QGNNs) as an alternative computational framework for analyzing LSS, focusing on structure identification and classification with an emphasis on distinguishing clusters and voids. Leveraging the hybrid quantum–classical paradigm implemented in PennyLane, we construct variational quantum circuits to encode graph representations of cosmological data and compare their performance against state-of-the-art classical GNNs. Our study evaluates the accuracy and expressivity of QGNNs relative to classical models, with particular attention to their ability to capture complex correlations in sparse, high-dimensional astrophysical datasets. Preliminary results indicate that QGNNs achieve comparable classification performance, while highlighting both the opportunities and current limitations of quantum-enhanced approaches in cosmological applications.

Astronomy and Computing•Mar 5, 2026•6 citations

Enhancing the performance of variational quantum classifiers with hybrid autoencoders

Georgios Maragkopoulos, Aikaterini Mandilara, Antonia Tsili +1 more

Abstract Variational quantum circuits (VQC) lie at the forefront of quantum machine learning research. Still, the use of quantum networks for real data processing remains challenging as the number of available qubits cannot accommodate a large dimensionality of data—if the usual angle encoding scenario is used. To achieve dimensionality reduction, Principal Component Analysis is routinely applied as a pre-processing method before the embedding of the classical features on qubits. In this work, we propose an alternative method which reduces the dimensionality of a given dataset by taking into account the specific quantum embedding that comes after. This method aspires to make quantum machine learning with VQCs more versatile and effective on datasets of high dimension. At a second step, we propose a quantum-inspired classical autoencoder model which can be used to encode information in low latent spaces. The power of our proposed models is exhibited via numerical tests. We show that our targeted dimensionality reduction method considerably boosts VQC’s performance, and we also identify cases for which the second model outperforms classical autoencoders in terms of reconstruction loss.

arXiv:2409.03350•Quantum Information Processing•Jul 30, 2025•13 citations

Quantum Machine Learning: A Comparative Study of Variational Quantum Classifier with Classical Classifier Algorithms

Madona Alhalabi, Hafiz M. Asif, Hesham Alhalabi

With the advancement of quantum computing in the Noisy Intermediate-Scale Quantum (NISQ) era, hybrid quantum-classical algorithms have emerged as promising approaches for addressing certain machine learning tasks. This study investigates the Variational Quantum Classifier (VQC), a hybrid model that integrates parameterized quantum circuits with classical optimization routines, implemented via IBM’s Qiskit framework. We provide a detailed account of the VQC architecture, including feature encoding, ansatz construction, and optimization methodology. To assess its performance, we conduct a comparative analysis between VQC and classical Support Vector Classifiers (SVC) across synthetic and real-world datasets, including Iris and a binary-filtered version of MNIST. Experimental results reveal that classical models consistently achieve higher accuracy and faster training times. However, the VQC demonstrates functional viability, particularly under noise-free conditions and reduced-dimensionality settings. These findings underscore the current limitations of quantum models while highlighting the potential of VQC as a proof-of-concept for quantum-enhanced learning as quantum hardware matures.

International Symposium on Networks, Computers and Communications (ISNCC)•Oct 27, 2025•2 citations
Quantum computing has been a prominent research area for decades, inspiring transformative fields such as quantum simulation, quantum teleportation, and quantum machine learning (QML), which are undergoing rapid development. Within QML, hybrid classical-quantum algorithms like Quantum Neural Networks (QNNs) and Variational Quantum Classifiers (VQCs) have shown promise in leveraging quantum circuits and classical optimizers to classify classical data efficiently. Simultaneously, classical machine learning has made significant strides in graph classification, employing Graph Neural Networks (GNNs) to analyze systems ranging from large-scale structures like the Large Hadron Collider to molecular and biological systems like proteins and DNA. Combining the advancements in quantum computing and graph classification presents a unique opportunity to develop quantum algorithms capable of extracting features from graphs and performing their classification effectively. In this paper, we propose a novel quantum encoding framework for graph classification using VQCs. Unlike existing approaches such as PCA-VQC, which rely on dimensionality reduction techniques like Principal Component Analysis (PCA) and may lead to information loss, our method preserves the integrity of graph data. Furthermore, our encoding approach is optimized for Noise-Intermediate Scale Quantum (NISQ) devices, requiring a limited number of qubits while achieving comparable or superior classification performance to PCA-VQC. By constructing slightly more complex circuits tailored for graph encoding, we demonstrate that VQCs can effectively classify graphs within the constraints of current quantum hardware.
Quantum Machine Learning (QML) has emerged as a compelling research domain that unites quantum computing principles with classical learning theory to address computationally demanding classification problems.This paper investigates two principal QML architectures-Variational Quantum Classifiers (VQC) and Quantum Neural Networks (QNN)-within the context of binary classification.We present an end-to-end hybrid quantum-classical pipeline applied to the UCI Mushroom dataset, comprising 22 categorical attributes, and demonstrate that quantumenhanced models can achieve competitive classification performance under present-day hardware constraints.The pipeline integrates Quantum Random Access Code (QRAC) encoding for dimensionality reduction, ZZFeatureMapbased quantum feature mapping, RealAmplitudes parameterized ansatz, and classical optimizer-driven parameter updates using the COBYLA algorithm.The complete system is deployed through a Flask web interface and containerized with Docker for reproducibility.Experimental results on a quantum simulator indicate a classification accuracy of 87.4%, precision of 0.891, and recall of 0.863, establishing the practical viability of NISQ-era quantum classifiers for structured categorical data.The paper further analyzes convergence behavior, circuit depth effects, and comparative performance against classical baselines, providing insights into the strengths and limitations of current QML architectures for real-world classification deployment.
Advances in classical machine learning and single-cell technologies have paved the way for understanding interactions between disease cells and tumor microenvironments towards accelerating therapeutic discovery. However, challenges in these machine learning methods and NP-hard problems in spatial biology create an opportunity to explore quantum computing algorithms. Here, we present a hybrid quantum-classical graph neural network (GNN) that combines a classical GNN with a type of quantum neural network (QNN) called a variational quantum classifier (VQC) for classifying binary sub-tasks in breast cancer subtyping. We explore two variants of the framework, the first with fixed pretrained GNN parameters and the second with end-to-end training of GNN+VQC. The results demonstrate that the hybrid quantum-classical neural network is at par with the state-of-the-art classical graph neural networks in terms of weighted precision, recall, and F1-score at higher dimensions. We also show that by means of amplitude encoding, we can compress information in logarithmic number of qubits and attain better performance in comparison to classical compression (which leads to information loss), while keeping the number of qubits required constant in both regimes. Finally, we show some results that end-to-end training enables an improvement over fixed GNN parameters and also slightly improves over vanilla GNN with the same number of dimensions.
The study explores the integration of quantum-enhanced feature mapping and optimization within Graph Neural Networks (GNNs) for molecular classification tasks. Utilizing IBM's Qiskit platform, we implement Variational Quantum Circuits (VQCs) to transform classical molecular features into quantum states, capturing complex correlations through quantum entanglement. Additionally, the Quantum Approximate Optimization Algorithm (QAOA) is employed for hyperparameter tuning to enhance model convergence and performance. Comparative analyses against traditional machine learning models demonstrate the superiority of the quantum-enhanced GNN, highlighting the potential of quantum computing in advancing molecular property prediction.
The large-scale structure (LSS) of the Universe, characterized by the distribution of clusters, filaments, walls, and voids, encodes fundamental information about cosmology and structure formation. Standard cosmological analyses, based on abundances as well as two-point and higher-order correlation functions, have been widely used to extract information from LSS. While powerful, these techniques can only access a subset of the full information content, leaving much of the encoded structure underexploited. This motivates the use of more flexible approaches capable of learning directly from the raw, graph-like nature of the cosmic web without relying on strong compression or dimensionality reduction. Recent advances in machine learning, particularly graph neural networks (GNNs), provide a natural framework for this task by capturing the non-Euclidean connectivity of cosmic structures. Building on these developments, recent progress in quantum machine learning (QML) offers an intriguing opportunity to further enhance representation power through quantum-enhanced models. In this work, we investigate the potential of quantum graph neural networks (QGNNs) as an alternative computational framework for analyzing LSS, focusing on structure identification and classification with an emphasis on distinguishing clusters and voids. Leveraging the hybrid quantum–classical paradigm implemented in PennyLane, we construct variational quantum circuits to encode graph representations of cosmological data and compare their performance against state-of-the-art classical GNNs. Our study evaluates the accuracy and expressivity of QGNNs relative to classical models, with particular attention to their ability to capture complex correlations in sparse, high-dimensional astrophysical datasets. Preliminary results indicate that QGNNs achieve comparable classification performance, while highlighting both the opportunities and current limitations of quantum-enhanced approaches in cosmological applications.
Abstract Variational quantum circuits (VQC) lie at the forefront of quantum machine learning research. Still, the use of quantum networks for real data processing remains challenging as the number of available qubits cannot accommodate a large dimensionality of data—if the usual angle encoding scenario is used. To achieve dimensionality reduction, Principal Component Analysis is routinely applied as a pre-processing method before the embedding of the classical features on qubits. In this work, we propose an alternative method which reduces the dimensionality of a given dataset by taking into account the specific quantum embedding that comes after. This method aspires to make quantum machine learning with VQCs more versatile and effective on datasets of high dimension. At a second step, we propose a quantum-inspired classical autoencoder model which can be used to encode information in low latent spaces. The power of our proposed models is exhibited via numerical tests. We show that our targeted dimensionality reduction method considerably boosts VQC’s performance, and we also identify cases for which the second model outperforms classical autoencoders in terms of reconstruction loss.
With the advancement of quantum computing in the Noisy Intermediate-Scale Quantum (NISQ) era, hybrid quantum-classical algorithms have emerged as promising approaches for addressing certain machine learning tasks. This study investigates the Variational Quantum Classifier (VQC), a hybrid model that integrates parameterized quantum circuits with classical optimization routines, implemented via IBM’s Qiskit framework. We provide a detailed account of the VQC architecture, including feature encoding, ansatz construction, and optimization methodology. To assess its performance, we conduct a comparative analysis between VQC and classical Support Vector Classifiers (SVC) across synthetic and real-world datasets, including Iris and a binary-filtered version of MNIST. Experimental results reveal that classical models consistently achieve higher accuracy and faster training times. However, the VQC demonstrates functional viability, particularly under noise-free conditions and reduced-dimensionality settings. These findings underscore the current limitations of quantum models while highlighting the potential of VQC as a proof-of-concept for quantum-enhanced learning as quantum hardware matures.