AI 中文总结
针对有限维纯态在单拷贝Haar测量下的预测问题，提出用积和式精确计算贝叶斯后验均值，结合随机网格MLE桥接，给出样本复杂度O((d^2/ε)log(d/ε))的相对熵保证，并证明渐近最优性。
AI 中文摘要
我们研究在独立地用单拷贝 Haar POVM 测量观测拷贝后，对一个未知有限维纯量子态的单个未测量拷贝进行预测的问题。对于由此产生的固定可分观测，在量子相对熵损失下的贝叶斯预测态是满秩后验均值。我们通过结果 Gram 矩阵子式的积和式精确评估该预测态，证明了积和式表示的正定性和归一性，并建立了基于这些固定结果的决策规则中的极小极大性。利用后验均值的 Hilbert--Schmidt 投影和一个精确分析的线性反演竞争者，我们证明了有限样本后验纯度界和显式相对熵保证，样本数为 $O((d^2/\epsilon)\log(d/\epsilon))$。利用伴生论文中证明的精确集体基准，我们还获得了熵和后验纯度比较。为了将精细乘积数据连接到规则射线值实验而不假设确定性有限样本唯一性，我们为有限投影网格绘制一个随机方向，将其保留用于整个样本，并在所得参考实验中应用选定的有限字母表 MLE。一个嵌套恢复网格均匀恢复精细 Fisher 信息。因此，每个足够精细的固定网格都给出一个规则有限字母表模型。其选定的 MLE 具有 Haar 平均逆 Fisher 系数 $\overline a_k$，在固定网格大样本极限之后细化网格会使 $\overline a_k$ 趋近 $d-1$。这为精细后验和更锐利的固定维渐近尺度 $(d/\epsilon)\log(d/\epsilon)$ 提供了 epsilon 最优的前导相对熵和后验重叠界。后者未被断言为一致有限样本保证。未使用确定性有限样本 MLE 唯一性或三角网格调度。
英文摘要
We study prediction of one unmeasured copy of an unknown finite-dimensional pure quantum state after independently measuring the observed copies with the one-copy Haar POVM. For the resulting fixed separable observation, the Bayes predictive state under quantum relative-entropy loss is the full-rank posterior mean. We evaluate it exactly through permanents of minors of the outcome Gram matrix, prove positivity and normalization of the permanent representation, and establish minimaxity among decision rules based on these fixed outcomes. Using Hilbert--Schmidt projection of the posterior mean and an exactly analyzed linear-inversion competitor, we prove a finite-sample posterior-purity bound and an explicit relative-entropy guarantee with sample count $O((d^2/ε)\log(d/ε))$. Using the exact collective benchmarks proved in a companion paper, we also obtain entropy and posterior-purity comparisons. To connect the fine product data to a regular ray-valued experiment without assuming deterministic finite-sample uniqueness, we draw one random orientation for a finite projective mesh, retain it for the entire sample, and apply a selected finite-alphabet MLE in the resulting reference experiment. A nested recovering mesh uniformly recovers the fine Fisher information. Consequently every sufficiently fine fixed mesh gives a regular finite-alphabet model. Its selected MLE has Haar-averaged inverse-Fisher coefficient $\overline a_k$, and refining the mesh after the fixed-mesh large-sample limit makes $\overline a_k$ approach $d-1$. This yields epsilon-optimal leading relative-entropy and posterior-overlap bounds for the fine posterior and the sharper fixed-dimensional asymptotic scale $(d/ε)\log(d/ε)$. The latter is not asserted as a uniform finite-sample guarantee. No deterministic finite-sample MLE uniqueness or triangular mesh schedule is used.
Comments15 pages, 1 figure
