Quantum and Quantum-Inspired Stereographic K Nearest-Neighbour Clustering

Author:

Viladomat Jasso Alonso1ORCID,Modi Ark2,Ferrara Roberto2ORCID,Deppe Christian2ORCID,Nötzel Janis1,Fung Fred3,Schädler Maximilian3

Affiliation:

1. Theoretical Quantum System Design Group, Chair of Theoretical Information Technology, Technical University of Munich, 80333 Munich, Germany

2. Institute for Communications Engineering, TUM School of Computation, Information and Technology, Technical University of Munich, 80333 Munich, Germany

3. Optical and Quantum Laboratory, Munich Research Center, Huawei Technologies Düsseldorf GmbH, Riesstr. 25-C3, 80992 Munich, Germany

Abstract

Nearest-neighbour clustering is a simple yet powerful machine learning algorithm that finds natural application in the decoding of signals in classical optical-fibre communication systems. Quantum k-means clustering promises a speed-up over the classical k-means algorithm; however, it has been shown to not currently provide this speed-up for decoding optical-fibre signals due to the embedding of classical data, which introduces inaccuracies and slowdowns. Although still not achieving an exponential speed-up for NISQ implementations, this work proposes the generalised inverse stereographic projection as an improved embedding into the Bloch sphere for quantum distance estimation in k-nearest-neighbour clustering, which allows us to get closer to the classical performance. We also use the generalised inverse stereographic projection to develop an analogous classical clustering algorithm and benchmark its accuracy, runtime and convergence for decoding real-world experimental optical-fibre communication data. This proposed ‘quantum-inspired’ algorithm provides an improvement in both the accuracy and convergence rate with respect to the k-means algorithm. Hence, this work presents two main contributions. Firstly, we propose the general inverse stereographic projection into the Bloch sphere as a better embedding for quantum machine learning algorithms; here, we use the problem of clustering quadrature amplitude modulated optical-fibre signals as an example. Secondly, as a purely classical contribution inspired by the first contribution, we propose and benchmark the use of the general inverse stereographic projection and spherical centroid for clustering optical-fibre signals, showing that optimizing the radius yields a consistent improvement in accuracy and convergence rate.

Funder

the TUM-Huawei Joint Lab on Algorithms for Short Transmission Reach Optics

the DFG Emmy-Noether program

Munich Center for Quantum Science and Technology

the Federal Ministry of Education and Research of Germany in the joint project 6G-life

the Munich Quantum Valley

the Bavarian State Ministry for Economic Affairs, Regional Development and Energy in the project 6G and Quantum Technology

the Federal Ministry of Education and Research of Germany in the project QR.X

Publisher

MDPI AG

Subject

General Physics and Astronomy

Reference51 articles.

1. Quantum Algorithm for Linear Systems of Equations;Harrow;Phys. Rev. Lett.,2009

2. Lloyd, S., Mohseni, M., and Rebentrost, P. (2013). Quantum algorithms for supervised and unsupervised machine learning. arXiv.

3. Quantum Computing in the NISQ era and beyond;Preskill;Quantum,2018

4. Quantum Principal Component Analysis Only Achieves an Exponential Speedup Because of Its State Preparation Assumptions;Tang;Phys. Rev. Lett.,2021

5. Quantum Supremacy using a Programmable Superconducting Processor;Arute;Nature,2019

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A Detailed Overview of Quantum Computing Machine Learning Techniques;2024 International Conference on Communication, Computer Sciences and Engineering (IC3SE);2024-05-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3