2017/08/31 by Sayan Gangopadhyay, Manabputra, Bikash K. Behera +1
Physics and Astronomy · #quant-ph
paper · pdf · doi:10.1007/s11128-018-1932-8
published as Quantum Inf. Process. 17, 160 (2018) · 6 pages, 6 figures
arxiv created 2018/05/22 · arxiv updated 2018/05/30
This paper demonstrates the use of entanglement resources in quantum speedup by presenting an algorithm which is the generalization of an algorithm proposed by Goswami and Panigrahi [arXiv:1706.09489 (2017)]. We generalize the algorithm and show that it provides deterministic solutions having an advantage over classical algorithm. The algorithm answers the question of whether a given function is constant or balanced and whether two functions are equal or unequal. Finally, we experimentally verify the algorithm by using IBM's five-qubit quantum computer with a high fidelity.