Authors: K Uyanık S Turgut
Publish Date: 2013/07/02
Volume: 12, Issue: 11, Pages: 3395-3409
Abstract
In two recent papers a suresuccess version of the Grover iteration has been applied to solve the weight decision problem of a Boolean function and it is shown that it is quadratically faster than any classical algorithm Braunstein et al in J Phys A Math Theor 408441 2007 Choi and Braunstein in Quantum Inf Process 10177 2011 In this paper a new approach is proposed to generalize the Grover’s iteration so that it becomes exact and its application to the same problem is studied The regime where a small number of iterations is applied is the main focus of this work This task is accomplished by presenting the conditions on the decidability of the weights where the decidability problem is reduced to a system of algebraic equations of a single variable Thus it becomes easier to decide on distinguishability by solving these equations analytically and if not possible numerically In addition it is observed that the number of iterations scale as the square root of the iteration number of the corresponding classical probabilistic algorithms
Keywords: