Quantum Circuit for Calculating Mean Values Via Grover-like Algorithm
暂无分享,去创建一个
In this paper, we give a quantum circuit for calculating the mean value of a function $A(x^n)\in \mathbb{C}$, where $x^n\in \{0,1\}^n$. Known classical algorithms for calculating the mean value of a structureless function $A(x^n)$ take ${\cal O}(2^n)$ steps. Our quantum algorithm is based on a Grover-like algorithm and it takes ${\cal O}(\sqrt{2^n})$ steps. Our algorithm differs significantly from previously proposed quantum algorithms for calculating the mean value of a function via Grover's algorithm.
[1] G. Brassard,et al. Quantum Amplitude Amplification and Estimation , 2000, quant-ph/0005055.
[2] Gilles Brassard,et al. An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance , 2011, ArXiv.
[3] Code Generator for Quantum Simulated Annealing , 2009, 0908.1633.
[5] Lov K. Grover. Quantum Computers Can Search Rapidly by Using Almost Any Transformation , 1998 .