NISQ-friendly measurement-based quantum clustering algorithms
From MaRDI portal
Publication:6629291
DOI10.1007/S11128-024-04553-0MaRDI QIDQ6629291FDOQ6629291
Authors: Srushti Patil, Shreya Banerjee, Prasanta K. Panigrahi 
Publication date: 29 October 2024
Published in: Quantum Information Processing (Search for Journal in Brave)
Cites Work
- Algorithm AS 136: A K-Means Clustering Algorithm
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Effect algebras and unsharp quantum logics.
- Efficient algorithms for agglomerative hierarchical clustering methods
- Cluster Analysis
- Rapid solution of problems by quantum computation
- Quantum complexity theory
- Quantum speed-up for unsupervised learning
- Quantum Query Complexity of Some Graph Problems
- A novel clustering algorithm based on quantum games
- Title not available (Why is that?)
- A hybrid classical-quantum clustering algorithm based on quantum walks
- An efficient quantum algorithm for preparation of uniform quantum superposition states
- A novel approach to threshold quantum images by using unsharp measurements
This page was built for publication: NISQ-friendly measurement-based quantum clustering algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629291)
