arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2607.13847quant-phcs.LG

量子拓扑数据编码

Quantum Topological Data Encoding

发表机构伦敦皇家霍洛威大学计算机科学系 · 莱顿先进计算机科学研究所(LIACS)、莱顿大学 · 技术集群、新加坡技术大学
另 1 家 · 查看机构详情
  • Royal Holloway University of London, Department of Computer Science, UK(伦敦皇家霍洛威大学计算机科学系)
  • Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Leiden, The Netherlands(莱顿先进计算机科学研究所(LIACS)、莱顿大学)
  • Technology Cluster, Singapore University of Technology(技术集群、新加坡技术大学)
  • Centre for Quantum Technologies, National University of Singapore, Singapore(量子技术中心、新加坡国立大学)

机构由 AI 辅助整理,请以论文原文为准。

Adam Wesołowski, Dimitrios Thanos, Daniel Leykam, Lirandë Pira

首次发表
浏览论文内容

中文总结 AI 辅助

研究如何将拓扑信息编码到量子态,提出量子拓扑数据编码框架(QTDE),通过拓扑驱动量子演化实现,在团复形分类任务中测试,该量子表示优于基线,还指出其可用于高效可靠数据表示的应用领域。

中文摘要 AI 辅助

在众多领域中遇到的许多数据集具有丰富的几何和拓扑结构,难以用传统基于向量的表示来捕捉。量子机器学习提供了在希尔伯特空间中处理高维数据的可能性,但其实际成功关键取决于经典数据如何编码到量子态中。我们引入了量子拓扑数据编码(QTDE),这是一个通过拓扑驱动的量子演化将拓扑信息编码到量子态的通用框架。我们的方法将现有的拓扑驱动量子编码框架推广到高维数据。我们在团复形分类任务上测试了该方法,并提供了初步证据,表明拓扑驱动的量子表示可以捕捉到超越经典拓扑描述符直接比较所能获得的判别信息。所提出的量子表示始终优于基于描述底层拓扑结构的组合拉普拉斯算子直接比较的基线。我们指出了该框架可用于提供更高效和可靠数据表示的几个应用领域。

英文摘要

Many datasets encountered across a wide range of domains possess rich geometric and topological structure that is difficult to capture using conventional vector-based representations. Quantum machine learning offers the possibility of processing high-dimensional data in Hilbert spaces, but its practical success depends critically on how classical data is encoded into quantum states. We introduce \emph{quantum topological data encoding} (QTDE), a general framework for encoding topological information into quantum states via topology-driven quantum evolution. Our method generalises an existing topology-driven quantum encoding framework to higher-dimensional data. We test the proposed method on clique-complexes classification tasks, and provide preliminary evidence that topology-driven quantum representations can capture discriminative information beyond that available through direct comparisons of classical topological descriptors. The proposed quantum representations consistently outperform a baseline based on direct comparisons of the combinatorial Laplacians describing the underlying topological structure. We indicate several areas of application where the framework can be used to provide a more efficient and reliable data representation.

↑