On Quantum Decision Trees
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Efficient Quantum Agnostic Improper Learning of Decision Trees
The agnostic setting is the hardest generalization of the PAC model since it is akin to learning with adversarial noise. In this paper, we give a poly$(n,t,{\frac{1}{\varepsilon}})$ quantum algorithm for learning size $t…
Ensemble LearningRepresentation of binary classification trees with binary features by quantum circuits
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 trave…
Binary ClassificationThe Improvement of Decision Tree Construction Algorithm Based On Quantum Heuristic Algorithms
This work is related to the implementation of a decision tree construction algorithm on a quantum simulator. Here we consider an algorithm based on a binary criterion. Also, we study the improvement capability with quant…
Des-q: a quantum algorithm to provably speedup retraining of decision trees
Decision trees are widely adopted machine learning models due to their simplicity and explainability. However, as training data size grows, standard methods become increasingly slow, scaling polynomially with the number …
Binary ClassificationEfficient circuit implementation for coined quantum walks on binary trees and application to reinforcement learning
Quantum walks on binary trees are used in many quantum algorithms to achieve important speedup over classical algorithms. The formulation of this kind of algorithms as quantum circuit presents the advantage of being easi…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)