# Quantum search algorithm for set operation

Quantum search algorithm for set operation 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

# Quantum search algorithm for set operation

, Volume 12 (1) – Mar 24, 2012
12 pages

/lp/springer_journal/quantum-search-algorithm-for-set-operation-p4FiGovxRJ
Publisher
Springer US
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-012-0385-8
Publisher site
See Article on Publisher Site

### Abstract

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.

### Journal

Quantum Information ProcessingSpringer Journals

Published: Mar 24, 2012

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations