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:2204.05286 · IEEE Transactions on Quantum Engineering

Expressivity of Variational Quantum Machine Learning on the Boolean Cube

Dylan Herman, Rudy Raymond, Muyuan Li, Nicolas Robles, Antonio Mezzacapo, Marco Pistoia

Published Jan 1, 2023• 14 citations
arXivHTMLPDF

Abstract

Categorical data plays an important part in machine learning research and appears in a variety of applications. Models that can express large classes of real-valued functions on the Boolean cube are useful for problems involving discrete-valued data types, including those which are not Boolean. To this date, the commonly used schemes for embedding classical data into variational quantum machine learning models encode continuous values. Here we investigate quantum embeddings for encoding Boolean-valued data into parameterized quantum circuits used for machine learning tasks. We narrow down representability conditions for functions on then-dimensional Boolean cube with respect to previously known results, using two quantum embeddings: a phase embedding and an embedding based on quantum random access codes. We show that for any real-valued function on then-dimensional Boolean cube, there exists a variational linear quantum model based on a phase embedding usingnqubits that can represent it and an ensemble of such models using$d \lt n$qubits that can express any function with degree at most d. Additionally, we prove that variational linear quantum models that use the quantum random access code embedding can express functions on the Boolean cube with degree$d \leq \lceil \frac{n}{3}\rceil$using$\lceil \frac{n}{3}\rceil$qubits, and that an ensemble of such models can represent any function on the Boolean cube with degree$d \leq \lceil \frac{n}{3}\rceil$. Furthermore, we discuss the potential benefits of each embedding and the impact of serial repetitions. Lastly, we demonstrate the use of the embeddings presented by performing numerical simulations and experiments on IBM quantum processors using the Qiskit machine learning framework.

DOI
10.1109/tqe.2023.3255206

Related papers

Trainable Discrete Feature Embeddings for Variational Quantum Classifier

Napat Thumwanit, Chayaphol Lortaraprasert, Hiroshi Yano +1 more

Quantum classifiers provide sophisticated embeddings of input data in Hilbert space promising quantum advantage. The advantage stems from quantum feature maps encoding the inputs into quantum states with variational quantum circuits. A recent work shows how to map discrete features with fewer quantum bits using Quantum Random Access Coding (QRAC), an important primitive to encode binary strings into quantum states. We propose a new method to embed discrete features with trainable quantum circuits by combining QRAC and a recently proposed strategy for training quantum feature map called quantum metric learning. We show that the proposed trainable embedding requires not only as few qubits as QRAC but also overcomes the limitations of QRAC to classify inputs whose classes are based on hard Boolean functions. We numerically demonstrate its use in variational quantum classifiers to achieve better performances in classifying real-world datasets, and thus its possibility to leverage near-term quantum computers for quantum machine learning.

arXiv:2106.09415•Jun 17, 2021•9 citations

Invited: Trainable Discrete Feature Embeddings for Quantum Machine Learning

Napat Thumwanit, Chayaphol Lortaraprasert, Rudy Raymond

Quantum classifiers provide sophisticated embeddings of input data in Hilbert space promising quantum advantage. The advantage stems from quantum feature maps encoding the inputs into quantum states with variational quantum circuits. A recent work shows how to map discrete features with fewer quantum bits using Quantum Random Access Coding (QRAC) to encode binary strings into quantum states. We propose a new method to embed discrete features with trainable quantum circuits by combining QRAC and a recently proposed strategy for training quantum feature map called quantum metric learning. The proposed trainable embedding requires not only as few qubits as QRAC but also overcomes the limitations of QRAC to classify inputs whose classes are based on hard Boolean functions. We numerically demonstrate its use in variational quantum classifiers to achieve better performances to classify real-world datasets, and thus its possibility to use near-term quantum computers for machine learning.

ACM/IEEE Design Automation Conference (DAC)•Nov 8, 2021•11 citations

Trainable Discrete Feature Embeddings for Quantum Machine Learning

Napat Thumwanit, Chayaphol Lortaraprasert, Hiroshi Yano +1 more

Quantum classifiers provide sophisticated embeddings of input data in Hilbert space promising quantum advantage. The advantage stems from quantum feature maps encoding the inputs into quantum states with variational quantum circuits. A recent work shows how to map discrete features with fewer quantum bits using Quantum Random Access Coding (QRAC), an important primitive to encode binary strings into quantum states. We propose a new method to embed discrete features with trainable quantum circuits by combining QRAC and a recently proposed strategy for training quantum feature map called quantum metric learning. We show that the proposed trainable embedding requires not only as few qubits as QRAC but also overcomes the limitations of QRAC to classify inputs whose classes are based on hard Boolean functions. We numerically demonstrate its use in variational quantum classifiers to achieve better performances in classifying real-world datasets, and thus its possibility to leverage near-term quantum computers for quantum machine learning1.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Oct 1, 2021•20 citations

