Biclustering a dataset using photonic quantum computing

Ajinkya Borle, Ameya Bhave
5/28/2024
quant-phcs.ETcs.LG

No confident code implementation found for this paper.

Abstract

Biclustering is a problem in machine learning and data mining that seeks to group together rows and columns of a dataset according to certain criteria. In this work, we highlight the natural relation that quantum computing models like boson and Gaussian boson sampling (GBS) have to this problem. We first explore the use of boson sampling to identify biclusters based on matrix permanents. We then propose a heuristic that finds clusters in a dataset using Gaussian boson sampling by (i) converting the dataset into a bipartite graph and then (ii) running GBS to find the densest sub-graph(s) within the larger bipartite graph. Our simulations for the above proposed heuristics show promising results for future exploration in this area.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Quantum-Assisted Correlation Clustering

81% match2025

Quantum Annealing for Machine Learning: Applications in Feature Selection, Instance Selection, and Clustering

80% match2025

Exact and Heuristic Algorithms for Constrained Biclustering

79% match1 repo2025

Provably faster randomized and quantum algorithms for k-means clustering via uniform sampling

79% match2025

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering

78% match1 repo22024

Near-Optimal Quantum Coreset Construction Algorithms for Clustering

78% match2023

Cite this paper

@article{borle2024biclustering,
  title  = {Biclustering a dataset using photonic quantum computing},
  author = {Ajinkya Borle and Ameya Bhave},
  year   = {2024},
  eprint = {2405.18622},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.18622v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.18622.svg)](https://codeofpaper.com/paper/2405.18622)

Discussion