# Measuring Hamming Distance between Boolean Functions via Entanglement   Measure

**Authors:** Khaled El-Wazan

arXiv: 1903.04762 · 2019-03-13

## TL;DR

This paper introduces a quantum algorithm that efficiently measures the Hamming distance between Boolean functions by translating the problem into entanglement measurement using concurrence, enabling faster analysis of Boolean functions.

## Contribution

The paper presents a novel quantum algorithm that converts Hamming distance measurement into entanglement measurement, providing a new approach for analyzing Boolean functions.

## Key findings

- The algorithm efficiently computes Hamming distances using entanglement measures.
- It constructs a special black-box to facilitate the measurement process.
- The method demonstrates a quantum advantage in Boolean function analysis.

## Abstract

In this paper, we present a fast quantum algorithm to measure the Hamming distance between two or more Boolean functions provided as black-boxes. The proposed algorithm constructs a new black-box with a certain property which is utilized to solve this problem. The introduced algorithm converts measuring the Hamming distance between Boolean functions to measuring entanglement between qubits, using concurrence entanglement measure.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1903.04762/full.md

## Figures

6 figures with captions in the complete paper: https://tomesphere.com/paper/1903.04762/full.md

## References

32 references — full list in the complete paper: https://tomesphere.com/paper/1903.04762/full.md

---
Source: https://tomesphere.com/paper/1903.04762