•  
  •  
 

Author Country (or Countries)

Egypt

Abstract

In this work, we revisit the algorithm proposed in [Results in Physics 15 (2019) 102549] for solving an extended variant of the Deutsch-Jozsa problem. This algorithm classifies an arbitrary oracle Uf to one of 2n classes based on the concurrence measure. Here, we reformulate the mathematical proof of this algorithm in detail based on the first technique of the degree of entanglement quantum computing model.

Suggested Reviewers

N/A

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/150513

Share

COinS