Sorting N elements using quantum entanglement sets
Ammar Odeh, Khaled M. Elleithy, Marwah Mohammad Almasri, Abrar Mohammed Alajlan · 2013
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.