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

International Journal of Parallel Emergent and Distributed Systems

Programmable quantum decision trees

Ioannis Liliopoulos, Georgios D. Varsamis, Richard P. Padbury, Kristin L. Milchanowski, R. Martin-Cuevas, Guzmán Calleja Gutiérrez, Ioannis G. Karafyllidis

Published Jul 25, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1080/17445760.2026.2703610

Related papers

Quantum Decision Trees and Semidefinite Programming.

Howard Barnum, Michael Saks, Márió Szegedy

We reformulate the notion of quantum query complexity in terms of inequalities and equations for a set of positive matrices, which we view as a quantum analogue of a decision tree. Using the new formulation we show that: 1. every quantum query algorithm needs to use at most n quantum bits in addition to the query register. 2. For any function f there is an algorithm that runs in polynomial time in terms the truth table of f and (for {var_epsilon} > 0) computes the {var_epsilon}-error quantum decision tree complexity of f. 3. Using the dual of our system we can treat lower bound methods on a uniform platform, which paves the way to their future comparison. In particular we describe Ambainis's bound in our framework. 4. The output condition on quantum algorithms used by Ambainis and others is not sufficient for an algorithm to compute a function with {var_epsilon}-bounded error: we show the existence of algorithms whose final entanglement matrix satisfies the condition, but for which the value of f cannot be determined from a quantum measurement on the accessible part of the computer.

•Jan 1, 2001•36 citations

Simulating quantum circuits using tree tensor networks

Philipp Seitz, Ismael Medina, Esther Cruz +2 more

We develop and analyze a method for simulating quantum circuits on classical computers by representing quantum states as rooted tree tensor networks. Our algorithm first determines a suitable, fixed tree structure adapted to the expected entanglement generated by the quantum circuit. The gates are sequentially applied to the tree by absorbing single-qubit gates into leaf nodes, and splitting two-qubit gates via singular value decomposition and threading the resulting virtual bond through the tree. We theoretically analyze the applicability of the method as well as its computational cost and memory requirements, and identify advantageous scenarios in terms of required bond dimensions as compared to a matrix product state representation. The study is complemented by numerical experiments for different quantum circuit layouts up to 37 qubits.

arXiv:2206.01000•Quantum•Mar 30, 2023•37 citations

QLDT+: Efficient Construction of a Quantum Logic Decision Tree

Ingo Schmitt

The quantum-logic inspired decision tree (QLDT) is based on quantum logic concepts and input values from the unit interval whereas the traditional decision tree is based on Boolean values. The logic behind the QLDT obeys the rules of a Boolean algebra. The QLDT is appropriate for classification problems where for a class decision several input values interact gradually with each other. The QLDT construction for a classification problem with n input attributes requires the computation of 2n minterms. The QLDT+ method, however, uses a heuristic for obtaining a QLDT with much smaller computational complexity. As result, the QLDT+ method can be applied to classification problems with a higher number of input attributes.

International Conference on Machine Learning Technologies (ICMLT)•Mar 10, 2023•5 citations

Quantum Logic Network for Probabilistic Cloning Quantum States

Gao Ting, Yan Feng-Li, Zhi‐Xi Wang

We construct efficient quantum logic network for probabilistic cloning the quantum states used in implemented tasks for which cloning provides some enhancement in performance.

arXiv:quant-ph/0308036•Communications in Theoretical Physics•Jan 1, 2005•7 citations

Computer-assisted proof of lower bounds on the randomized query complexity of certain read-once threshold functions

Nikos Leonardos

Abstract: In this work we prove lower bounds on the randomized decision tree complexity of several read-once threshold functions. A read-once threshold formula can be defined by a rooted tree, in which every internal node is labeled by a threshold function (with output 1 only when at least out of input bits are 1) and each leaf by a variable. We consider the randomized decision tree complexity of such functions, when the underlying tree is a uniform and balanced tree with all its internal nodes labeled by the same threshold function. We prove lower bounds of the form , where is the depth of the tree, for certain values of and. The value of each parameter depends on the solution of a linear program, which is provided by computational methods. Keywords: Decision trees, query complexity, randomized computation, lower bounds, read-once functions. Title: Computer-assisted proof of lower bounds on the randomized query complexity of certain read-once threshold functions Author: Nikos Leonardos International Journal of Recent Research in Mathematics Computer Science and Information Technology ISSN 2350-1022 Vol. 9, Issue 2, October 2022 - March 2023 Page No: 11-17 Paper Publications Website: www.paperpublications.org Published Date: 10-December-2022 DOI: https://doi.org/10.5281/zenodo.7421269 Paper Download Link (Source) https://www.paperpublications.org/upload/book/Computer-assisted%20proof%20of%20lower-10122022-1.pdf

•Dec 10, 2022•0 citations

Molecular realization of a quantum NAND tree

Phillip W K Jensen, Chengjun Jin, Pierre-Luc Dallaire-Demers +2 more

