Quantum Algorithm for Sort Problem
Year: 2012
Type: article
Abstract: A quantum algorithm for the sort problem and its example are reported. When n natural numbers that are arranged at random and may be included some parts of same them are arranged in order of size, a computational complexity of a classical computation is n(n − 1)/2[= Z]. In the quantum algorithm by using quantum phase inversion gates and quantum inversion about mean gates, its computational complexity is about n 3/2 [= S]. Therefore, a high-speed process becomes possible because S/Z is about 1/n 1/2 .
Author: Toru Fujimura
Institution: Industrial Property Cooperation Center
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2587808468