碎片在量子神经网络中高效可学习
Fragmentation is Efficiently Learnable by Quantum Neural Networks
AI总结:
研究提出碎片分类问题,证明在特定条件下量子计算机可高效解决,同时显示经典计算难以处理此任务。
摘要:
在某些物理量子系统中,指数级大的状态空间会分裂为多个低维、动态不连通的子空间。我们引入了碎片分类学习问题,即给定量子态输入,需分类其属于哪个子空间。我们证明在碎片现象满足某些条件时,量子计算机可高效解决此问题。此外,通过展示已知的去量子化技术对碎片分类问题无效,支持该任务的经典难度。因此,本工作提供了罕见的物理动机量子机器学习任务实例,该任务对量子计算机高效且无已知经典去量子化方法。
英文摘要:
In certain classes of physical quantum systems, the exponentially large state space "fragments" into many low-dimensional, dynamically disconnected subspaces. We introduce a learning problem known as fragment classification, where given a quantum state input, one is interested in classifying to which subspace the state belongs. We prove that solving this learning problem is efficient on a quantum computer when the fragmentation phenomenon satisfies certain conditions. Furthermore, we give evidence supporting the classical hardness of this task by demonstrating that known dequantization techniques fail for the fragment classification problem. Consequently, this work provides a rare example of a physically motivated quantum machine learning task that is both efficient for quantum computers to perform and admits no known classical dequantization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。