Preprint Article Version 2 Preserved in Portico This version is not peer-reviewed

Calculating Hamming Distance with the IBM Q Experience

Version 1 : Received: 11 April 2018 / Approved: 12 April 2018 / Online: 12 April 2018 (09:37:53 CEST)
Version 2 : Received: 15 April 2018 / Approved: 16 April 2018 / Online: 16 April 2018 (08:12:56 CEST)

How to cite: Bravo, J.M. Calculating Hamming Distance with the IBM Q Experience. Preprints 2018, 2018040164. https://doi.org/10.20944/preprints201804.0164.v2 Bravo, J.M. Calculating Hamming Distance with the IBM Q Experience. Preprints 2018, 2018040164. https://doi.org/10.20944/preprints201804.0164.v2

Abstract

In this brief paper a quantum algorithm to calculate the Hamming distance of two binary strings of equal length (or messages in theory information) is presented. The algorithm calculates the Hamming weight of two binary strings in one query of an oracle. To calculate the hamming distance of these two strings we only have to calculate the Hamming weight of the xor operation of both strings. To test the algorithms the quantum computer prototype that IBM has given open access to on the cloud has been used to test the results.

Keywords

quantum algorithm; Hamming weight; Hamming distance

Subject

Computer Science and Mathematics, Information Systems

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.