• Corpus ID: 96425487

Measuring Hamming Distance between Boolean Functions via Entanglement Measure

  title={Measuring Hamming Distance between Boolean Functions via Entanglement Measure},
  author={Khaled El-Wazan},
  journal={arXiv: Quantum Physics},
  • Khaled El-Wazan
  • Published 12 March 2019
  • Computer Science
  • arXiv: Quantum Physics
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. 

Figures from this paper

Quantum Classification Algorithm Based on Competitive Learning Neural Network and Entanglement Measure

A novel classification algorithm that is based on the integration between competitive learning and the computational power of quantum computing and uses the entanglement measure after applying unitary operators to conduct the competition between neurons in order to find the winning class based on wining-take-all.



A Quantum Algorithm for Testing Junta Variables and Learning Boolean Functions via Entanglement Measure

A fast quantum algorithm is proposed to test whether or not a certain variable in the function $f$ is a junta variable and creates entanglement between the variable under test and an auxiliary qubit, where theEntanglement is measured using concurrence measure to decide if the variable is junta.

Concurrence of mixed bipartite quantum states in arbitrary dimensions.

A lower bound for the concurrence of mixed bipartite quantum states is derived, valid in arbitrary dimensions, from a weaker, purely algebraic estimate, which detects mixed entangled states with a positive partial transpose.

Entanglement detection

Quantum computation and quantum information

  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal

Concurrence of arbitrary dimensional bipartite quantum states.

An analytical lower bound for the concurrence of a bipartite quantum state in arbitrary dimension is derived relating concurrence, the Peres-Horodecki criterion, and the realignment criterion and is demonstrated that it is exact for some mixed quantum states.

Optimal entanglement witnesses based on local orthogonal observables

We show that the entanglement witnesses based on local orthogonal observables, which were introduced by Yu and Liu [Phys. Rev. Lett. 95, 150504 (2005)] and G\"uhne et al. [Phys. Rev. A 74, 010301(R)

Experimentally identifying the entanglement class of pure tripartite states

We use concurrence as an entanglement measure and experimentally demonstrate the entanglement classification of arbitrary three-qubit pure states on a nuclear magnetic resonance quantum information

Experimental determination of entanglement with a single measurement

A linear optics experiment is reported in which a pure-state entanglement measure is directly observed, namely concurrence, which is measured with a single, local measurement on just one of the photons.

Rapid solution of problems by quantum computation

  • D. DeutschR. Jozsa
  • Computer Science
    Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
  • 1992
A class of problems is described which can be solved more efficiently by quantum computation than by any classical or stochastic method. The quantum computation solves the problem with certainty in

Quantum entanglement

All our former experience with application of quantum theory seems to say that what is predicted by quantum formalism must occur in the laboratory. But the essence of quantum formalism— entanglement,