Quantum Block-Matching Algorithm using Dissimilarity Measure

• URL: http://arxiv.org/abs/2309.15792v2
• Date: Thu, 28 Dec 2023 21:28:57 GMT
• Title: Quantum Block-Matching Algorithm using Dissimilarity Measure
• Abstract summary: Finding groups of similar image blocks within an ample search area is often necessary in different applications. A block-matching algorithm that uses a dissimilarity measure can be applied in such scenarios. A measure that utilizes the quantum Fourier transform or the Swap test based on the Euclidean distance is proposed.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• The trainability of photonic quantum circuits [34.13373752364321]
  Variational quantum algorithms are a leading approach to near-term quantum computing, but their scalability can be limited by barren plateaus and the sampling cost of resolving small changes in the loss landscape.<n>Here, we study the trainability of passive linear-optical quantum circuits and introduce a framework based on the ratio of variance to circuit variance.<n>These results establish photonic variational quantum computing as a promising platform for near-term applications.
  arXiv  Detail & Related papers  (2026-07-23T17:31:09Z)
• Symmetry tests for cyclic groups with quantum linear optics [0.0]
  We present a method that determines whether an input photonic state is invariant under the action of a cyclic group defined by an operator.<n>Results generalize previously known circle and SWAP tests related to suppression laws in Fourier interferometers.<n>We discuss the scenarios where this measurement can be used to perform Hadamard test, a fundamental primitive in variational and quantum machine-learning algorithms.
  arXiv  Detail & Related papers  (2026-07-13T10:58:46Z)
• Quantum algorithm for simulating resonant inelastic X-ray scattering in battery materials [29.33036224660887]
  We propose a quantum algorithm for simulating the RIXS spectrum of molecular clusters hypothesized to form in Li-excess cathodes.<n>For a classically challenging active space with 20 orbitals, the algorithm requires $2.0 times 1010$ Toffoli gates and $414$ logical qubits.
  arXiv  Detail & Related papers  (2026-02-23T19:01:02Z)
• Quantum Algorithms for Stochastic Differential Equations: A Schrödingerisation Approach [29.662683446339194]
  We propose quantum algorithms for linear differential equations. The gate complexity of our algorithms exhibits an $mathcalO(dlog(Nd))$ dependence on the dimensions. The algorithms are numerically verified for the Ornstein-Uhlenbeck processes, Brownian motions, and one-dimensional L'evy flights.
  arXiv  Detail & Related papers  (2024-12-19T14:04:11Z)
• Benefiting from Quantum? A Comparative Study of Q-Seg, Quantum-Inspired Techniques, and U-Net for Crack Segmentation [41.01256771536732]
  This study evaluates the performance of quantum and quantum-inspired methods compared to classical models for crack segmentation. Our results indicate that quantum-inspired and quantum methods offer a promising alternative for image segmentation, particularly for complex crack patterns, and could be applied in near-future applications.
  arXiv  Detail & Related papers  (2024-10-14T16:51:59Z)
• Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
  We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale. Our experiments show that this approach significantly outperforms the adiabatic algorithm.
  arXiv  Detail & Related papers  (2024-05-31T17:07:43Z)
• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states. It is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• Universal quantum frequency comb measurements by spectral mode-matching [39.58317527488534]
  We present the first general approach to make arbitrary, one-shot measurements of a multimode quantum optical source. This approach uses spectral mode-matching, which can be understood as interferometry with a memory effect.
  arXiv  Detail & Related papers  (2024-05-28T15:17:21Z)
• Compact quantum algorithms for time-dependent differential equations [0.0]
  We build on an idea based on linear combination of unitaries to simulate non-unitary, non-Hermitian quantum systems. We generate hybrid quantum-classical algorithms that efficiently perform iterative matrix-vector multiplication and matrix inversion operations.
  arXiv  Detail & Related papers  (2024-05-16T02:14:58Z)
• Simulating photonic devices with noisy optical elements [0.615738282053772]
  In the near-term, the performance of any quantum algorithm should be tested and simulated in the presence of noise. We apply the recently proposed noisy gates approach to efficiently simulate noisy optical circuits. We also evaluate the performance of a photonic variational quantum algorithm to solve the MAX-2-CUT problem.
  arXiv  Detail & Related papers  (2023-11-17T16:06:20Z)
• Approximately Equivariant Quantum Neural Network for $p4m$ Group Symmetries in Images [30.01160824817612]
  This work proposes equivariant Quantum Convolutional Neural Networks (EquivQCNNs) for image classification under planar $p4m$ symmetry. We present the results tested in different use cases, such as phase detection of the 2D Ising model and classification of the extended MNIST dataset.
  arXiv  Detail & Related papers  (2023-10-03T18:01:02Z)
• Hybrid quantum transfer learning for crack image classification on NISQ hardware [62.997667081978825]
  We present an application of quantum transfer learning for detecting cracks in gray value images. We compare the performance and training time of PennyLane's standard qubits with IBM's qasm_simulator and real backends.
  arXiv  Detail & Related papers  (2023-07-31T14:45:29Z)
• Solving Graph Problems Using Gaussian Boson Sampling [22.516585968074146]
  We use a noisy intermediate-scale quantum computer to solve graph problems. We experimentally observe the presence of GBS enhancement with large photon-click number and an enhancement under certain noise. Our work is a step toward testing real-world problems using the existing intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2023-02-02T08:25:47Z)
• Variational Quantum and Quantum-Inspired Clustering [0.0]
  We present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2022-06-20T17:02:19Z)
• Tensor Ring Parametrized Variational Quantum Circuits for Large Scale Quantum Machine Learning [28.026962110693695]
  We propose an algorithm that compresses the quantum state within the circuit using a tensor ring representation. The storage and computational time increases linearly in the number of qubits and number of layers, as compared to the exponential increase with exact simulation algorithms. We achieve a test accuracy of 83.33% on Iris dataset and a maximum of 99.30% and 76.31% on binary and ternary classification of MNIST dataset.
  arXiv  Detail & Related papers  (2022-01-21T19:54:57Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Unsupervised Event Classification with Graphs on Classical and Photonic Quantum Computers [0.0]
  Photonic Quantum Computers provides several benefits over the discrete qubit-based paradigm of quantum computing. We build an anomaly detection model to use on searches for New Physics. We present a novel method of anomaly detection, combining the use of Gaussian Boson Sampling and a quantum extension to K-means known as Q-means.
  arXiv  Detail & Related papers  (2021-03-05T19:02:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.