Measuring Hamming Distance between Boolean Functions via Entanglement Measure
arXiv:1903.04762
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.
arXiv comment12 pages, 6 figures, Preliminary draft
References in corpus (12)
- Quantum entanglement
- Quantum Mechanics helps in searching for a needle in a haystack
- Entanglement detection
- Satellite-to-ground quantum key distribution
- Quantum state tomography via compressed sensing
- Grover's quantum searching algorithm is optimal
- Taming multiparticle entanglement
- Concurrence of arbitrary dimensional bipartite quantum states
- Concurrence of mixed bipartite quantum states in arbitrary dimensions
- Optimal entanglement witnesses based on local orthogonal observables
- Accessible nonlinear entanglement witnesses
- A Quantum Algorithm for Testing Junta Variables and Learning Boolean Functions via Entanglement Measure