A hybrid classical-quantum clustering algorithm based on quantum walks
From MaRDI portal
Recommendations
- Random walk quantum clustering algorithm based on space
- A study and analysis of a discrete quantum walk-based hybrid clustering approach using d-regular bipartite graph and 1D lattice
- A novel clustering algorithm based on quantum games
- Emulation of high-performance correlation-based quantum clustering algorithm for two-dimensional data on FPGA
- A quantum evolutionary algorithm for data clustering
Cites work
- Discrete quantum walks hit exponentially faster
- DISCRETE TIME QUANTUM WALK ON A LINE WITH TWO PARTICLES
- Exponential algorithmic speedup by a quantum walk
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- Multidimensional linear diffusion for image enhancement on a type II quantum computer
- One-dimensional quantum walks
- Quantum speed-up for unsupervised learning
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- Quantum walks on graphs
- What is quantum computation.
Cited in
(16)- Quantum annealing for combinatorial clustering
- Random walk quantum clustering algorithm based on space
- A novel algorithm of quantum random walk in server traffic control and task scheduling
- Quantum speed-up for unsupervised learning
- A quantum annealing approach to biclustering
- Clustering by quantum annealing on the three-level quantum elements qutrits
- Data clustering with quantum mechanics
- Emulation of high-performance correlation-based quantum clustering algorithm for two-dimensional data on FPGA
- Balanced \(k\)-means clustering on an adiabatic quantum computer
- scientific article; zbMATH DE number 5320186 (Why is no real title available?)
- A novel clustering algorithm based on quantum games
- A study and analysis of a discrete quantum walk-based hybrid clustering approach using d-regular bipartite graph and 1D lattice
- Graph Embedding Using Quantum Commute Times
- A quantum evolutionary algorithm for data clustering
- NISQ-friendly measurement-based quantum clustering algorithms
- Multi-party quantum private set intersection based on quantum walk on a circle
This page was built for publication: A hybrid classical-quantum clustering algorithm based on quantum walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632204)