NISQ-friendly measurement-based quantum clustering algorithms

DOI10.1007/S11128-024-04553-0MaRDI QIDQ6629291zbMATH OpenFDO

Authors Srushti Patil, Shreya Banerjee, Prasanta K. Panigrahi

Publication date 29 October 2024

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

zbMATH Keywords

quantum algorithmsunsharp measurementsquantum clustering

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites work

• scientific article; zbMATH DE number 3518115 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• A hybrid classical-quantum clustering algorithm based on quantum walks
• A novel approach to threshold quantum images by using unsharp measurements
• A novel clustering algorithm based on quantum games
• Algorithm AS 136: A K-Means Clustering Algorithm
• An efficient quantum algorithm for preparation of uniform quantum superposition states
• Cluster Analysis
• Effect algebras and unsharp quantum logics.
• Efficient algorithms for agglomerative hierarchical clustering methods
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Query Complexity of Some Graph Problems
• Quantum complexity theory
• Quantum speed-up for unsupervised learning
• Rapid solution of problems by quantum computation

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)