Search Algorithm Based on Permutation Group by Quantum Walk on Hypergraphes

Jiang, Yao-Yao; Chu, Peng-Cheng; Ma, Yun; Ma, Hongyang

doi:10.1049/cje.2021.00.125

Cited by 1 publication

(1 citation statement)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Contrarily, quantum information processing [20]has advanced significantly in recent years. A natural generalization of classical information is quantum information [21][22][23][24][25][26][27]. It is the most precise and comprehensive quantum mechanical account in the world.…”

Section: Introductionmentioning

confidence: 99%

RETRACTED: Cost-sensitive classification algorithm combining the Bayesian algorithm and quantum decision tree

Ji,

Bao,

et al. 2023

Front. Phys.

View full text Add to dashboard Cite

This study highlights the drawbacks of current quantum classifiers that limit their efficiency and data processing capabilities in big data environments. The paper proposes a global decision tree paradigm to address these issues, focusing on designing a complete quantum decision tree classification algorithm that is accurate and efficient while also considering classification costs. The proposed method integrates the Bayesian algorithm and the quantum decision tree classification algorithm to handle incremental data. The proposed approach generates a suitable decision tree dynamically based on data objects and cost constraints. To handle incremental data, the Bayesian algorithm and quantum decision tree classification algorithm are integrated, and kernel functions obtained from quantum kernel estimation are added to a linear quantum support vector machine to construct a decision tree classifier using decision directed acyclic networks of quantum support vector machine nodes (QKE). The experimental findings demonstrate the effectiveness and adaptability of the suggested quantum classification technique. In terms of classification accuracy, speed, and practical application impact, the proposed classification approach outperforms the competition, with an accuracy difference from conventional classification algorithms being less than 1%. With improved accuracy and reduced expense as the incremental data increases, the efficiency of the suggested algorithm for incremental data classification is comparable to previous quantum classification algorithms. The proposed global decision tree paradigm addresses the critical issues that need to be resolved by quantum classification methods, such as the inability to process incremental data and the failure to take the cost of categorization into account. By integrating the Bayesian algorithm and the quantum decision tree classification algorithm and using QKE, the proposed method achieves high accuracy and efficiency while maintaining high performance when processing incremental sequences and considering classification costs. Overall, the theoretical and experimental findings demonstrate the effectiveness of the suggested quantum classification technique, which offers a promising solution for handling big data classification tasks that require high accuracy and efficiency.

show abstract