完美量子态分类超越反可区分性的尖锐界
Sharp bounds for perfect quantum state classification beyond antidistinguishability
浏览论文内容
中文总结 AI 辅助
本文针对量子态分类中的k-可学习性，提出两个最优Gram矩阵准则（Frobenius范数充分条件和逐项ℓ1必要条件），并应用于SIC-POVMs等态集合及异常检测问题。
中文摘要 AI 辅助
一组纯量子态的多重集被称为k-可学习的，如果存在一种测量策略，总是能将从列表中抽取的未知样本缩小到至多k个候选者之一。参数k在可区分性与反可区分性之间进行插值，并为部分态识别提供了统一框架。我们证明了k-可学习性的两个普适且最优的Gram矩阵准则：一个Frobenius范数充分条件和一个逐项-ℓ1必要条件。我们将它们应用于推导几个著名态集合的显式可学习性和副本复杂性保证，包括SIC-POVMs、互无偏基和稳定子态。我们进一步将我们的结果应用于零错误突变检测问题，如异常检测和变点检测。
英文摘要
A multiset of pure quantum states is said to be k-learnable if there is a measurement strategy that always narrows an unknown sample drawn from the list down to one of at most k candidates. The parameter k interpolates between distinguishability and antidistinguishability, and provides a unified framework for partial state identification. We prove two universal, and optimal, Gram-matrix criteria for k-learnability: a Frobenius-norm sufficient condition and an entrywise-$\ell_1$ necessary condition. We apply them to derive explicit learnability and copy-complexity guarantees for several well-known sets of states including SIC-POVMs, mutually unbiased bases, and stabilizer states. We further apply our results to zero-error mutation detection problems such as anomaly detection and changepoint detection.
发表机构
- Mount Allison University（蒙克顿大学）
- Concordia University（康考迪亚大学）
- Unitary Foundation and IonQ（Unitary基金会和IonQ）
- Virginia Tech（弗吉尼亚理工大学）
机构由 AI 辅助整理，请以论文原文为准。
