Quantum Search Algorithm for Set Operation
| dc.creator | Pang, Chao-Yang | |
| dc.creator | Ding, Cong-Bao | |
| dc.creator | Hu, Ben-Qiong | |
| dc.date | 2008-06-09 | |
| dc.date.accessioned | 2026-07-07T09:43:32Z | |
| dc.date.available | 2026-07-07T09:43:32Z | |
| dc.description | 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 intersection is presented. And its running time is sqrt(|A|*|B|*|C|) for set operation C = A intersection B, 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 also. Keywords: Set operation, General Grover iteration, Grover's algorithm | |
| dc.description | 15 page 2 Figure | |
| dc.identifier | https://arxiv.org/abs/0806.1539 | |
| dc.identifier | http://arxiv.org/abs/0806.1539 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/162594 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum Search Algorithm for Set Operation | |
| dc.type | text |