Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Innovative Computing Technology

Sorting N elements using quantum entanglement sets

Ammar Odeh, Khaled M. Elleithy, Marwah Mohammad Almasri, Abrar Mohammed Alajlan

Published Aug 1, 2013• 7 citations
Publisher

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.

DOI
10.1109/intech.2013.6653693

Related papers

Quantum sort algorithm based on entanglement qubits {00, 11}

Ammar Odeh, Eman Abdelfattah

Quantum algorithms have gained a lot of consideration especially for the need of searching unsorted database in a faster way rather than using the classical search mechanisms. This paper introduces a new quantum sort algorithm by employing the quantum features to expedite the searching process in conventional environments. The proposed efficient sorting algorithm emphasizes entanglement qubits property to sort N positive integers.

IEEE Long Island Systems, Applications and Technology Conference (LISAT)•Apr 1, 2016•7 citations

Quantum database search can do without sorting

Apoorva D. Patel

Sorting is a fundamental computational process that facilitates subsequent searching of a database. It can be thought of as factorization of the search process. The location of a desired item in a sorted database can be found by classical queries that inspect one letter of the label at a time. For an unsorted database, no such classical quick search algorithm is available. If the database permits quantum queries, however, then mere digitization is sufficient for efficient search. Sorting becomes redundant with the quantum superposition of states. A quantum algorithm is written down that locates the desired item in an unsorted database a factor of two faster than the best classical algorithm can in a sorted database. This algorithm has close resemblance to the assembly process in DNA replication.

arXiv:quant-ph/0012149•Physical Review A•Aug 15, 2001•18 citations

Finding Matches between Two Databases on a Quantum Computer

Mark Heiligman

Given two unsorted lists each of length N that have a single common entry, a quantum computer can find that matching element with a work factor of $O(N^{3/4}\log N)$ (measured in quantum memory accesses and accesses to each list). The amount of quantum memory required is $O(N^{1/2})$. The quantum algorithm that accomplishes this consists of an inner Grover search combined with a partial sort all sitting inside of an outer Grover search.

arXiv:quant-ph/0006136•Jun 30, 2000•14 citations

An Improved Quantum Search Algorithm

Amrita Mitra

If we have to search an unsorted database or solve an unstructured search problem, we can use a quantum search algorithm [1]. As of now, a quantum search algorithm like Grover’s algorithm [2] takes Ω( N ) time, where N is the size of the search space. This paper proposes an improved quantum search algorithm that yields the correct result in constant time with a high probability.

Journal of Quantum Information Science•Jan 1, 2025•0 citations

Quantum Entanglement-Based Quantum Search

Jincheng Zhang

Quantum entanglement, a bizarre and fundamental property of quantum mechanics, presents a potentially revolutionary approach to computation and search. This paper explores the development of a novel quantum search algorithm predicated on entanglement, aiming to surpass the limitations of traditional methods by offering enhanced efficiency and potential for tackling complex data sets. We detail the core mechanism of this algorithm, emphasizing its reliance on the unique correlations inherent in entangled states, and present a preliminary analysis of its performance characteristics. The investigation will focus on demonstrating the algorithm's capability to efficiently locate specific data points within a large dataset, highlighting the conceptual advantages over existing search techniques. The core claim is that this quantum search algorithm achieves significantly improved performance, particularly in scenarios with high dimensionality or complex search spaces. We conclude with a discussion of potential future directions and challenges in implementing this algorithm.

•Aug 31, 2026•0 citations

Efficient simulation of quantum-based searching

Tamás Varga, László Bacsárdi

The efficient search in unsorted database is extremely important for our everydays' applications. This type of search is useful in communication networks as well, since routing can be considered as a search in the database of the routing table. From the viewpoint of quantum computing, the not quantum-based solutions are named as classical. The search could be very time-consuming and computationally task if we need to solve it using classical algorithms, particularly for large data sets. This process can be accelerated and be more efficient by the application of quantum search algorithms. To investigate the quantum search, we have developed a Java-based system to simulate different quantum algorithms which are based on elementary quantum gates. In our model, we took into account the computation errors of the elementary quantum gates. We analyzed how these errors affect the efficiency of quantum search.

International Conference on Software, Telecommunications and Computer Networks (SoftCOM)•Sep 1, 2014•2 citations
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.
Sorting is a fundamental computational process that facilitates subsequent searching of a database. It can be thought of as factorization of the search process. The location of a desired item in a sorted database can be found by classical queries that inspect one letter of the label at a time. For an unsorted database, no such classical quick search algorithm is available. If the database permits quantum queries, however, then mere digitization is sufficient for efficient search. Sorting becomes redundant with the quantum superposition of states. A quantum algorithm is written down that locates the desired item in an unsorted database a factor of two faster than the best classical algorithm can in a sorted database. This algorithm has close resemblance to the assembly process in DNA replication.
Given two unsorted lists each of length N that have a single common entry, a quantum computer can find that matching element with a work factor of O(N3/4log⁡N)O(N^{3/4}\log N)O(N3/4logN) (measured in quantum memory accesses and accesses to each list). The amount of quantum memory required is O(N1/2)O(N^{1/2})O(N1/2). The quantum algorithm that accomplishes this consists of an inner Grover search combined with a partial sort all sitting inside of an outer Grover search.
Quantum entanglement, a bizarre and fundamental property of quantum mechanics, presents a potentially revolutionary approach to computation and search. This paper explores the development of a novel quantum search algorithm predicated on entanglement, aiming to surpass the limitations of traditional methods by offering enhanced efficiency and potential for tackling complex data sets. We detail the core mechanism of this algorithm, emphasizing its reliance on the unique correlations inherent in entangled states, and present a preliminary analysis of its performance characteristics. The investigation will focus on demonstrating the algorithm's capability to efficiently locate specific data points within a large dataset, highlighting the conceptual advantages over existing search techniques. The core claim is that this quantum search algorithm achieves significantly improved performance, particularly in scenarios with high dimensionality or complex search spaces. We conclude with a discussion of potential future directions and challenges in implementing this algorithm.
The efficient search in unsorted database is extremely important for our everydays' applications. This type of search is useful in communication networks as well, since routing can be considered as a search in the database of the routing table. From the viewpoint of quantum computing, the not quantum-based solutions are named as classical. The search could be very time-consuming and computationally task if we need to solve it using classical algorithms, particularly for large data sets. This process can be accelerated and be more efficient by the application of quantum search algorithms. To investigate the quantum search, we have developed a Java-based system to simulate different quantum algorithms which are based on elementary quantum gates. In our model, we took into account the computation errors of the elementary quantum gates. We analyzed how these errors affect the efficiency of quantum search.