Assessment of the Most Effective Approach for Feature Acquisition Utilizing Variational Quantum Classifiers for Real-World Datasets

Ravuri Mohana Ramana, S. V. N. Sreenivasu, P. E. Satyanarayana +3 more

Quantum-enhanced methods have recently attracted significant attention for addressing a wide range of machine learning problems. Many approaches exploit the hybrid resources of noisy quantum devices in combination with classical computing, particularly for supervised learning. Among these, the variational quantum classifier (VQC) offers potential quantum advantage by mapping classical data into high-dimensional quantum feature spaces that are difficult to simulate classically. While several quantum data-encoding methods have been explored, the efficient mapping of discrete attributes—such as postal codes, age groups, or categorical identifiers—has received limited attention, despite their importance in real-world classification tasks. In this work, we introduce an efficient encoding strategy based on Quantum Random Access Codes (QRACs) for embedding discrete features into compact quantum representations. QRACs enable multiple bits of information to be encoded into fewer qubits, thereby reducing resource requirements while preserving feature separability. We present several QRAC-based schemes, analyze their theoretical properties, and evaluate their performance through algebraic simulations. Empirical studies on real-world datasets, implemented on both simulators and quantum hardware, demonstrate that QRA-Cenhanced VQCs achieve faster training, reduced parameter counts, and competitive classification accuracy. These results highlight QRACs as a practical tool for advancing the applicability of quantum machine learning to structured datasets.

IEEE International Conference for Women in Computing (InCoWoCo)•Nov 14, 2025•0 citations

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

Empowering complex-valued data classification with the variational quantum classifier

Jianing Chen, Yan Li

The evolution of quantum computers has encouraged research into how to handle tasks with significant computation demands in the past few years. Due to the unique advantages of quantum parallelism and entanglement, various types of quantum machine learning (QML) methods, especially variational quantum classifiers (VQCs), have attracted the attention of many researchers and have been developed and evaluated in numerous scenarios. Nevertheless, most of the research on VQCs is still in its early stages. For instance, as a consequence of the mathematical constraints imposed by the properties of quantum states, the majority of research has not fully taken into account the impact of data formats on the performance of VQCs. In this paper, considering a significant number of data in the real world exist in the form of complex numbers, i.e., phasor data in power systems and the result of Fourier transform on image processing, we develop two categories of data encoding methods, including coupling data encoding and splitting data encoding. This paper features the coupling data encoding method to encode complex-valued data in a way of amplitude encoding. By leveraging the property of quantum states living in a complex Hilbert space, the complex-valued data is embedded into the amplitude of quantum states to comprehensively characterize complex-valued information. Optimizers will be utilized to iteratively tune a parameterized ansatz, with the aim of minimizing the value of loss functions defined with respect to the specific classification task. In addition, distinct factors in VQCs have been explored in detail to investigate the performance of VQCs, including data encoding methods, loss functions, and optimizers. The experimental result shows that the proposed data encoding method outperforms other typical encoding methods on a given classification task. Moreover, different loss functions are tested, and the capability of finding the minimum value is evaluated for gradient-free and gradient-based optimizers, which provides valuable insights and guidelines for practical implementations.

