Generalization and demonstration of an entanglement-based Deutsch-Jozsa-like algorithm using a 5-qubit quantum computer

Gangopadhyay, Sayan and Manabputra, and Behera, Bikash K and Panigrahi, Prasanta K (2018) Generalization and demonstration of an entanglement-based Deutsch-Jozsa-like algorithm using a 5-qubit quantum computer. In: QUANTUM INFORMATION PROCESSING, 17 (7).

PDF Qua_Inf_Pro_17-7_2018.pdf - Published Version Restricted to Registered users only Download (529kB) | Request a copy

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 (Essentiality of entanglement in a quantum algorithm, 2017.arXiv:1706.09489). 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.

Item Type:	Journal Article
Publication:	QUANTUM INFORMATION PROCESSING
Publisher:	SPRINGER, 233 SPRING ST, NEW YORK, NY 10013 USA
Additional Information:	Copy right of this article belong to SPRINGER, 233 SPRING ST, NEW YORK, NY 10013 USA
Department/Centre:	UG Programme
Date Deposited:	12 Jun 2018 16:01
Last Modified:	12 Jun 2018 16:01
URI:	http://eprints.iisc.ac.in/id/eprint/59984

Actions (login required)

View Item