New answers tagged

2 votes
Accepted

Quantum computation of classical Fisher information

Section 3 of this paper talks about strategies to obtain the classical Fisher information in a NISQ computing setting. More concretely, this recent preprint details how to measure it in practice with ...
David Wierichs's user avatar
2 votes

What's the case when parameter-shift rule does not hold?

Judging from the citations for the parameter-shift rule, it seems that the referenced paper only considers the rule for generators $V$ with two eigenvalues. There is a number of works generalizing ...
David Wierichs's user avatar
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 ...
Samantha's user avatar
  • 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, ...
Daniele Cuomo's user avatar

Top 50 recent answers are included