Efficient Quantum Approximate $k$NN Algorithm via Granular-Ball Computing

Shuyin Xia, Xiaojiang Tian, Suzhen Yuan +1

High time complexity is one of the biggest challenges faced by $k$-Nearest Neighbors ($k$NN). Although current classical and quantum $k$NN algorithms have made some improvements, t…