Quantum Circuit for Calculating Mean Values Via Grover-like Algorithm

Abstract

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 $\mathcal{O}(2^n)$ steps. Our quantum algorithm is based on a Grover-like algorithm and it takes $\mathcal{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.

6 pages (3 files: 1 .tex, 1 .sty, 1 .eps). arXiv admin note: substantial text overlap with arXiv:1403.6910

References in corpus (3)

• Code Generator for Quantum Simulated Annealing
• Quantum Circuit for Calculating Symmetrized Functions Via Grover-like Algorithm
• Quantum Circuit for Calculating Mobius-like Transforms Via Grover-like Algorithm