4
$\begingroup$

Let us have a Hamiltonian $H$ and a state $|\psi\rangle = \sum_i a_i |E_i\rangle$, a linear combination of eigenstates $|E_i\rangle$ of $H$ with eigenvalues $E_i$. What is the best way to achieve a Heisenberg-limited measurement of the energy of $\psi$, $E_\psi = \sum_i a_i E_i$.

If $\psi$ were an eigenstate, Quantum Phase Estimation provides an answer. However, if it were not we would have to sample the result of QPE subsequently. I have also considered an old Grover paper to compute the mean of a probability distribution, with an additional $O(1/\epsilon)$ overhead over QPE (already $O(1/\epsilon)$). Is there a way to do it better?

$\endgroup$
7
  • 1
    $\begingroup$ Dumb question but what's wrong with sampling? $\endgroup$ Commented Aug 7 at 17:57
  • $\begingroup$ Not dumb, it's just that the scaling would be $O(1/\epsilon^2)$, right? And we'd prefer to achieve $O(1/\epsilon)$. $\endgroup$
    – Pablo
    Commented Aug 7 at 19:19
  • 1
    $\begingroup$ Thanks! My poor-man's "computer-science" mind is wondering what you mean by the Heisenberg limit? There's a time-energy uncertainty in the precision you'd get from the Quantum Phase Estimation even if $|\psi\rangle$ where promised to be an eigenstate of $H$, because you'd need to actually simulate $\exp(-iHt)$ many times to avoid conflict with the No-Fast-Forwarding Theorem. But I don't think that's what you mean by the Heisenberg limit, is it? $\endgroup$ Commented Aug 7 at 19:35
  • 1
    $\begingroup$ I think it is! In Quantum Phase Estimation you need to call the unitary $U = e^{-iH\tau}$ $O(1/\epsilon)$ times to achieve precision $\epsilon$ in the measurement. The thing is, when you do QPE, you will measure the energy of one eigenstate in the superposition, so you'd need to sample $O(1/\epsilon^2)$ many points to get an expectation value of the average of the distribution. So overall the cost would be $O(1/\epsilon^3)$. The question is improving this to inverse linear. $\endgroup$
    – Pablo
    Commented Aug 7 at 21:11
  • $\begingroup$ It seems that if you want to get a better accuracy than $1/\epsilon^3$ you will need protocols which use several copies of $|\psi\rangle$ at once, since otherwise there is nothing which distinguishes $|\psi\rangle$ from a mixture of eigenstates, so repeated phase estimation and averaging should be optimal in that case. --- Does the Grover method give you $1/\epsilon^2$? $\endgroup$ Commented Aug 8 at 10:24

3 Answers 3

4
$\begingroup$

Here is a suggestion how to obtain a Heisenberg-limited energy estimation -- there's several details to be filled in, though.

You can run phase estimation on $N$ copies of the state, $|\Psi\rangle :=|\psi\rangle^{\otimes N}$, for $$ \mathcal H = \tfrac1N\sum H_i\ , $$ where $H_i$ is the Hamiltonian $H$ acting on the $i$'th copy. Note that the energy expectation value of $\mathcal H$ in $|\Psi\rangle$ is the same as that of $H$ in $|\psi\rangle$.

For each energy eigenstate of $\mathcal H$, you will get Heisenberg-limited accuracy for the energy. On the other hand, as the number of copies increases, the probability to be in an eigenstate with an energy $\delta$-close to the average energy (that is, in a $\delta$-typical subspace) will converge exponentially due to the central limit theorem -- which is essence means that with correspondingly high probability, the phase estimation will return a value $\delta$-close to the desired average. Choosing $\delta$ sufficiently smaller than the desired accuracy $\epsilon$ (e.g. $\epsilon/2$, and run phase estimation with accuracy $\epsilon/2$) and then $N$ sufficiently large should give the desired result.

