|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Quantum Multi-object Search Algorithm with the Availability of Partial Information | | Goong Chen
; Zijian Diao
; | | Date: |
6 Nov 2000 | | Subject: | quant-ph | | Abstract: | Consider the unstructured search of an unknown number l of items in a large unsorted database of size N. The multi-object quantum search algorithm consists of two parts. The first part of the algorithm is to generalize Grover’s single-object search algorithm to the multi-object case and the second part is to solve a counting problem to determine l. In this paper, we study the multi-object quantum search algorithm (in continuous time), but in a more structured way by taking into account the availability of partial information. The modeling of available partial information is done simply by the combination of several prescribed, possibly overlapping, information sets with varying weights to signify the reliability of each set. The associated statistics is estimated and the algorithm efficiency and complexity are analyzed. Our analysis shows that the search algorithm described here may not be more efficient than the unstructured (generalized) multi-object Grover search if there is ``misplaced confidence’’. However, if the information sets have a ``basic confidence’’ property in the sense that each information set contains at least one search item, then a quadratic speedup holds on a much smaller data space, which further expedite the quantum search for the first item. | | Source: | arXiv, quant-ph/0011019 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER