Affiliation:
1. Dubna State University, Dubna, Russian Federation
Abstract
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.
Reference44 articles.
1. 1. A Fixed-Phase Quantum Search Algorithm with More Flexible Behavior / Kh Li [et al.] // J. of Quantum Information Science. – 2012. – No 2. – Pp. 28-34.
2. 2. Fixed-point quantum search with an optimal number of queries / T. Yoder [et al.] // arXiv:1409.3305v2 [quant-ph]. – 24 Nov 2014.
3. 3. Zhang, K., Korepin, V. E. Depth optimization of quantum search algorithms beyond Grover’s algorithm // arXiv:1908.04171v3 [quant-ph]. – 27 Mar 2020.
4. 4. Research on phases of Grover-type algorithms / B.-W. Ma [et al.] // arXiv:1801.07369v1 [quant-ph]. – 23 Jan 2018.
5. 5. Operating Quantum States in Single Magnetic Molecules: Implementation of Grover’s Quantum Algorithm / C. Godfrin [et al.] // arXiv:1710.11229v2 [quant-ph]. – 28 Nov 2017.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献