$\endgroup$
8
  • $\begingroup$ Thanks Norbert! What I am worried about this is that the central limit theorem converges with $\delta = O(N^{-1/2})$, so in practice this adds up another multiplicative cost actor of $\delta^2$. Would this not be the case? But perhaps you mean using something like the median lemma in arxiv.org/abs/0904.1549 which does indeed converge exponentially fast for the number of copies $N$. However, this requires the probability of each individual estimate to be away from the center to be small; which I think we do not have here. $\endgroup$
    – Pablo
    Commented Aug 8 at 11:19
  • $\begingroup$ @Pablo My point about the central limit theorem is a different one (so I think): My point is that if you draw a random eigenstate of $|\psi\rangle^{\otimes N}$, then the probability that its energy is $\delta$-close to the average should converge quite rapidly in N -- at least so I seem to remember. But I would have to check the precise statement; often in applications of typicality one just uses the fact that it converges (Chebychev), without looking at the convergence behavior. And it might well be that the minimum N needed to get a sufficiently large probability scales as $1/\delta^2$. $\endgroup$ Commented Aug 8 at 11:43
  • $\begingroup$ @Pablo Note that a priori a large $N$ is not problematic, since the computational time does not scale with $N$, at least not in a naive way. (The error in $\langle \mathcal H\rangle$ is the same as the error in $\langle H\rangle$, so it is independent of $N$.) Of course, for large $N$, this in essence means that we want relative low accuracy for the evolution under each $H_i$, which might be a differently scaling (and possibly not-so-well-analyzed) regime. $\endgroup$ Commented Aug 8 at 11:47
  • $\begingroup$ @NorbertSchuch what advantage do you get in running QPE on $\mathcal H$? Surely each $H_i$ commute? $\endgroup$ Commented Aug 8 at 11:58
  • $\begingroup$ Oh. Perhaps I am beginning to understand. Even though $[H_i,H_k]=0$, the top register of the QPE circuit doesn’t know that. You can double the number of times you simulate $\mathcal H$ in the QPE circuit, and halve the error in your overall estimation of $|\psi\rangle$’s energy… $\endgroup$ Commented Aug 8 at 12:17
1
$\begingroup$

I may be wrong about this but when you run the QPE on some state $|\psi\rangle$ by simulating some Hamiltonian $H$, your precision is limited at least by:

  1. The error in the simulation of $U=\exp(-iHt)$;
  2. The precision you decide to choose for the phase estimation with the (inverse) Fourier transform; and
  3. The number of times you have to sample from the QPE using multiple copies of $|\psi\rangle$.

You can increase the precision with the first factor by using a larger Trotter factor or using more sophisticated Hamiltonian simulation. You can increase the precision of the second by adding an additional qubit of precision but you're still limited by the No Fast-Forwarding Theorem and you'd need to run your circuit for twice as long for each qubit of precision:

Phase Estimation from Wikipedia

As for the third factor, if we are promised that $|\psi\rangle$ is an eigenstate then we only need to run the circuit once, because we'll get the phase right away. If $|\psi\rangle$ is in a superposition of two or more eigenstates and we don't know how much each contributes to $|\psi\rangle$, then I think you're right that statistics tells us the number of times we need to call the QPE grows quadratically.

But I think it's somewhat similar to a classical test. If we are given an audio signal that we are promised is a pure tone, and we have magical Born-rule box that will let us sample from the signal to return its frequency, it only takes one sample for us to know what the tone is. If we are given a signal that's a sum of two or more tones and we don't know the weight of each pure tone with respect to our signal, then I'm still pretty sure we'd have to run our Born box for a quadratic number of times to get a good estimte of $E_\psi$.

$\endgroup$
1
  • $\begingroup$ What I am looking for is a way to eliminate the third factor somehow. $\endgroup$
    – Pablo
    Commented Aug 8 at 11:22
1
$\begingroup$

I think some of the methods discussed in https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.129.240501 would work.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.