Weakly measured while loops: peeking at quantum states
Preprint
Abstract
A while loop tests a termination condition on every iteration. On a quantum computer, such measurements perturb the evolution of the algorithm. We define a while loop primitive using weak measurements, offering a trade-off between the perturbation caused and the amount of information gained per iteration. This trade-off is adjusted with a parameter set by the programmer. We provide sufficient conditions that let us determine, with arbitrarily high probability, a worst-case estimate of the number of iterations the loop will run for. As an example, we solve Grover's search problem using a while loop and prove the quadratic quantum speed-up is maintained.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Quantum feedback: Theory, experiments, and applicationsPhysics Reports, 2017
- Foundations of Quantum Programming2016
- Quantum loop programsActa Informatica, 2010
- Critically Damped Quantum SearchPhysical Review Letters, 2009
- Quantum control of a single qubitPhysical Review A, 2007
- A straightforward introduction to continuous quantum measurementContemporary Physics, 2006
- Quantum programming languages: survey and bibliographyMathematical Structures in Computer Science, 2006
- Towards a quantum programming languageMathematical Structures in Computer Science, 2004
- Quantum Computation and Information2002
- Quantum feedback with weak measurementsPhysical Review A, 2000