Identification of Desired Pixels in an Image Using Grover's Quantum
Search Algorithm
- URL: http://arxiv.org/abs/2107.03053v1
- Date: Wed, 7 Jul 2021 07:30:21 GMT
- Title: Identification of Desired Pixels in an Image Using Grover's Quantum
Search Algorithm
- Authors: Basit Iqbal, Harkirat Singh
- Abstract summary: Grover algorithm in quantum information gives quadratic speed up in unstructured database search.
Our research interest is to find all darker pixels in a 2x2 grayscale image using Grover's algorithm.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum Information Theory promises to speed up computation so is observed in
real quantum computers as proved to its classical counterpart. This
revolutionizes every field linked directly or indirectly with computation.
Grover algorithm in quantum information gives quadratic speed up in
unstructured database search. With the availability of public online resources
for quantum computers like IBM, quantum image processing came into the picture
for making use of quantum computers in the image processing field. Our research
interest is to find all darker pixels in a 2x2 grayscale image using Grover's
algorithm. We studied it in two different ways. In the first method, I ran
Grover's algorithm on the python generated classical image. In the second
method, I converted a python-generated 2x2 image into a quantum image and then
ran Grover's algorithm to locate the darker pixels. As has been observed in
complexity analysis, Grover's unstructured search has the O(2^{n}) while as for
classical schemes O(2^{2n+2m}), where m and n denote the dimensions of the
image.
Related papers
- Generalized quantum Arimoto-Blahut algorithm and its application to
quantum information bottleneck [55.22418739014892]
We generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al.
We apply our algorithm to the quantum information bottleneck with three quantum systems.
Our numerical analysis shows that our algorithm is better than their algorithm.
arXiv Detail & Related papers (2023-11-19T00:06:11Z) - Grover's Algorithm Offers No Quantum Advantage [0.0]
Grover's algorithm is one of the primary algorithms offered as evidence that quantum computers can provide an advantage over classical computers.
We construct a quantum inspired algorithm, executable on a classical computer, that performs Grover's task in linear number of call to the oracle.
We critically examine the possibility of a practical speedup, a possibility that depends on the nature of the quantum circuit associated with the oracle.
arXiv Detail & Related papers (2023-03-20T17:56:20Z) - Distributed exact quantum algorithms for Bernstein-Vazirani and search
problems [9.146620606615889]
We give a distributed Bernstein-Vazirani algorithm (DBVA) with $t$ computing nodes, and a distributed exact Grover's algorithm (DEGA) that solve the search problem with only one target item in the unordered databases.
We provide situations of our DBVA and DEGA on MindQuantum (a quantum software) to validate the correctness and practicability of our methods.
arXiv Detail & Related papers (2023-03-19T14:18:49Z) - Manifold Learning for Dimensionality Reduction: Quantum Isomap algorithm [15.622577797491788]
Isomap algorithm is widely used in neuroimaging, spectral analysis and other fields.
We propose the quantum Isomap algorithm, which consists of two sub-algorithms.
The time complexity of quantum Isomap algorithm is $O(dNpolylogN)$.
arXiv Detail & Related papers (2022-12-07T12:29:41Z) - Quantum multi-programming for Grover's search [6.359294579761927]
We propose a quantum multi-programming (QMP) algorithm for Grover's search.
Our algorithm decomposes Grover's algorithm by the partial diffusion operator and executes the decomposed circuits in parallel by QMP.
We prove that this new algorithm increases the rotation angle of the Grover operator which, as a result, increases the success probability.
arXiv Detail & Related papers (2022-07-29T04:05:46Z) - A hybrid quantum image edge detector for the NISQ era [62.997667081978825]
We propose a hybrid method for quantum edge detection based on the idea of a quantum artificial neuron.
Our method can be practically implemented on quantum computers, especially on those of the current noisy intermediate-scale quantum era.
arXiv Detail & Related papers (2022-03-22T22:02:09Z) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z) - Pixel identification in an image using Grover Search Algorithm [0.0]
Grover algorithm is a quantum-based search algorithm used to find the correct answer from an unsorted database by computing all the inputs simultaneously.
We used the Grover algorithm for identifying the black pixel in a (2x2) classical image by first converting it into a quantum state and then running the Grover algorithm for identifying the pixel with 0 value maximum gray-scale intensity.
arXiv Detail & Related papers (2021-07-07T06:42:43Z) - On Applying the Lackadaisical Quantum Walk Algorithm to Search for
Multiple Solutions on Grids [63.75363908696257]
The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$.
This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
arXiv Detail & Related papers (2021-06-11T09:43:09Z) - Quantum Computing without Quantum Computers: Database Search and Data
Processing Using Classical Wave Superposition [101.18253437732933]
We present experimental data on magnetic database search using spin wave superposition.
We argue that in some cases the classical wave-based approach may provide the same speedup in database search as quantum computers.
arXiv Detail & Related papers (2020-12-15T16:21:53Z) - Quantum Algorithms for String Processing [58.720142291102135]
We provide a quantum algorithm for the String matching problem that uses exponentially less quantum memory than existing ones.
Using the same ideas, we provide two algorithms for the String comparing problem.
The second algorithm works exponentially faster than the existing one.
arXiv Detail & Related papers (2020-12-01T09:59:06Z)
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.