{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T16:13:42Z","timestamp":1776874422586,"version":"3.51.2"},"reference-count":39,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T00:00:00Z","timestamp":1673136000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Major Science and Technology Projects in Henan Province, China","award":["221100210600"],"award-info":[{"award-number":["221100210600"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The K-nearest neighbor (KNN) algorithm is one of the most extensively used classification algorithms, while its high time complexity limits its performance in the era of big data. The quantum K-nearest neighbor (QKNN) algorithm can handle the above problem with satisfactory efficiency; however, its accuracy is sacrificed when directly applying the traditional similarity measure based on Euclidean distance. Inspired by the Polar coordinate system and the quantum property, this work proposes a new similarity measure to replace the Euclidean distance, which is defined as Polar distance. Polar distance considers both angular and module length information, introducing a weight parameter adjusted to the specific application data. To validate the efficiency of Polar distance, we conducted various experiments using several typical datasets. For the conventional KNN algorithm, the accuracy performance is comparable when using Polar distance for similarity measurement, while for the QKNN algorithm, it significantly outperforms the Euclidean distance in terms of classification accuracy. Furthermore, the Polar distance shows scalability and robustness superior to the Euclidean distance, providing an opportunity for the large-scale application of QKNN in practice.<\/jats:p>","DOI":"10.3390\/e25010127","type":"journal-article","created":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T02:09:39Z","timestamp":1673230179000},"page":"127","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":49,"title":["An Enhanced Quantum K-Nearest Neighbor Classification Algorithm Based on Polar Distance"],"prefix":"10.3390","volume":"25","author":[{"given":"Congcong","family":"Feng","sequence":"first","affiliation":[{"name":"School of Cyber Science and Engineering, Zhengzhou University, Zhengzhou 450002, China"},{"name":"State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou 450001, China"}]},{"given":"Bo","family":"Zhao","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou 450001, China"},{"name":"Songshan Laboratory, Zhengzhou 450001, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0231-2895","authenticated-orcid":false,"given":"Xin","family":"Zhou","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou 450001, China"}]},{"given":"Xiaodong","family":"Ding","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou 450001, China"}]},{"given":"Zheng","family":"Shan","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou 450001, China"},{"name":"Songshan Laboratory, Zhengzhou 450001, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,1,8]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Lin, T.-Y., Dlloar, P., Girshick, R., He, K., Hariharan, B., and Belongie, S. (2017, January 21\u201326). Feature pyramid networks for object detection. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Honolulu, HI, USA.","DOI":"10.1109\/CVPR.2017.106"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1109\/TPAMI.2016.2577031","article-title":"Faster R-CNN: Towards real-time object detection with region proposal networks","volume":"39","author":"Ren","year":"2016","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"He, K., Gkioxari, G., Doll\u00e1r, P., and Girshick, R. (2017, January 22\u201329). Mask R-CNN. Proceedings of the IEEE International Conference on Computer Vision, Venice, Italy.","DOI":"10.1109\/ICCV.2017.322"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Ronneberger, O., Fischer, P., and Brox, T. (2015). U-net: Convolutional networks for biomedical image segmentation. Medical Image Computing and Computer-Assisted Intervention, Springer.","DOI":"10.1007\/978-3-319-24574-4_28"},{"key":"ref_5","first-page":"1097","article-title":"Imagenet classification with deep convolutional neural networks","volume":"6","author":"Krizhevsky","year":"2012","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., and Sun, J. (2016, January 27\u201330). Deep residual learning for image recognition. Proceedings of the IEEE Conference on Computer Vision and Pattern, Las Vegas, NV, USA.","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref_7","unstructured":"Simonyan, K., and Zisserman, A. (2015, January 7\u20139). Very deep convolutional networks for large scale image recognition. Proceedings of the International Conference on Learning Representations, San Diego, NV, USA."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Szegedy, C., Vanhoucke, V., Ioffe, S., Shlens, J., and Wojna, Z. (2016, January 27\u201330). Rethinking the inception architecture for computer vision. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Las Vegas, NV, USA.","DOI":"10.1109\/CVPR.2016.308"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1109\/MCI.2018.2840738","article-title":"Recent trends in deep learning based natural language processing","volume":"13","author":"Young","year":"2018","journal-title":"IEEE Comput. Intell. Mag."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Sak, H., Senior, A.W., and Beaufays, F. (2014, January 14\u201318). Long short-term memory recurrent neural network architectures for large scale acoustic moduleling. Proceedings of the Fifteenth Annual Conference of the International Speech Communication Association, Singapore.","DOI":"10.21437\/Interspeech.2014-80"},{"key":"ref_11","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Lukasz, K., and Polosukhin, I. (2017, January 4\u20139). Attention is all you need. Proceedings of the 30th Annual Conference on Neural Information Processing Systems, Long Beach, CA, USA."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996, January 22\u201324). A fast quantum mechanical algorithm for database search. Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, STOC \u201996, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237866"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","article-title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","volume":"41","author":"Shor","year":"1999","journal-title":"SIAM Rev."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"150502","DOI":"10.1103\/PhysRevLett.103.150502","article-title":"Quantum algorithm for linear systems of equations","volume":"103","author":"Harrow","year":"2009","journal-title":"Phys. Rev. Lett."},{"key":"ref_15","unstructured":"Jordan, S. (2022, May 01). The Quantum Algorithm Zoo, Available online: http:\/\/math.nist.gov\/quantum\/zoo\/."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1038\/s41586-019-0980-2","article-title":"Supervised learning with quantum-enhanced feature spaces","volume":"567","author":"Temme","year":"2019","journal-title":"Nature"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1038\/nature23474","article-title":"Quantum machine learning","volume":"549","author":"Biamonte","year":"2017","journal-title":"Nature"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/TNB.2021.3075733","article-title":"Quantum speedup and mathematical solutions of implementing bio-molecular solutions for the independent set problem on IBM quantum computers","volume":"20","author":"Chang","year":"2021","journal-title":"IEEE Trans. Nanobiosci."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.jpdc.2022.03.011","article-title":"Fast Quantum Algorithm for Protein Structure Prediction in Hydrophobic-Hydrophilic modulel","volume":"164","author":"Wong","year":"2022","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/TNB.2021.3130811","article-title":"Quantum Speedup for Inferring the Value of Each Bit of a Solution State in Unsorted Databases Using a Bio-Molecular Algorithm on IBM Quantum\u2019s Computers","volume":"21","author":"Chang","year":"2022","journal-title":"IEEE Trans. Nanobiosci."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TNB.2021.3065051","article-title":"Quantum Speedup for Protein Structure Prediction","volume":"20","author":"Wong","year":"2021","journal-title":"IEEE Trans. Nanobiosci."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"130503","DOI":"10.1103\/PhysRevLett.113.130503","article-title":"Quantum support vector machine for big feature and big data classification","volume":"113","author":"Rebentrost","year":"2013","journal-title":"Phys. Rev. Lett."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1883","DOI":"10.4249\/scholarpedia.1883","article-title":"K-nearest neighbor","volume":"4","author":"Peterson","year":"2009","journal-title":"Scholarpedia"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"167902","DOI":"10.1103\/PhysRevLett.87.167902","article-title":"Quantum fingerprinting","volume":"87","author":"Buhrman","year":"2001","journal-title":"Phys. Rev. Lett."},{"key":"ref_25","unstructured":"Seth Lloyd, S., Mohseni, M., and Rebentrost, P. (2013). Quantum algorithms for supervised and unsupervised machine learning. arXiv."},{"key":"ref_26","first-page":"316","article-title":"Quantum algorithms for nearest-neighbor methods for supervised and unsupervised learning","volume":"15","author":"Wiebe","year":"2015","journal-title":"Quantum Inf. Comput."},{"key":"ref_27","unstructured":"D\u00fcrr, C., and H\u00f8yer, P. (1996). A Quantum Algorithm for Finding the Minimum. arXiv."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"3496","DOI":"10.1007\/s10773-017-3514-4","article-title":"Quantum Algorithm for K-Nearest Neighbors Classification Based on the Metric of Hamming Distance","volume":"56","author":"Ruan","year":"2017","journal-title":"Int. J. Theor. Phys."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/s11128-021-03361-0","article-title":"Quantum K-nearest neighbor classification algorithm based on Hamming distance","volume":"21","author":"Li","year":"2022","journal-title":"Quantum Inf. Process."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1089\/big.2018.0175","article-title":"Effects of Distance Measure Choice on K-Nearest Neighbor Classifier Performance: A Review","volume":"7","author":"Hassanat","year":"2019","journal-title":"Big Data"},{"key":"ref_31","unstructured":"Hassanat, A.B. (2014). Dimensionality Invariant Similarity Measure. arXiv."},{"key":"ref_32","unstructured":"Getachew, A. (2020). Quantum K-medians Algorithm Using Parallel Euclidean Distance Estimator. arXiv."},{"key":"ref_33","unstructured":"Kaye, P., and Mosca, M. (2001, January 17). Quantum Networks for Generating Arbitrary Quantum States. Proceedings of the Optical Fiber Communication Conference and International Conference on Quantum Information, Anaheim, CA, USA."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"52310","DOI":"10.1103\/PhysRevA.78.052310","article-title":"Architectures for a quantum random access memory","volume":"78","author":"Giovannetti","year":"2008","journal-title":"Phys. Rev. A"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"3949","DOI":"10.1038\/s41598-019-40439-3","article-title":"Circuit-Based Quantum Random Access Memory for Classical Data","volume":"9","author":"Park","year":"2019","journal-title":"Sci. Rep."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"40504","DOI":"10.1103\/PhysRevLett.122.040504","article-title":"Quantum Machine Learning in Feature Hilbert Spaces","volume":"122","author":"Schuld","year":"2019","journal-title":"Phys. Rev. Lett."},{"key":"ref_37","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Montreal, A., Aarhus, B.U., and Waterloo, C.U. (2000). Quantum Amplitude Amplification and Estimation. arXiv."},{"key":"ref_38","first-page":"1310","article-title":"Quantum Query Complexity of Some Graph Problems","volume":"35","author":"Heiligman","year":"2004","journal-title":"SIAM J. Comput."},{"key":"ref_39","unstructured":"Miyamoto, K., Iwamura, M., and Kise, K. (2019). A Quantum Algorithm for Finding k-Minima. arXiv."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/1\/127\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:03:40Z","timestamp":1760119420000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/1\/127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,8]]},"references-count":39,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["e25010127"],"URL":"https:\/\/doi.org\/10.3390\/e25010127","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,8]]}}}