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

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.

arXiv comment6 pages, 6 figures

References in corpus (10)

• Experimental Comparison of Two Quantum Computing Architectures
• Performing Quantum Computing Experiments in the Cloud
• Experimental test of Mermin inequalities on a 5-qubit quantum computer
• Entropic uncertainty and measurement reversibility
• Experimental realization of quantum cheque using a five-qubit quantum computer
• Experimental realization of nondestructive discrimination of Bell states using a five-qubit quantum computer
• Leggett-Garg test of superconducting qubit addressing the clumsiness loophole
• Design and experimental realization of an optimal scheme for teleportion of an $n$-qubit quantum state
• Demonstrating non-Abelian braiding of surface code defects in a five qubit experiment
• Teleportation of a qubit using entangled non-orthogonal states: A comparative study

Cited by in corpus (12)

• Demonstration of Entanglement Purification and Swapping Protocol to Design Quantum Repeater in IBM Quantum Computer
• Experimental Demonstration of Non-local Controlled-Unitary Quantum Gates Using a Five-qubit Quantum Computer
• Designing Quantum Router in IBM Quantum Computer
• Experimental realization of quantum teleportation using coined quantum walks
• Nondestructive discrimination of a new family of highly entangled states in IBM quantum computer
• Hybrid digital-analog simulation of many-body dynamics with superconducting qubits
• Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer
• Experimental demonstration of the violations of Mermin's and Svetlichny's inequalities for W- and GHZ-class of states
• Quantum Robots Can Fly; Play Games: An IBM Quantum Experience
• A simulational model for witnessing quantum effects of gravity using IBM quantum computer
• Solving diner's dilemma game, circuit implementation, and verification on IBMQ simulator
• Quantum resources in Harrow-Hassidim-Lloyd algorithm