A Quantum Algorithm for Evaluating the Hamming Distance

作     者：Mohammed Zidan Manal G.Eldin Mahmoud Y.Shams Mohamed Tolan Ayman Abd-Elhamed Mahmoud Abdel-Aty 

作者机构：Department of Artificial IntelligenceHurghada Faculty of Computers and Artificial IntelligenceSouth Valley UniversityEgypt Faculty of EngineeringKing Salman International UniversitySouth SinaiEgypt Department of Mathematics and Computer ScienceFaculty of ScienceBeni-Suef UniversityBeni-SuefEgypt Department of Machine Learning and Information RetrievalFaculty of Artificial IntelligenceKafrelsheikh UniversityEgypt Mechanical DepartmentFaculty of Technology and EducationSuez UniversitySuezEgypt Faculty of Technological IndustriesKing Salman International UniversitySouth SinaiEgypt Faculty of Engineering at MatariaHelwan UniversityCairoEgypt Department of MathematicsFaculty of SciencesSohag University82524 SohagEgypt 

出 版 物：《Computers, Materials & Continua》 (计算机、材料和连续体（英文）)

年 卷 期：2022年第71卷第4期

页      面：1065-1078页

核心收录：

学科分类：07[理学] 070201[理学-理论物理] 0702[理学-物理学] 

主　　题：Quantum computing quantum algorithm quantum circuit 

摘      要：We present a novel quantum algorithm to evaluate the hamming distance between two unknown oracles via measuring the degree of entanglement between two ancillary *** particular,we use the power of the entanglement degree based quantum computing model that preserves at most the locality of interactions within the quantum model *** model uses one of two techniques to retrieve the solution of a quantum computing problem at *** the first technique,the solution of the problem is obtained based on whether there is an entanglement between the two ancillary qubits or *** the second,the solution of the quantum computing problem is obtained as a function in the concurrence value,and the number of states that can be generated from the Boolean *** proposed algorithm receives two oracles,each oracle represents an unknown Boolean function,then it measures the hamming distance between these two *** hamming distance is evaluated based on the second *** is shown that the proposed algorithm provides exponential speedup compared with the classical counterpart for Boolean functions that have large numbers of Boolean *** proposed algorithm is explained via a case ***,employing recently developed experimental techniques,the proposed algorithm has been verified using IBM’s quantum computer simulator.