Quantum circuits for new applications of the Deutch-Jozsa algorithm
José Manuel Bravo · 2018
In this paper a serial of new applications on binary strings based on the Deutch-Jozsa algorithm are presented. These new applications can be used to calculate the Hamming weight and the Hamming distance of a binary string or to compare if two binary strings have the same Hamming weight or the same Hamming distance. To test the applications the quantum computer prototype that IBM has given open access to on the cloud has been used to test the results.