Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
September 20, 2025

Efficient Quantum Approximate kNN Algorithm via Granular-Ball Computing

View Full Paper
Ask AI
Bookmark
Share

Authors

SXShuyin XiaXTXiaohua TianSYSuzhen Yuan

Discussion

Loading...

Member takes

Overview

Proposed Granular-Ball based Quantum kNN dramatically reduces time complexity via HNSW, achieving higher efficiency.

Key Points

  • The proposed GB-QkNN algorithm significantly reduces time complexity in kNN applications, enhancing efficiency.
  • By employing granular-balls and optimizing HNSW, it effectively minimizes data size needed for processing.
  • A comprehensive complexity analysis illustrates the effectiveness of the proposed treatments on kNN-like algorithms.
  • The algorithm's innovation lies in the combination of granular-balls and quantization, leading to improved performance.

Cite This Study

Xia et al. (2025) studied this question.

synapsesocial.com/papers/68d469d631b076d99fa671d6https://doi.org/10.24963/ijcai.2025/739
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Quantum granular-ball generation methods and their application in KNN classification2025 · 1 citations
  2. 2A quantum k-nearest neighbors algorithm based on the Euclidean distance estimation2024 · 38 citations
  3. 3QKNN: Noise‐Resilient Quantum KNN Algorithm for High‐Accuracy Classification2026 · 1 citations
  4. 4Quantum K-Nearest Neighbors: Utilizing QRAM and SWAP-Test Techniques for Enhanced Performance2024 · 11 citations
  5. 5Benchmarking quantum versions of the kNN algorithm with a metric based on amplitude-encoded features2024 · 1 citations