Grover's algorithm for image edge detection
Pulak Ranjan Giri, Kazuhiro Saito
Abstract
Grover's algorithm is one of the most significant quantum algorithms, enabling the search for a marked element in an unsorted database quadratically faster than classical search algorithms. We utilize Groves's algorithm to detect the edges of a digital image faster than any classical edge detection methods. The high success probability of our method in detecting image edges, compared to most existing quantum edge detection methods, makes it a more suitable candidate for use in the presence of noise on current quantum devices. We implemented our model for the 2× 2 blocks of the image using a two-qubit Qiskit circuit with the QASM simulator and the noisy IBM Sydney(fake) device, making it suitable for most of the current NISQ devices.
Create a lesson
Related papers
Single-Particle Spectral Estimation
Adrian Chapman, Charles Derby, Steven T. Flammia et al.
Learning SYK Hamiltonians
Anurag Anshu, Srinivasan Arunachalam, Sitan Chen et al.
From Permutation Symmetry to Communication Bounds and Additivity
Zahra Baghali Khanian, Debbie Leung, Graeme Smith
Robust exponential lower bounds for fermionic and bosonic Gaussian ranks
Fuchuan Wei, Kong-Wing Wu, Zhengwei Liu et al.
Polynomial-time classical and quantum simulation of quantum impurity models
Jiaqing Jiang, Nathan Ju, Ojas Parekh et al.
Beyond Light Cones: State Preparation Complexity in Quantum Spin Glasses
Omar Al-Ghattas, David Gamarnik, Bobak T Kiani