Random walk quantum clustering algorithm based on space
From MaRDI portal
Recommendations
- A hybrid classical-quantum clustering algorithm based on quantum walks
- 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
- A novel algorithm of quantum random walk in server traffic control and task scheduling
- Quantum Random Walks – New Method for Designing Quantum Algorithms
Cites work
- On the relationship between continuous- and discrete-time quantum walk
- Physical implementation of quantum walks
- Quantum image encryption algorithm based on image correlation decomposition
- Quantum image encryption based on generalized affine transform and logistic map
- Quantum image encryption based on generalized Arnold transform and double random-phase encoding
- Quantum Walk Based Search Algorithms
- Quantum walks and search algorithms
- Search on a hypercubic lattice using a quantum random walk. I. \(d>2\)
- Universally optimal noisy quantum walks on complex networks
Cited in
(4)- A novel algorithm of quantum random walk in server traffic control and task scheduling
- 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
- A hybrid classical-quantum clustering algorithm based on quantum walks
This page was built for publication: Random walk quantum clustering algorithm based on space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1640108)
