Comparison of Two Quantum Nearest Neighbor Classifiers on IBM’s Quantum Simulator

• 作者: Wei Hu
• 来源期刊: 自然科学期刊(英文)
• 学科: 医学
• 关键词: QUANTUM COMPUTATION QUANTUM MACHINE Learning QUANTUM Nearest NEIGHBOR Algorithm
• 年，卷（期）: 2018,（3）
• 页码范围: 87-98
• 页数: 12页
• 分类号: R73

摘要

Today computers are used to store data in memory and then process them. In our big data era, we are facing the challenge of storing and processing the data simply due to their fast ever growing size. Quantum computation offers solutions to these two prominent issues quantum mechanically and beautifully. Through careful design to employ superposition, entanglement, and interference of quantum states, a quantum algorithm can allow a quantum computer to store datasets of exponentially large size as linear size and then process them in parallel. Quantum computing has found its way in the world of machine learning where new ideas and approaches are in great need as the classical computers have reached their capacity and the demand for processing big data grows much faster than the computing power the classical computers can provide today. Nearest neighbor algorithms are simple, robust, and versatile supervised machine learning algorithms, which store all training data points as their learned “model” and make the prediction of a new test data point by computing the distances between the query point and all the training data points. Quantum counterparts of these classical algorithms provide efficient and elegant ways to deal with the two major issues of storing data in memory and computing the distances. The purpose of our study is to select two similar quantum nearest neighbor algorithms and use a simple dataset to give insight into how they work, highlight their quantum nature, and compare their performances on IBM’s quantum simulator.