Xiaojiang Tian

Efficient Quantum Approximate kNN Algorithm via Granular-Ball Computing

High time complexity is one of the biggest challenges faced by k-Nearest Neighbors (kNN). Although current classical and quantum kNN algorithms have made some improvements, they still have a speed bottleneck when facing large amounts of data. To address this issue, we propose an innovative algorithm