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:2108.13207 · Quantum

Representation of binary classification trees with binary features by quantum circuits

Raoul Heese, Patricia Bickert, Astrid Elisa Niederle

Published Mar 30, 2022• 23 citations
arXivHTMLPDF

Abstract

We propose a quantum representation of binary classification trees with binary features based on a probabilistic approach. By using the quantum computer as a processor for probability distributions, a probabilistic traversal of the decision tree can be realized via measurements of a quantum circuit. We describe how tree inductions and the prediction of class labels of query data can be integrated into this framework. An on-demand sampling method enables predictions with a constant number of classical memory slots, independent of the tree depth. We experimentally study our approach using both a quantum computing simulator and actual IBM quantum hardware. To our knowledge, this is the first realization of a decision tree classifier on a quantum device.

DOI
10.22331/q-2022-03-30-676

Related papers

Towards the implementation of a quantum classifier

Lorenzo Confalonieri

In this work, we investigate the use of a quantum circuit as a binary classification model in the context of quantum machine learning. We call this model, binary quantum classifier. First, we describe fundamental concepts of quantum computing and introduce the computational tool used: Qibo, an open-source framework for efficient quantum simulations and quantum hardware control. Then, we describe how to design a binary quantum classifier for the classification of images and small arrays of variables by showing how to input data in the circuit, defining a quantum circuit model Ansatz with trainable parameters and a loss function, and implementing multiple minimizers. We test our quantum classifier with two data sets. The first one is the MNIST data set which is composed of handwritten digits (reduced to only handwritten zeros and handwritten ones for binary classification). We study the behavior of different minimizers by increasing the number of layers of the Ansatz. The second data set represents two different high energy collisions that can occur at colliders such as LHC (CERN). Due to in-time proton-proton interactions known as pile-up, we distinguish two different data sets: "without pile-up" and "with pile-up". These collisions can be represented by images of size 32x32 or by six high-level variables that we call features. By increasing the size of the training data set and the number of layers of the Ansatz, we search for the best minimizer. Splitting the data set in training set and test set, we compute: ROC curve, AUC score, confusion matrices and test set accuracy. For "with pile-up" images, we compare the results obtained with the quantum classifier with a small convolutional neural network. We conclude that is possible to build a binary quantum classifier with a quantum circuit and we highlight its performances and limitations in comparison with classical technologies.

quant-pharXiv:2606.10150•Jun 10, 2026•0 citations

Tree-tensor-network classifiers for machine learning: From quantum inspired to quantum assisted

Michael L. Wall, Giuseppe D’Aguanno

We describe a quantum-assisted machine learning method in which multivariate data are encoded into quantum states in a Hilbert space whose dimension is exponentially large in the length of the data vector. Learning in this space occurs through applying a low-depth quantum circuit with a tree-tensor-network (TTN) topology acting as an unsupervised feature extractor to identify the most relevant quantum states in a data-driven fashion and then applying a supervised linear classifier encoding the class decision in a small-dimensional quantum register. We present tools for making TTN classifiers amenable to implementation on gate-based quantum computing devices, including an embedding map with accuracy similar to the recently defined exponential machines (A. Novikov et al., arXiv:1605.03795) but which produces valid quantum state embeddings of classical data vectors, and the use of manifold-based gradient optimization schemes to produce isometric operations mapping quantum states to a register of qubits defining a class decision. We detail methods for efficiently obtaining one-point and two-point correlation functions of the vectors defining the decision boundary of the quantum model, which can be used for model interpretability, as well as methods for obtaining classification decisions from partial data vectors. Further, we show that the use of isometric tensors can significantly aid in the human interpretability of the correlation functions extracted from the decision weights and may produce models that are less susceptible to adversarial perturbations. Finally, we discuss in detail the problem of compiling classically optimized isometric TTN models into unitary operations to be run on quantum computers and how isometric models requiring postselection on quantum hardware can be used to precondition variational Ans\"atze for models without postselection. We demonstrate our methodologies in applications utilizing the MNIST database of handwritten digits and a multivariate time-series data set of human activity recognition.

arXiv:2104.02249•Physical Review A•Oct 7, 2021•38 citations

Binary classification of single qubits using quantum machine learning method

Teng Yi, Jie Wang, Fufang Xu

Abstract Machine learning can make predictions on unseen data by extracting information and constructing algorithms and statistical models from the training data, which is highly desirable for speech recognition and computer vision. Quantum computing harnesses the phenomena of quantum mechanics realizing parallel computing, which could solve certain computational problems, such as RSA encryption significantly faster than classical computers. Quantum machine learning is reasonable to enable machine learning faster than that of classical computers by utilizing quantum operations. Binary classification is a typical quantum machine learning task applied to single qubits. Here we present a binary classifier for regions. Firstly, we sample two sets of quantum data points located in the X-Z plane of the Bloch sphere randomly. Then we utilize a single parameterized rotation gate and measure the qubits along the Z axis. We train the hybrid model combined by quantum mdoel and classical Neutral network and regard the corss entropy the predictions of the classical Netural network and labels as the loss function. Based on the above, we present the results of the trained hybrid model to classify new quantum qubits.

