Generalization and Demonstration of an Entanglement Based Deutsch-Jozsa Like Algorithm Using a 5-Qubit Quantum Computer

TL;DR

This paper generalizes a quantum algorithm based on entanglement to determine if functions are constant or balanced, demonstrating its effectiveness on IBM's 5-qubit quantum computer with high fidelity.

Contribution

It extends a previous quantum algorithm to a more general form and experimentally verifies its advantage over classical methods using a 5-qubit quantum computer.

Findings

Deterministic solutions for function classification achieved

Algorithm successfully implemented on IBM's 5-qubit quantum computer

High fidelity results confirm practical viability

Abstract

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.