Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Advances in intelligent systems and computing

An Improved Quantum Nearest-Neighbor Algorithm

Ying Zhang, Feng Bao, Wei Jia, Chengzhuo Xu

Published Jul 1, 2020• 3 citations
Publisher
DOI
10.1007/978-981-15-3753-0_39

Related papers

An improved quantum algorithm for data fitting

Jiancheng Lei, Tingting Song, Ling Liu +1 more

Physica A Statistical Mechanics and its Applications•Jan 30, 2023•4 citations

Quantum K nearest neighbor algorithm

Jiang Jing-ping

A novel quantum learning method is presented,which combines quantum computation with classical K-nearest-neighbor,called quantum K-nearest-neighbor.Its steps are introduced in detail.Further,in order to save to running time of quantum counting subroutine,the fired K is revised to the changeable K.Under the framework of Boosting algorithm,a strong classifier is build,which consists of three weak classifiers,each trained by the quantum k-varying nearest neighbor,to improve the performance of classification.In this algorithm,the time complexity of classical K-nearest-neighbor algorithm is reduced from O(N) to O(N) by means of the power of quantum algorithms.

Systems engineering and electronics•Jan 1, 2008•7 citations

Synthesis of Linear Nearest Neighbor Quantum Circuits

Md. Mazder Rahman, Gerhard W. Dueck

This paper presents models for transforming standard reversible circuits into Linear Nearest Neighbor (LNN) architecture without inserting SWAP gates. Templates to optimize the transformed LNN circuits are proposed. All minimal LNN circuits for all 3-qubit functions have been generated to serve as benchmarks to evaluate heuristic optimization algorithms. The minimal results generated are compared with optimized LNN circuits obtained from the post synthesis algorithm --- template matching with LNN templates. Experiments show that the suggested synthesis flow significantly improves the quantum cost of circuits.

arXiv:1508.05430•Aug 21, 2015•19 citations

Development of new quantum algorithms

Diederik Aerts

•Jan 1, 2006•0 citations

Quantum switching based on the nearest neighbor hamiltonian

Min Jiang, Xu Huang, Yiming Zhou

This paper describes a quantum switching architecture for nearest neighbor coupling. An efficient quantum shear sorting (QSS) algorithm is used to reduce the number of time steps. For the QSS algorithm, the running complexity of the quantum switching architecture is polynomial in time with the nearest neighbor coupling and the implementation is less complex. The result shows that improved switching is extremely simple to implement using existing quantum computer candidates.

Tsinghua Science & Technology•Feb 1, 2011•0 citations

The Quantum Approximate Optimization Algorithm

Stefan Isermann

•Jul 3, 2026•0 citations
A novel quantum learning method is presented,which combines quantum computation with classical K-nearest-neighbor,called quantum K-nearest-neighbor.Its steps are introduced in detail.Further,in order to save to running time of quantum counting subroutine,the fired K is revised to the changeable K.Under the framework of Boosting algorithm,a strong classifier is build,which consists of three weak classifiers,each trained by the quantum k-varying nearest neighbor,to improve the performance of classification.In this algorithm,the time complexity of classical K-nearest-neighbor algorithm is reduced from O(N) to O(N) by means of the power of quantum algorithms.
This paper presents models for transforming standard reversible circuits into Linear Nearest Neighbor (LNN) architecture without inserting SWAP gates. Templates to optimize the transformed LNN circuits are proposed. All minimal LNN circuits for all 3-qubit functions have been generated to serve as benchmarks to evaluate heuristic optimization algorithms. The minimal results generated are compared with optimized LNN circuits obtained from the post synthesis algorithm --- template matching with LNN templates. Experiments show that the suggested synthesis flow significantly improves the quantum cost of circuits.