Frontiers in Quantum Science and Technology•Feb 7, 2024•6 citations
Categorical data plays an important part in machine learning research and appears in a variety of applications. Models that can express large classes of real-valued functions on the Boolean cube are useful for problems involving discrete-valued data types, including those which are not Boolean. To this date, the commonly used schemes for embedding classical data into variational quantum machine learning models encode continuous values. Here we investigate quantum embeddings for encoding Boolean-valued data into parameterized quantum circuits used for machine learning tasks. We narrow down representability conditions for functions on then-dimensional Boolean cube with respect to previously known results, using two quantum embeddings: a phase embedding and an embedding based on quantum random access codes. We show that for any real-valued function on then-dimensional Boolean cube, there exists a variational linear quantum model based on a phase embedding usingnqubits that can represent it and an ensemble of such models usingd<nd \lt nd<nqubits that can express any function with degree at most d. Additionally, we prove that variational linear quantum models that use the quantum random access code embedding can express functions on the Boolean cube with degreed≤⌈n3⌉d \leq \lceil \frac{n}{3}\rceild≤⌈3n​⌉using⌈n3⌉\lceil \frac{n}{3}\rceil⌈3n​⌉qubits, and that an ensemble of such models can represent any function on the Boolean cube with degreed≤⌈n3⌉d \leq \lceil \frac{n}{3}\rceild≤⌈3n​⌉. Furthermore, we discuss the potential benefits of each embedding and the impact of serial repetitions. Lastly, we demonstrate the use of the embeddings presented by performing numerical simulations and experiments on IBM quantum processors using the Qiskit machine learning framework.
Quantum classifiers provide sophisticated embeddings of input data in Hilbert space promising quantum advantage. The advantage stems from quantum feature maps encoding the inputs into quantum states with variational quantum circuits. A recent work shows how to map discrete features with fewer quantum bits using Quantum Random Access Coding (QRAC), an important primitive to encode binary strings into quantum states. We propose a new method to embed discrete features with trainable quantum circuits by combining QRAC and a recently proposed strategy for training quantum feature map called quantum metric learning. We show that the proposed trainable embedding requires not only as few qubits as QRAC but also overcomes the limitations of QRAC to classify inputs whose classes are based on hard Boolean functions. We numerically demonstrate its use in variational quantum classifiers to achieve better performances in classifying real-world datasets, and thus its possibility to leverage near-term quantum computers for quantum machine learning.
Quantum classifiers provide sophisticated embeddings of input data in Hilbert space promising quantum advantage. The advantage stems from quantum feature maps encoding the inputs into quantum states with variational quantum circuits. A recent work shows how to map discrete features with fewer quantum bits using Quantum Random Access Coding (QRAC) to encode binary strings into quantum states. We propose a new method to embed discrete features with trainable quantum circuits by combining QRAC and a recently proposed strategy for training quantum feature map called quantum metric learning. The proposed trainable embedding requires not only as few qubits as QRAC but also overcomes the limitations of QRAC to classify inputs whose classes are based on hard Boolean functions. We numerically demonstrate its use in variational quantum classifiers to achieve better performances to classify real-world datasets, and thus its possibility to use near-term quantum computers for machine learning.
Quantum classifiers provide sophisticated embeddings of input data in Hilbert space promising quantum advantage. The advantage stems from quantum feature maps encoding the inputs into quantum states with variational quantum circuits. A recent work shows how to map discrete features with fewer quantum bits using Quantum Random Access Coding (QRAC), an important primitive to encode binary strings into quantum states. We propose a new method to embed discrete features with trainable quantum circuits by combining QRAC and a recently proposed strategy for training quantum feature map called quantum metric learning. We show that the proposed trainable embedding requires not only as few qubits as QRAC but also overcomes the limitations of QRAC to classify inputs whose classes are based on hard Boolean functions. We numerically demonstrate its use in variational quantum classifiers to achieve better performances in classifying real-world datasets, and thus its possibility to leverage near-term quantum computers for quantum machine learning1.
Quantum-enhanced methods have recently attracted significant attention for addressing a wide range of machine learning problems. Many approaches exploit the hybrid resources of noisy quantum devices in combination with classical computing, particularly for supervised learning. Among these, the variational quantum classifier (VQC) offers potential quantum advantage by mapping classical data into high-dimensional quantum feature spaces that are difficult to simulate classically. While several quantum data-encoding methods have been explored, the efficient mapping of discrete attributes—such as postal codes, age groups, or categorical identifiers—has received limited attention, despite their importance in real-world classification tasks. In this work, we introduce an efficient encoding strategy based on Quantum Random Access Codes (QRACs) for embedding discrete features into compact quantum representations. QRACs enable multiple bits of information to be encoded into fewer qubits, thereby reducing resource requirements while preserving feature separability. We present several QRAC-based schemes, analyze their theoretical properties, and evaluate their performance through algebraic simulations. Empirical studies on real-world datasets, implemented on both simulators and quantum hardware, demonstrate that QRA-Cenhanced VQCs achieve faster training, reduced parameter counts, and competitive classification accuracy. These results highlight QRACs as a practical tool for advancing the applicability of quantum machine learning to structured datasets.
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.
The evolution of quantum computers has encouraged research into how to handle tasks with significant computation demands in the past few years. Due to the unique advantages of quantum parallelism and entanglement, various types of quantum machine learning (QML) methods, especially variational quantum classifiers (VQCs), have attracted the attention of many researchers and have been developed and evaluated in numerous scenarios. Nevertheless, most of the research on VQCs is still in its early stages. For instance, as a consequence of the mathematical constraints imposed by the properties of quantum states, the majority of research has not fully taken into account the impact of data formats on the performance of VQCs. In this paper, considering a significant number of data in the real world exist in the form of complex numbers, i.e., phasor data in power systems and the result of Fourier transform on image processing, we develop two categories of data encoding methods, including coupling data encoding and splitting data encoding. This paper features the coupling data encoding method to encode complex-valued data in a way of amplitude encoding. By leveraging the property of quantum states living in a complex Hilbert space, the complex-valued data is embedded into the amplitude of quantum states to comprehensively characterize complex-valued information. Optimizers will be utilized to iteratively tune a parameterized ansatz, with the aim of minimizing the value of loss functions defined with respect to the specific classification task. In addition, distinct factors in VQCs have been explored in detail to investigate the performance of VQCs, including data encoding methods, loss functions, and optimizers. The experimental result shows that the proposed data encoding method outperforms other typical encoding methods on a given classification task. Moreover, different loss functions are tested, and the capability of finding the minimum value is evaluated for gradient-free and gradient-based optimizers, which provides valuable insights and guidelines for practical implementations.