Grover’s quantum search in 4-Qubit system using the new unitary transformation
Grover’s quantum search in 4-Qubit system using the new unitary transformation
Kosar Al-Sadat Mousavi Taha1 hossein movahedian2
1) MA, Industrial University of Shahrood, Shahrood, Iran Email:
2) Department of Physics, College of Physics, Industrial University of Shahrood, Shahrood, Iran
IOI Code
:
XYCZ-AAGKH
Publication :
International Conference on Engineering and Applied Science(iceasconf.com)
Abstract :
Grover quantum search algorithm is one of the important algorithms in quantum computing. The classic search algorithm requires a search that repetition number of algorithm is O(N), however in Grover quantum search algorithm , the number of quantum computing search is . The sensible feature of the Grover search algorithm is to create superposition. In this paper, introducing a new optional unity transformation in a 4Kbits system , we show that the quantum algorithm is not sensitive to the initial state of system and it solves the search faster than the classic algorithm by creating superposition of all initial states of the system.
Keywords : quantum computer grover’s quantum search algorithm superposition new arbitrary transformation sensitivity grover’s search algorithm