Abstract The negative- AND ( NAND ) gate is universal for classical computation making it an important target for development. A seminal quantum computing algorithm by Farhi, Goldstone and Gutmann has demonstrated its realization by means of quantum scattering yielding a quantum algorithm that evaluates the output faster than any classical algorithm. Here, we derive the NAND outputs analytically from scattering theory using a tight-binding (TB) model and show the restrictions on the TB parameters in order to still maintain the NAND gate function. We map the quantum NAND tree onto a conjugated molecular system, and compare the NAND output with non-equilibrium Green’s function transport calculations using density functional theory and TB Hamiltonians for the electronic structure. Further, we extend our molecular platform to show other classical gates that can be realized for quantum computing by scattering on graphs.

arXiv:1806.10682•Quantum Science and Technology•Nov 20, 2018•9 citations
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.
We reformulate the notion of quantum query complexity in terms of inequalities and equations for a set of positive matrices, which we view as a quantum analogue of a decision tree. Using the new formulation we show that: 1. every quantum query algorithm needs to use at most n quantum bits in addition to the query register. 2. For any function f there is an algorithm that runs in polynomial time in terms the truth table of f and (for {var_epsilon} > 0) computes the {var_epsilon}-error quantum decision tree complexity of f. 3. Using the dual of our system we can treat lower bound methods on a uniform platform, which paves the way to their future comparison. In particular we describe Ambainis's bound in our framework. 4. The output condition on quantum algorithms used by Ambainis and others is not sufficient for an algorithm to compute a function with {var_epsilon}-bounded error: we show the existence of algorithms whose final entanglement matrix satisfies the condition, but for which the value of f cannot be determined from a quantum measurement on the accessible part of the computer.
We develop and analyze a method for simulating quantum circuits on classical computers by representing quantum states as rooted tree tensor networks. Our algorithm first determines a suitable, fixed tree structure adapted to the expected entanglement generated by the quantum circuit. The gates are sequentially applied to the tree by absorbing single-qubit gates into leaf nodes, and splitting two-qubit gates via singular value decomposition and threading the resulting virtual bond through the tree. We theoretically analyze the applicability of the method as well as its computational cost and memory requirements, and identify advantageous scenarios in terms of required bond dimensions as compared to a matrix product state representation. The study is complemented by numerical experiments for different quantum circuit layouts up to 37 qubits.
The quantum-logic inspired decision tree (QLDT) is based on quantum logic concepts and input values from the unit interval whereas the traditional decision tree is based on Boolean values. The logic behind the QLDT obeys the rules of a Boolean algebra. The QLDT is appropriate for classification problems where for a class decision several input values interact gradually with each other. The QLDT construction for a classification problem with n input attributes requires the computation of 2n minterms. The QLDT+ method, however, uses a heuristic for obtaining a QLDT with much smaller computational complexity. As result, the QLDT+ method can be applied to classification problems with a higher number of input attributes.
Abstract: In this work we prove lower bounds on the randomized decision tree complexity of several read-once threshold functions. A read-once threshold formula can be defined by a rooted tree, in which every internal node is labeled by a threshold function (with output 1 only when at least out of input bits are 1) and each leaf by a variable. We consider the randomized decision tree complexity of such functions, when the underlying tree is a uniform and balanced tree with all its internal nodes labeled by the same threshold function. We prove lower bounds of the form , where is the depth of the tree, for certain values of and. The value of each parameter depends on the solution of a linear program, which is provided by computational methods. Keywords: Decision trees, query complexity, randomized computation, lower bounds, read-once functions. Title: Computer-assisted proof of lower bounds on the randomized query complexity of certain read-once threshold functions Author: Nikos Leonardos International Journal of Recent Research in Mathematics Computer Science and Information Technology ISSN 2350-1022 Vol. 9, Issue 2, October 2022 - March 2023 Page No: 11-17 Paper Publications Website: www.paperpublications.org Published Date: 10-December-2022 DOI: https://doi.org/10.5281/zenodo.7421269 Paper Download Link (Source) https://www.paperpublications.org/upload/book/Computer-assisted%20proof%20of%20lower-10122022-1.pdf
Abstract The negative- AND ( NAND ) gate is universal for classical computation making it an important target for development. A seminal quantum computing algorithm by Farhi, Goldstone and Gutmann has demonstrated its realization by means of quantum scattering yielding a quantum algorithm that evaluates the output faster than any classical algorithm. Here, we derive the NAND outputs analytically from scattering theory using a tight-binding (TB) model and show the restrictions on the TB parameters in order to still maintain the NAND gate function. We map the quantum NAND tree onto a conjugated molecular system, and compare the NAND output with non-equilibrium Green’s function transport calculations using density functional theory and TB Hamiltonians for the electronic structure. Further, we extend our molecular platform to show other classical gates that can be realized for quantum computing by scattering on graphs.