A hybrid classical-quantum clustering algorithm based on quantum walks

DOI10.1007/s11128-010-0169-yzbMath1209.81067OpenAlexW2092822970MaRDI QIDQ632204

Qiang Li, Jing-ping Jiang, Yan He

Publication date: 15 March 2011

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-010-0169-y

zbMATH Keywords

quantum computationunsupervised learningdata clusteringquantum walk

Mathematics Subject Classification ID

Computational learning theory (68Q32) Quantum computation (81P68) Pattern recognition, speech recognition (68T10)

Related Items (2)

Quantum speed-up for unsupervised learning ⋮ A study and analysis of a discrete quantum walk-based hybrid clustering approach using d-regular bipartite graph and 1D lattice

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Quantum speed-up for unsupervised learning
• Discrete quantum walks hit exponentially faster
• WHAT IS QUANTUM COMPUTATION?
• Exponential algorithmic speedup by a quantum walk
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• One-dimensional quantum walks
• Quantum walks on graphs
• Multidimensional linear diffusion for image enhancement on a type II quantum computer
• DISCRETE TIME QUANTUM WALK ON A LINE WITH TWO PARTICLES

This page was built for publication: A hybrid classical-quantum clustering algorithm based on quantum walks