Quantum Block-Matching Algorithm using Dissimilarity Measure

M. Martínez-Felipe, J. Montiel-Pérez, V. Onofre, A. Maldonado-Romo, Ricky Young
9/27/2023
quant-phcs.CV

No confident code implementation found for this paper.

Abstract

Finding groups of similar image blocks within an ample search area is often necessary in different applications, such as video compression, image clustering, vector quantization, and nonlocal noise reduction. A block-matching algorithm that uses a dissimilarity measure can be applied in such scenarios. In this work, a measure that utilizes the quantum Fourier transform or the Swap test based on the Euclidean distance is proposed. Experiments on small cases with ideal and noisy simulations are implemented. In the case of the Swap test, the IBM and IonQ quantum devices have been used, demonstrating potential for future near-term applications.

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

Cite this paper

@article{martnezfelipe2023quantum,
  title  = {Quantum Block-Matching Algorithm using Dissimilarity Measure},
  author = {M. Martínez-Felipe and J. Montiel-Pérez and V. Onofre and A. Maldonado-Romo and Ricky Young},
  year   = {2023},
  eprint = {2309.15792},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2309.15792v2}
}

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/2309.15792.svg)](https://codeofpaper.com/paper/2309.15792)

Discussion