New answers tagged complexity-theory
0
votes
Equivalence checking of quantum circuits up to error
Sam's link to the posting on tcs answers the OP's question - but here's some other comments that were hinted at here and there.
The exact classical problem is coNP-complete as this reduces to ...
4
votes
Accepted
Why is it hard to prove complexity bounds for variational algorithms?
The goal of a variational quantum algorithm is to minimize a cost function $f(\theta)$ over $\theta$ where evaluating $f$ involves the output of a quantum computer. In short, the quantum computer ...
- 106
6
votes
Why is it hard to prove complexity bounds for variational algorithms?
Looking for a solution by following a heuristic criteria means that you are proceeding by intuition, which has no proof of being correct nor efficient. You propose a heuristic, you show the results, ...
- 1,566
Top 50 recent answers are included