Quick Navigation
Topics
Trapped Ion Quantum Computing
Quantum Chemistry
Qlustering: Harnessing Network-Based Quantum Transport for Data Clustering
arXiv
Authors: Shmuel Lorber, Yonatan Dubi
Year
2025
Paper ID
50731
Status
Preprint
Abstract Read
~2 min
Abstract Words
157
Citations
N/A
Abstract
We introduce Qlustering, a quantum-inspired algorithm for unsupervised learning that leverages network-based quantum transport to perform data clustering. In contrast to traditional distance-based methods, Qlustering treats the steady-state dynamics of quantum particles propagating through a network as a computational resource. Data are encoded as input states in a tight-binding Hamiltonian framework governed by the Lindblad master equation, and cluster assignments emerge from steady-state output currents at terminal nodes. The algorithm iteratively optimizes the network's Hamiltonian to minimize a physically motivated cost function, achieving convergence through stochastic updates. We benchmark Qlustering on synthetic datasets, a localization problem, and real-world chemical and biological data, namely subsets of the QM9 molecular database and the Iris dataset. Across these diverse tasks, Qlustering demonstrates competitive or superior performance compared with classical methods such as k-means, particularly for non-convex or high-dimensional data. Its intrinsic robustness, low computational complexity, and compatibility with photonic implementations suggest a promising route toward physically realizable, quantum-native clustering architectures.
Why This Paper Matters
- This paper contributes to the Quantum Chemistry research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- We introduce Qlustering, a quantum-inspired algorithm for unsupervised learning that leverages network-based quantum transport to perform data clustering.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.