Informatization and communication

Modifications of grover’s quantum algorithm and approaches to their implementation

N.K. Uvarov, А. Д. Хомоненко

Published Jan 1, 2022• 0 citations

Abstract

Modern variants of Grover›s algorithm and approaches to their implementation are considered. The definition of Grover›s algorithm given, its main three stages are indicated. A generalization of Grover›s algorithm «amplitude amplification» is given. A description of the quantum circuit of Grover›s algorithm is given. An example of a complete Grover quantum circuit for two qubits is considered. The characteristic of quantum search in d-dimensional system with the help of qutrits and qudits is given. Examples of implementation of a number of variants of Grover›s algorithm using IBM Quantum Composer tools are proposed. Descriptions of the latest modifications of Grover›s algorithm are given.

DOI: 10.34219/2078-8320-2022-13-4-42-50

Related papers

Description of the Grover algorithm based on geometric considerations

Gérard Fleury, Philippe Lacomme

This paper concerns the Grover algorithm that permits to make amplification of quantum states previously tagged by an Oracle. Grover's algorithm allows searches in an unstructure database of n entries finding a marked element with a quadratic speedup. The algorithm requires a predefined number of runs to succeed with probability close to one.This article provides a description of the amplitude amplification quantum algorithm mechanism in a very short computational way, based on tensor products and provides a geometric presentation of the successive system states. All the basis changes are fully described to provide an alternative to the wide spread Grover description based only on matrices and complex tensor computation. Our experiments encompass numerical evaluations of circuit using the Qiskit library of IBM that meet the theoretical considerations

arXiv:2210.16809Oct 30, 20220 citations

Modelling of Grover’s quantum search algorithms: implementations of Simple quantum simulators on classical computers

Sergey Victorovich Ulyanov, Andrey G. Reshetnikov, Olga Tyatyushkina

Models of Grover’s search algorithm is reviewed to build the foundation for the other algorithms. Thereafter, some preliminary modifications of the original algorithms by others are stated, that increases the applicability of the search procedure. A general quantum computation on an isolated system can be represented by a unitary matrix. In order to execute such a computation on a quantum computer, it is common to decompose the unitary into a quantum circuit, i.e., a sequence of quantum gates that can be physically implemented on a given architecture. There are different universal gate sets for quantum computation. Here we choose the universal gate set consisting of CNOT and single-qubit gates. We measure the cost of a circuit by the number of CNOT gates as they are usually more difficult to implement than single qubit gates and since the number of single-qubit gates is bounded by about twice the number of CNOT’s.

System Analysis in Science and EducationSep 30, 20204 citations

Implementation of Grover’s Iterator for Quantum Searching With an Arbitrary Number of Qubits

Sihyung Lee, Seung Yeob Nam

Grover’s algorithm harnesses the power of quantum computing to swiftly locate specific elements in an unstructured database, outperforming classical computers in tasks like database searching. This algorithm capitalizes on the unique ability of qubits to be in both 0 and 1 states simultaneously (superposition), allowing it to scan the entire search space at once. It then boosts the probability of the target element, making it more prominent. While the foundational concepts of Grover’s algorithm are well-documented, practical implementation using quantum operators, especially for large search spaces, remains less explored beyond basic examples with a small number of qubits. Existing general synthesis techniques often involve numerous operators or are time-consuming. Our proposed methods specifically address the amplitude-amplification component of Grover’s algorithm for any size of search space. These methods detail the required types and quantities of qubits and operators, emphasizing minimal usage and efficient assembly. Developed and evaluated in Python, our methods consistently identified target elements with over 95% accuracy and achieved configurations comparably compact as those in the existing literature but at a faster pace. We anticipate that these methods facilitate practical implementations of Grover’s algorithm across various domains.

IEEE AccessJan 1, 20247 citations

Designing Grover’s quantum searching algorithm for 2-qubit and 3-qubit states of quantum systems

Sh. A. Toirov, U. X. Mingboyev, A. A. Parmonov +1 more

This paper develops and analyzes Grover’s quantum search algorithm in 2- and 3-qubit systems in terms of the number of gates, representation of state vectors, and state vector measurement probabilities. We designed, verified and simulated the quantum circuit using QCAD. We present a theoretical implementation of the search algorithm in different qubit systems. We may observe that our circuit design for 2-qubit systems is accurate and does not allow any error when a small error occurs in the design of a 3-qubit quantum system. it was considered to what extend given information about object of the research is used purposefully in the modeling process, as a result of mathematical analysis of Grover’s method of the quantum algorithm, i.e. it is important to provide the adequacy of the model. The results of the optimization performed with the quantum algorithm based on Grover’s method are presented.

AIP conference proceedingsJan 1, 20240 citations

Design of Grover’s Algorithm over 2, 3 and 4-Qubit Systems in Quantum Programming Studio

Diana Jeba Jingle, Shylu Sam, P. Mano Paul +2 more

In this paper, we design and analyse the Circuit for Grover’s Quantum Search Algorithm on 2, 3 and 4-qubit systems, in terms of number of gates, representation of state vectors and measurement probability for the state vectors. We designed, examined and simulated the quantum circuit on IBM Q platform using Quantum Programming Studio. We present the theoretical implementation of the search algorithm on different qubit systems. We observe that our circuit design for 2 and 4-qubit systems are precise and do not introduce any error while experiencing a small error to our design of 3-qubit quantum system.

International Journal of Electronics and TelecommunicationsMar 30, 202212 citations

Quadratically Fast Searching in Quantum Computation

Mohit Joshi, Manoj Kumar Mishra, S. Karthikeyan

Grover’s search algorithm is one of the most famous quantum algorithms, which enables search in unstructured dataspaces with a quadratic speedup over any known classical algorithm. This is one of the first algorithms to show quantum advantage over classical methods of computation. Besides its most anticipated application of brute force attack on symmetric key encryptions like AES, it is today being used in many modern applications as a subroutine. In this chapter, we describe the mathematical model of Grover’s quantum search algorithm, its behavior, and the theory of its circuit implementation. This chapter also discusses an exact variant of this algorithm and recent applications of Grover’s quantum search.

CRC Press eBooksMar 24, 20260 citations