Journal of Physics Conference Series•Aug 1, 2021•3 citations

Divide et impera: hybrid multinomial classifiers from quantum binary models

Simone Roncallo, Angela Rosy Morgillo, Seth Lloyd +2 more

We investigate how to combine a collection of quantum binary models into a multinomial classifier. We employ a hybrid approach, adopting strategies like one-vs-one, one-vs-rest and a binary decision tree. We benchmark each method, by emphasizing their computational overhead and their impact on the quantum advantage. By comparison against a classical binary model (generalized using the same approach), we show that the decision tree represents a cost-effective solution, achieving similar accuracies to other methods with an overhead at most logarithmic in the total number of classes.

quant-pharXiv:2604.08094•Apr 10, 2026•1 citation

Light-Weight Quantum Binary Image Classifier

Marius Nagy

Machine learning is a powerful tool which, when given the availability of comprehensive datasets, required training iterations and the necessary resources to support them, can achieve impressive results in a variety of classification tasks. In this paper, we put forward a quantum alternative for users that do not posses the ability to gather and store large amounts of data to be used subsequently in lengthy training iterations. A light-weight probabilistic quantum binary classifier can be built by encoding the two chosen class representatives (images) into quantum vectors, such that a Principal Component decomposition can express the differences between them only along one dimension (basis vector). A standard measurement in the computational basis will then project any transformed input sample along one of the two classes. The classifier accepts quantum representations of images as input, which require exponentially fewer number of quantum bits compared with the number of classical bits used to store an image. The technique is illustrated on a "proof of concept" example, in which a quantum character recognizer is built to label any input sample image as either letter {\bf A} or {\bf P}. The quantum classifier can be tuned to "favor" any of the two classes and the measurement probabilities follow closely how far an input sample is from the two class representatives. Despite its relative simplicity, the quantum classifier can distinguish between the standard letter {\bf A} and the standard letter {\bf P} with $98\%$ accuracy. In principle, the procedure can be applied to any image classification task, including gray-scale and color images, as well as classification problems in which an input sample is characterized by a collection of properties given by their values.

•Feb 3, 2026•0 citations

Kvantti puudiagrammit

Oskari Luukkonen

Quantum computers and machine learning are on the forefront of research in both science and engineering. Quantum computers offer significant computational speed-ups in certain tasks. Machine learning on the other hand requires a lot of computational power and is heavily used by both governments and businesses. Thus it is no wonder that the possibility of leveraging the computational efficiency of quantum computers for machine learning tasks is attractive. This thesis focuses on decision trees models, due to their interpretability and wide use cases. This thesis tries to answer the question, how can quantum technology be leveraged to improve the performance and construction of decision trees. The thesis will explore the full implementation of decision trees in quantum circuits as quantum decision trees and their viability in modern hardware and its future relevance. Quantum algorithms for construction and retraining of classical decision trees will also be explored and compared to classical methods. The work found that quantum decision trees show comparable performance to classical decision trees when applied to simple data sets. However, due to hardware limitations quantum decision trees suffer when applied to more complex data sets. Quantum algorithms for tree construction show significant theoretical speed-ups at larger models when compared to classical methods of tree construction.

