Calculating Hamming Distance with the IBM Q Experience

José Manuel Bravo

doi:10.20944/preprints201804.0164.v1

Preprint Article Version 1 This version is not peer-reviewed

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)

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.

quantum algorithm; Hamming weight; Hamming distance

Your full name

Your affiliation information (e.g., name of your university/institution/organization)

Not displayed online.

Your Email address (not made public)

Please leave your comment to this article below.

Mathematical equations can be typed in either LaTeX formats \\[ ... \\] or $$ ... $$, or MathML format <math> ... </math>. Try the LaTeX or MathML example.

Type equation:

Preview:

Copy equation into message below

Close menu

Please click a symbol to insert it into the message box below:

Please enter the link here:

Optionally, you can enter text that should appear as linked text:

Copy link into message below

Close menu

Please enter or paste the URL to the image here (please only use links to jpg/jpeg, png and gif images):

Copy image into message below

Close menu

Type author name or keywords to filter the list of references in this group (you can add a new citation under Bibliography):

No existing citations in Discussion Group

Wikify editor is a simple editor for wiki-style mark-up. It was written by MDPI for Sciforum in 2014. The rendering of the mark-up is based on Wiky.php with some tweaks. Rendering of mathematical equations is done with MathJax. Please send us a message for support or for reporting bugs.

Close menu

Please declare any conflicts of interest you may have with this paper, financial or otherwise.

I do not have a conflict of interest

I would like to declare a conflict of interest

Display my name on the website I want to get recognition for my comment on Publons

[what’s this?]. Link your accounts here

Captcha

Try another

I accept the following conditions:

Comments must follow the standards of professional discourse and should focus on the scientific content of the article. Insulting or offensive language, personal attacks and off-topic remarks will not be permitted. Comments must be written in English. Preprints reserves the right to remove comments without notice. Readers who post comments are obliged to declare any competing interests, financial or otherwise.

Notify me about updates to this article or when a peer-reviewed version is published.

Calculating Hamming Distance with the IBM Q Experience

Abstract

Subject Areas

Readers' Comments and Ratings (0)