A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Model and Training of QNN with Weight
Neural Processing Letters
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Quantum Search with Variable Times
Theory of Computing Systems - Special Title: Symposium on Theoretical Aspects of Computer Science; Guest Editors: Susanne Albers, Pascal Weil
Quantum Computation and Quantum Information: 10th Anniversary Edition
Quantum Computation and Quantum Information: 10th Anniversary Edition
Multiparty controlled quantum secure direct communication based on quantum search algorithm
Quantum Information Processing
| Hi-index | 0.00 |
The operations of data set, such as intersection, union and complement, are the fundamental calculation in mathematics. It's very significant that designing fast algorithm for set operation. In this paper, the quantum algorithm for calculating intersection set $${\text{C}=\text{A}\cap \text{B}}$$ is presented. Its runtime is $${O\left( {\sqrt{\left| A \right|\times \left| B \right|\times \left|C \right|}}\right)}$$ for case $${\left| C \right|\neq \phi}$$ and $${O\left( {\sqrt{\left| A \right|\times \left| B \right|}}\right)}$$ for case $${\left| C \right|=\phi}$$ (i.e. C is empty set), while classical computation needs O (|A| 脳 |B|) steps of computation in general, where |.| denotes the size of set. The presented algorithm is the combination of Grover's algorithm, classical memory and classical iterative computation, and the combination method decrease the complexity of designing quantum algorithm. The method can be used to design other set operations as well.