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

Source: [Generalization and Demonstration of an Entanglement Based Deutsch-Jozsa Like Algorithm Using a 5-Qubit Quantum Computer](<https://www.sota2.com/research/paper/68fa37c01e209131ce8b4f19>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-24T22:35:17.141Z

Authors: Sayan Gangopadhyay, Manabputra, Bikash K. Behera, Prasanta K. Panigrahi

Published: 2017-08-21T18:24:09.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1708.06375>)

[PDF](<https://arxiv.org/pdf/1708.06375.pdf>)
