Quantum Algorithm for Signal Denoising
- URL: http://arxiv.org/abs/2312.15411v1
- Date: Sun, 24 Dec 2023 05:16:04 GMT
- Title: Quantum Algorithm for Signal Denoising
- Authors: Sayantan Dutta, Adrian Basarab, Denis Kouam\'e, Bertrand Georgeot
- Abstract summary: The proposed algorithm is able to process textitboth classical and quantum signals.
Numerical results show that it is efficient at removing noise of both classical and quantum origin.
- Score: 32.77959665599749
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This letter presents a novel \textit{quantum algorithm} for signal denoising,
which performs a thresholding in the frequency domain through amplitude
amplification and using an adaptive threshold determined by local mean values.
The proposed algorithm is able to process \textit{both classical and quantum}
signals. It is parametrically faster than previous classical and quantum
denoising algorithms. Numerical results show that it is efficient at removing
noise of both classical and quantum origin, significantly outperforming
existing quantum algorithms in this respect, especially in the presence of
quantum noise.
Related papers
- A polynomial-time classical algorithm for noisy quantum circuits [1.2708457954150887]
We provide a-time classical algorithm for noisy quantum circuits.
Our approach is based upon the intuition that noise exponentially damps non-local correlations.
For constant noise rates, any quantum circuit for which error mitigation is efficient on most input states, is also classically simulable on most input states.
arXiv Detail & Related papers (2024-07-17T17:48:39Z) - Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
arXiv Detail & Related papers (2024-07-04T21:11:05Z) - 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) - Improved Quantum Algorithms for Eigenvalues Finding and Gradient Descent [0.0]
Block encoding is a key ingredient in the recently developed quantum signal processing that forms a unifying framework for quantum algorithms.
In this article, we utilize block encoding to substantially enhance two previously proposed quantum algorithms.
We show how to extend our proposed method to different contexts, including matrix inversion and multiple eigenvalues estimation.
arXiv Detail & Related papers (2023-12-22T15:59:03Z) - General noise-resilient quantum amplitude estimation [0.0]
We present a novel algorithm that enhances the estimation of amplitude and observable under noise.
Remarkably, our algorithm exhibits robustness against noise that varies across different depths of the quantum circuits.
arXiv Detail & Related papers (2023-12-02T09:27:40Z) - A quantum advantage over classical for local max cut [48.02822142773719]
Quantum optimization approximation algorithm (QAOA) has a computational advantage over comparable local classical techniques on degree-3 graphs.
Results hint that even small-scale quantum computation, which is relevant to the current state-of the art quantum hardware, could have significant advantages over comparably simple classical.
arXiv Detail & Related papers (2023-04-17T16:42:05Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - Limitations of variational quantum algorithms: a quantum optimal
transport approach [11.202435939275675]
We obtain extremely tight bounds for standard NISQ proposals in both the noisy and noiseless regimes.
The bounds limit the performance of both circuit model algorithms, such as QAOA, and also continuous-time algorithms, such as quantum annealing.
arXiv Detail & Related papers (2022-04-07T13:58:44Z) - Optimization and Noise Analysis of the Quantum Algorithm for Solving
One-Dimensional Poisson Equation [17.65730040410185]
We propose an efficient quantum algorithm for solving one-dimensional Poisson equation.
We further develop this algorithm to make it closer to the real application on the noisy intermediate-scale quantum (NISQ) devices.
We analyze the effect of common noise existing in the real quantum devices on our algorithm using the IBM Qiskit toolkit.
arXiv Detail & Related papers (2021-08-27T09:44:41Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z)
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.