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 complexity-theory
Search options not deleted
user 20191
For questions regarding complexity analysis of quantum algorithms and comparisons with complexities of classical algorithms.
5
votes
Accepted
If sampling the output of $U_1U_2$ is easy, is sampling the output of $(U_1U_2)^\dagger$ als...
We know that
$$\begin{eqnarray} P_{(U_1U_2)^{\dagger}}(y\ \vert\ x) &=& \left\vert\langle y\vert(U_1U_2)^{\dagger}\vert x\rangle\right\vert^2 = \left\vert\left(\langle x\vert U_1U_2\vert y\rangle\righ …
- 183