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

Fuzzy Quantum Logic Decision Trees (F-QLDT) for Interpretable Classification Fuzzy Quantum Logic Decision Trees (F-QLDT) for Interpretable Classification

Saeide Hajighasemi

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.13140/rg.2.2.17894.08009

Related papers

BBQ-Tree – A Decision Tree with Boolean and Quantum Logic Decisions

Alexander Stahl, Ingo Schmitt

Lecture notes in computer science•Jan 1, 2024•1 citation

FQ-SHAP: Fuzzy Logic Enhanced Explainability for Quantum Circuits An Extension of Q-SHAP via Fuzzy Gate Classification, Importance-Weighted Consistency, and Entanglement-Aware Pruning

Abraham Itzhak Weinberg

•Jan 1, 2026•0 citations

FQ-SHAP: Fuzzy Logic Enhanced Explainability for Quantum Circuits An Extension of Q-SHAP via Fuzzy Gate Classification, Importance-Weighted Consistency, and Entanglement-Aware Pruning

Abraham Itzhak Weinberg

•Jan 1, 2026•0 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

A Post-Hoc Explanation Layer for Quantum Logic Decision Trees Constructed with QLDT+

Saeide Hajighasemi

We propose a post-hoc explanation layer for binary Quantum Logic Decision Tree classifiers constructed with QLDT+. The layer does not modify the fitted tree, the decision threshold, or the predicted label. It translates the class-labelled QLDT+ paths into IF–THEN rules and attaches an explanation-based confidence score to each prediction. This score is the equal-weight average of three quantities: rule support, the activation mass of the contributing rules of the predicted class; path reliability, a class-specific reliability derived from the training evidence ratio; and the normalized distance of the QLDT+ score from the decision threshold. In a stratified 5-fold cross-validation on the Banknote and Diabetes datasets, which was repeated with ten random seeds, correct predictions received a higher mean score than incorrect ones in every run (mean difference 0.18 and 0.14), and near-threshold decisions received lower scores. In selective prediction, the error decreased as coverage decreased; on Diabetes, however, the decisions retained at 40% coverage or less were all predicted as class 0. The layer is therefore best read as a decomposable explanation of a fixed QLDT+ decision rather than as a calibrated probability or an optimized selective-prediction score.

Inventions•Oct 21, 2026•0 citations

Fuzzy quantum machine learning (FQML) logic for optimized disease prediction

Rabia Khushal, Ubaida Fatima

Computers in Biology and Medicine•May 8, 2025•19 citations
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.
We propose a post-hoc explanation layer for binary Quantum Logic Decision Tree classifiers constructed with QLDT+. The layer does not modify the fitted tree, the decision threshold, or the predicted label. It translates the class-labelled QLDT+ paths into IF–THEN rules and attaches an explanation-based confidence score to each prediction. This score is the equal-weight average of three quantities: rule support, the activation mass of the contributing rules of the predicted class; path reliability, a class-specific reliability derived from the training evidence ratio; and the normalized distance of the QLDT+ score from the decision threshold. In a stratified 5-fold cross-validation on the Banknote and Diabetes datasets, which was repeated with ten random seeds, correct predictions received a higher mean score than incorrect ones in every run (mean difference 0.18 and 0.14), and near-threshold decisions received lower scores. In selective prediction, the error decreased as coverage decreased; on Diabetes, however, the decisions retained at 40% coverage or less were all predicted as class 0. The layer is therefore best read as a decomposable explanation of a fixed QLDT+ decision rather than as a calibrated probability or an optimized selective-prediction score.