NISQ-friendly measurement-based quantum clustering algorithms

DOI10.1007/S11128-024-04553-0MaRDI QIDQ6629291

Prasanta K. Panigrahi, Shreya Banerjee, Srushti Patil

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithm AS 136: A K-Means Clustering Algorithm
• Effect algebras and unsharp quantum logics.
• A hybrid classical-quantum clustering algorithm based on quantum walks
• Efficient algorithms for agglomerative hierarchical clustering methods
• Quantum speed-up for unsupervised learning
• Cluster Analysis
• A novel clustering algorithm based on quantum games
• Rapid solution of problems by quantum computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum complexity theory
• Quantum Query Complexity of Some Graph Problems
• 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)