Set . Applying the inverse quantum Fourier transform to the register in part (a) gives probability amplitude at label equal to
Choose nearest to , with reduced modulo at the phase boundary. Then the difference can be represented with . For , sum the finite geometric series to obtain
Let . On , concavity of sine gives , the line through its endpoint values. Also . Therefore
and the Born rule proves the nearest-integer success bound for quantum phase estimation:
If , every summand is one and the probability is exactly one. If the scaled phase is halfway between two integers, either nearest label separately satisfies the displayed bound. Interpreting the measured integer as gives the closest available -bit phase estimate modulo one.

Articles by others on the same topic (0)

There are currently no matching articles.