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

Decision-Level Confidence Explanations for Quantum Logic Decision Trees

Saeide Hajighasemi

In this paper, we propose a post-hoc confidence- aware explanation layer for Quantum Logic Decision Trees (QLDTs) in binary classification. The goal is to improve the decision-level interpretability of QLDT+ predictions without modifying the underlying decision mechanism. The proposed layer translates class-labelled QLDT+ paths into linguistic IF– THEN rules and attaches an object-level explanation score to each prediction. This score is computed as a transparent aggregation of three interpretable components: rule-path acti- vation, empirical path reliability, and the normalized distance from the QLDT+ decision threshold. The resulting value is not intended to estimate a posterior class probability; rather, it serves as an explanation-based confidence indicator for decision support. Since the layer is applied only after the QLDT+ prediction has been made, the predicted labels remain fully determined by the original CQQL evaluation score and the global threshold. Experiments on the Banknote Authentication and Diabetes datasets show that correctly classified instances receive higher average explanation confidence than incorrectly classified ones, while near-threshold cases receive lower confi- dence values. Selective-prediction, component-wise ablation, and weight-sensitivity analyses further indicate that the proposed score provides useful information about decision stability and reliability while preserving the original QLDT+ classifier.

•Jun 26, 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•13 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.
In this paper, we propose a post-hoc confidence- aware explanation layer for Quantum Logic Decision Trees (QLDTs) in binary classification. The goal is to improve the decision-level interpretability of QLDT+ predictions without modifying the underlying decision mechanism. The proposed layer translates class-labelled QLDT+ paths into linguistic IF– THEN rules and attaches an object-level explanation score to each prediction. This score is computed as a transparent aggregation of three interpretable components: rule-path acti- vation, empirical path reliability, and the normalized distance from the QLDT+ decision threshold. The resulting value is not intended to estimate a posterior class probability; rather, it serves as an explanation-based confidence indicator for decision support. Since the layer is applied only after the QLDT+ prediction has been made, the predicted labels remain fully determined by the original CQQL evaluation score and the global threshold. Experiments on the Banknote Authentication and Diabetes datasets show that correctly classified instances receive higher average explanation confidence than incorrectly classified ones, while near-threshold cases receive lower confi- dence values. Selective-prediction, component-wise ablation, and weight-sensitivity analyses further indicate that the proposed score provides useful information about decision stability and reliability while preserving the original QLDT+ classifier.