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 quantum-computer
Search options not deleted
user 252758
The quantum computing tag is relevant for computing that uses quantum states such as superposition and/or entanglement to locate low energy states as solutions to complex problems (rather than laboriously enumerating and checking solutions as would be done with non-quantum traditional computing).
2
votes
1
answer
107
views
Shor's algorithm entanglement verification
I would like to ask whether the entanglement verification is necessary in Shor's algorithm
In the paper, Nature Photon 6, 773–776 (2012), they mentioned that they tried to factorize 21 to avoid the en …
- 183
1
vote
1
answer
344
views
Number of qubits required in Shor's algorithm
People say that the number of qubits required in Shor's algorithm for factorizing $N$ should be
$2\log N$ for control register and $\log N$ for target register.
What is the reason why these numbers of …
- 183