•May 11, 2026•0 citations
We propose a quantum representation of binary classification trees with binary features based on a probabilistic approach. By using the quantum computer as a processor for probability distributions, a probabilistic traversal of the decision tree can be realized via measurements of a quantum circuit. We describe how tree inductions and the prediction of class labels of query data can be integrated into this framework. An on-demand sampling method enables predictions with a constant number of classical memory slots, independent of the tree depth. We experimentally study our approach using both a quantum computing simulator and actual IBM quantum hardware. To our knowledge, this is the first realization of a decision tree classifier on a quantum device.
In this work, we investigate the use of a quantum circuit as a binary classification model in the context of quantum machine learning. We call this model, binary quantum classifier. First, we describe fundamental concepts of quantum computing and introduce the computational tool used: Qibo, an open-source framework for efficient quantum simulations and quantum hardware control. Then, we describe how to design a binary quantum classifier for the classification of images and small arrays of variables by showing how to input data in the circuit, defining a quantum circuit model Ansatz with trainable parameters and a loss function, and implementing multiple minimizers. We test our quantum classifier with two data sets. The first one is the MNIST data set which is composed of handwritten digits (reduced to only handwritten zeros and handwritten ones for binary classification). We study the behavior of different minimizers by increasing the number of layers of the Ansatz. The second data set represents two different high energy collisions that can occur at colliders such as LHC (CERN). Due to in-time proton-proton interactions known as pile-up, we distinguish two different data sets: "without pile-up" and "with pile-up". These collisions can be represented by images of size 32x32 or by six high-level variables that we call features. By increasing the size of the training data set and the number of layers of the Ansatz, we search for the best minimizer. Splitting the data set in training set and test set, we compute: ROC curve, AUC score, confusion matrices and test set accuracy. For "with pile-up" images, we compare the results obtained with the quantum classifier with a small convolutional neural network. We conclude that is possible to build a binary quantum classifier with a quantum circuit and we highlight its performances and limitations in comparison with classical technologies.
We describe a quantum-assisted machine learning method in which multivariate data are encoded into quantum states in a Hilbert space whose dimension is exponentially large in the length of the data vector. Learning in this space occurs through applying a low-depth quantum circuit with a tree-tensor-network (TTN) topology acting as an unsupervised feature extractor to identify the most relevant quantum states in a data-driven fashion and then applying a supervised linear classifier encoding the class decision in a small-dimensional quantum register. We present tools for making TTN classifiers amenable to implementation on gate-based quantum computing devices, including an embedding map with accuracy similar to the recently defined exponential machines (A. Novikov et al., arXiv:1605.03795) but which produces valid quantum state embeddings of classical data vectors, and the use of manifold-based gradient optimization schemes to produce isometric operations mapping quantum states to a register of qubits defining a class decision. We detail methods for efficiently obtaining one-point and two-point correlation functions of the vectors defining the decision boundary of the quantum model, which can be used for model interpretability, as well as methods for obtaining classification decisions from partial data vectors. Further, we show that the use of isometric tensors can significantly aid in the human interpretability of the correlation functions extracted from the decision weights and may produce models that are less susceptible to adversarial perturbations. Finally, we discuss in detail the problem of compiling classically optimized isometric TTN models into unitary operations to be run on quantum computers and how isometric models requiring postselection on quantum hardware can be used to precondition variational Ans\"atze for models without postselection. We demonstrate our methodologies in applications utilizing the MNIST database of handwritten digits and a multivariate time-series data set of human activity recognition.
Abstract Machine learning can make predictions on unseen data by extracting information and constructing algorithms and statistical models from the training data, which is highly desirable for speech recognition and computer vision. Quantum computing harnesses the phenomena of quantum mechanics realizing parallel computing, which could solve certain computational problems, such as RSA encryption significantly faster than classical computers. Quantum machine learning is reasonable to enable machine learning faster than that of classical computers by utilizing quantum operations. Binary classification is a typical quantum machine learning task applied to single qubits. Here we present a binary classifier for regions. Firstly, we sample two sets of quantum data points located in the X-Z plane of the Bloch sphere randomly. Then we utilize a single parameterized rotation gate and measure the qubits along the Z axis. We train the hybrid model combined by quantum mdoel and classical Neutral network and regard the corss entropy the predictions of the classical Netural network and labels as the loss function. Based on the above, we present the results of the trained hybrid model to classify new quantum qubits.
We investigate how to combine a collection of quantum binary models into a multinomial classifier. We employ a hybrid approach, adopting strategies like one-vs-one, one-vs-rest and a binary decision tree. We benchmark each method, by emphasizing their computational overhead and their impact on the quantum advantage. By comparison against a classical binary model (generalized using the same approach), we show that the decision tree represents a cost-effective solution, achieving similar accuracies to other methods with an overhead at most logarithmic in the total number of classes.
Machine learning is a powerful tool which, when given the availability of comprehensive datasets, required training iterations and the necessary resources to support them, can achieve impressive results in a variety of classification tasks. In this paper, we put forward a quantum alternative for users that do not posses the ability to gather and store large amounts of data to be used subsequently in lengthy training iterations. A light-weight probabilistic quantum binary classifier can be built by encoding the two chosen class representatives (images) into quantum vectors, such that a Principal Component decomposition can express the differences between them only along one dimension (basis vector). A standard measurement in the computational basis will then project any transformed input sample along one of the two classes. The classifier accepts quantum representations of images as input, which require exponentially fewer number of quantum bits compared with the number of classical bits used to store an image. The technique is illustrated on a "proof of concept" example, in which a quantum character recognizer is built to label any input sample image as either letter {\bf A} or {\bf P}. The quantum classifier can be tuned to "favor" any of the two classes and the measurement probabilities follow closely how far an input sample is from the two class representatives. Despite its relative simplicity, the quantum classifier can distinguish between the standard letter {\bf A} and the standard letter {\bf P} with 98%98\%98% accuracy. In principle, the procedure can be applied to any image classification task, including gray-scale and color images, as well as classification problems in which an input sample is characterized by a collection of properties given by their values.
Quantum computers and machine learning are on the forefront of research in both science and engineering. Quantum computers offer significant computational speed-ups in certain tasks. Machine learning on the other hand requires a lot of computational power and is heavily used by both governments and businesses. Thus it is no wonder that the possibility of leveraging the computational efficiency of quantum computers for machine learning tasks is attractive. This thesis focuses on decision trees models, due to their interpretability and wide use cases. This thesis tries to answer the question, how can quantum technology be leveraged to improve the performance and construction of decision trees. The thesis will explore the full implementation of decision trees in quantum circuits as quantum decision trees and their viability in modern hardware and its future relevance. Quantum algorithms for construction and retraining of classical decision trees will also be explored and compared to classical methods. The work found that quantum decision trees show comparable performance to classical decision trees when applied to simple data sets. However, due to hardware limitations quantum decision trees suffer when applied to more complex data sets. Quantum algorithms for tree construction show significant theoretical speed-ups at larger models when compared to classical methods of tree construction.