Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with grovers-algorithm
Search options not deleted
user 15679
Grover's search algorithm is an algorithm that can perform a search in the order of square root of the input size. This is a provable speed up over the best classical algorithm, which requires a time of order N to perform a search.
2
votes
Accepted
To program Grover algorithm oracle, we need to know the answer already, if we know the answe...
You don't need to know the answer to build the oracle for Grover. The Oracle only needs to only be able to "mark" the state you're looking for. In a real-life application, you wouldn't be looking for …
- 585
2
votes
1
answer
1k
views
Oblivious Amplitude Amplification
I've been looking for the OAA paper but I've been unsuccessful in finding it. (so any links will also be helpful)
My question is essentially this, given the state:
$$\vert 0good \rangle + \vert 1bad \ …
- 585
1
vote
Is it possible to run the Grover algorithm under specific condition
Yes, it's possible. In Grover, or more generally amplitude amplification, you perform the following repeatedly:
Reflect on the good space
Reflect on the initial state
During the reflection about the …
- 585