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:1703.03693

On Quantum Decision Trees

Subhash C. Kak

Published Mar 8, 2017• 1 citation
arXivHTMLPDF

Abstract

Quantum decision systems are being increasingly considered for use in artificial intelligence applications. Classical and quantum nodes can be distinguished based on certain correlations in their states. This paper investigates some properties of the states obtained in a decision tree structure. How these correlations may be mapped to the decision tree is considered. Classical tree representations and approximations to quantum states are provided.

DOI
10.48550/arxiv.1703.03693

Related papers

Programmable quantum decision trees

Ioannis Liliopoulos, Georgios D. Varsamis, Richard P. Padbury +4 more

Recent efforts have extended decision trees into the quantum domain. However, because root and internal nodes branch into multiple successors, such approaches require duplicating node quantum states, violating the no-cloning theorem. Existing implementations therefore rely on measurements at each node, interrupting coherent quantum evolution and obscuring correlations between data and attributes. Here, we encode the entire decision tree in a tight-binding Hamiltonian and employ non-equilibrium Green's functions to compute transmission from the root to the leaf nodes. This framework enables dynamic control of the influence of individual nodes, yielding a programmable quantum decision-tree architecture.

International Journal of Parallel Emergent and Distributed Systems•Jul 25, 2026•0 citations

Quantum Machine Learning in Non-Linear Decision Trees

Jincheng Zhang

Quantum Machine Learning (QML) has emerged as a promising field, offering the potential to revolutionize various computational tasks, including machine learning. This paper investigates the application of QML to decision tree algorithms, specifically focusing on the development of a novel non-linear decision tree model designed for optimized decision-solving. We explore how quantum computation can enhance the optimization process inherent in decision tree construction, leading to improved efficiency and accuracy. The core claim is that leveraging quantum mechanics allows for automatic parameter adjustment within the decision tree, significantly increasing its effectiveness. This work introduces a framework where quantum algorithms are employed to refine the decision tree structure, addressing limitations of traditional methods. The research also investigates the potential benefits of this approach in complex decision scenarios, highlighting the advantages over conventional techniques. The paper concludes with a discussion of future research directions and the expected impact of QML on the field of decision tree learning.

•Sep 4, 2026•0 citations

Quantum computation and decision trees

Edward Farhi, Sam Gutmann

Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node $n$ level from the root. We devise a quantum-mechanical algorithm that evolves a state, initially localized at the root, through the tree. We prove that if the classical strategy succeeds in reaching level $n$ in time polynomial in $n,$ then so does the quantum algorithm. Moreover, we find examples of trees for which the classical algorithm requires time exponential in $n,$ but for which the quantum algorithm succeeds in polynomial time. The examples we have so far, however, could also be solved in polynomial time by different classical algorithms.

arXiv:quant-ph/9706062•Physical Review A•Aug 1, 1998•1,232 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

Incomplete information and quantum decision trees

Subhash C. Kak

This paper considers the problem of the absent-minded driver who must choose between alternatives with different payoff under the conditions of imperfect recall and varying degrees of knowledge of the system. We show that agents with access to quantum resources, or with a quantum mechanical basis, can obtain superior performance as compared to classical agents. The paper also considers the problem of random tree representations of quantum decision processes. It is shown that in the general case where each node can have any branching probability value, a random tree can accurately represent the probabilities associated with an arbitrary quantum state.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 1, 2017•2 citations

Quantum Decision Theory

Adam M. Brandenburger, Pierfrancesco La Mura

We argue that, contrary to conventional wisdom, decision theory is not invariant to the physical environment in which a decision is made. Specifically, we show that a decision maker (DM) with access to quantum information resources may be able to do strictly better than a DM with access only to classical information resources. In this respect, our findings are somewhat akin to those in computer science that have established the superiority of quantum over classical algorithms for certain problems. We treat three kinds of decision tree: (i) Kuhn trees ([24, 1950], [25, 1953]) in which the DM has perfect recall; (ii) Kuhn trees in which the DM has imperfect recall; and (iii) non-Kuhn trees.

•Jul 1, 2011•2 citations
Quantum decision systems are being increasingly considered for use in artificial intelligence applications. Classical and quantum nodes can be distinguished based on certain correlations in their states. This paper investigates some properties of the states obtained in a decision tree structure. How these correlations may be mapped to the decision tree is considered. Classical tree representations and approximations to quantum states are provided.
Recent efforts have extended decision trees into the quantum domain. However, because root and internal nodes branch into multiple successors, such approaches require duplicating node quantum states, violating the no-cloning theorem. Existing implementations therefore rely on measurements at each node, interrupting coherent quantum evolution and obscuring correlations between data and attributes. Here, we encode the entire decision tree in a tight-binding Hamiltonian and employ non-equilibrium Green's functions to compute transmission from the root to the leaf nodes. This framework enables dynamic control of the influence of individual nodes, yielding a programmable quantum decision-tree architecture.
Quantum Machine Learning (QML) has emerged as a promising field, offering the potential to revolutionize various computational tasks, including machine learning. This paper investigates the application of QML to decision tree algorithms, specifically focusing on the development of a novel non-linear decision tree model designed for optimized decision-solving. We explore how quantum computation can enhance the optimization process inherent in decision tree construction, leading to improved efficiency and accuracy. The core claim is that leveraging quantum mechanics allows for automatic parameter adjustment within the decision tree, significantly increasing its effectiveness. This work introduces a framework where quantum algorithms are employed to refine the decision tree structure, addressing limitations of traditional methods. The research also investigates the potential benefits of this approach in complex decision scenarios, highlighting the advantages over conventional techniques. The paper concludes with a discussion of future research directions and the expected impact of QML on the field of decision tree learning.
Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node nnn level from the root. We devise a quantum-mechanical algorithm that evolves a state, initially localized at the root, through the tree. We prove that if the classical strategy succeeds in reaching level nnn in time polynomial in n,n,n, then so does the quantum algorithm. Moreover, we find examples of trees for which the classical algorithm requires time exponential in n,n,n, but for which the quantum algorithm succeeds in polynomial time. The examples we have so far, however, could also be solved in polynomial time by different classical algorithms.
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.
This paper considers the problem of the absent-minded driver who must choose between alternatives with different payoff under the conditions of imperfect recall and varying degrees of knowledge of the system. We show that agents with access to quantum resources, or with a quantum mechanical basis, can obtain superior performance as compared to classical agents. The paper also considers the problem of random tree representations of quantum decision processes. It is shown that in the general case where each node can have any branching probability value, a random tree can accurately represent the probabilities associated with an arbitrary quantum state.
We argue that, contrary to conventional wisdom, decision theory is not invariant to the physical environment in which a decision is made. Specifically, we show that a decision maker (DM) with access to quantum information resources may be able to do strictly better than a DM with access only to classical information resources. In this respect, our findings are somewhat akin to those in computer science that have established the superiority of quantum over classical algorithms for certain problems. We treat three kinds of decision tree: (i) Kuhn trees ([24, 1950], [25, 1953]) in which the DM has perfect recall; (ii) Kuhn trees in which the DM has imperfect recall; and (iii) non-Kuhn trees.