DocumentCode
2054934
Title
Sorting N elements using quantum entanglement sets
Author
Odeh, Ammar ; Elleithy, Khaled ; Almasri, M. ; Alajlan, Abrar
Author_Institution
Dept. of Comput. Sci. & Eng., Univ. of Bridgeport, Bridgeport, CT, USA
fYear
2013
fDate
29-31 Aug. 2013
Firstpage
213
Lastpage
216
Abstract
To search for an element in an unsorted database, it requires O(N) operations using classical computers, where it takes only O(√ N) operations in quantum systems. In this paper, we provide an in-depth look at the existing quantum searching algorithms and emphasize the quantum entanglement feature to propose a new technique for sorting N elements and thus improve the sorting process.
Keywords
database machines; quantum computing; sorting; classical computers; element sorting; quantum entanglement feature; quantum entanglement sets; quantum searching algorithms; quantum systems; unsorted database; Algorithm design and analysis; Computers; Databases; Partitioning algorithms; Quantum computing; Quantum entanglement; Sorting; Quantum entanglement; Quantum searching algorithms; element probability;
fLanguage
English
Publisher
ieee
Conference_Titel
Innovative Computing Technology (INTECH), 2013 Third International Conference on
Conference_Location
London
Print_ISBN
978-1-4799-0047-3
Type
conf
DOI
10.1109/INTECH.2013.6653693
Filename
6653693
Link To Document