arXiv (All)
open access
A quantum k-nearest neighbors implementation using magnitude-aware comparisons
Much attention has recently been devoted to the k-nearest neighbors (KNN) algorithm as a case study for quantum computing algorithms. Several algorithms have devised methods to compute a similarity metric to solve Quantum KNN (QKNN). This paper presents a practical quantum encoding technique that en
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA#1011048
- Efficient Quantum Algorithms for Data Clustering#1251145
- QGB-W$k$NN: Quantum Granular-Ball Learning for Robust Classification#973567
- Empirical Quantum Advantage in Constrained Optimization from Encoded Unitary Designs#1357060
- From Bits to Qubits: The Theory and Practice of Quantum Data Encoding#985451
Record · ID 1456562
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive