arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.09759quant-ph
收藏

广义量子过程判别问题

Generalized quantum process discrimination problems

Kenji Nakahira, Kentaro Kato

摘要:

我们研究了一类广泛的量子过程判别问题,这些问题可以处理许多优化策略,如贝叶斯,奈曼-皮尔逊和明确的策略,其中每个过程可以由多个时间步组成,并且可以具有内部存储器。给定候选进程的集合,我们的任务是找到一个歧视策略,这可能是自适应和/或纠缠辅助,最大限度地提高给定的目标函数受到给定的约束。我们的问题可以表述为一个凸问题。导出了其无对偶间隙的Lagrange对偶问题及最优解存在的充要条件。我们还表明,如果一个问题有一定的对称性,至少有一个最优解存在,那么也存在一个最优解具有相同类型的对称性。最后讨论了一个过程判别问题的极大极小策略。作为我们的结果的应用,我们提供了一些问题,其中的自适应策略是不必要的最佳歧视。我们还提出了一个例子,单次拍摄的通道歧视,可以得到一个解析解。

英文摘要:

We study a broad class of quantum process discrimination problems that can handle many optimization strategies such as the Bayes, Neyman-Pearson, and unambiguous strategies, where each process can consist of multiple time steps and can have an internal memory. Given a collection of candidate processes, our task is to find a discrimination strategy, which may be adaptive and/or entanglement-assisted, that maximizes a given objective function subject to given constraints. Our problem can be formulated as a convex problem. Its Lagrange dual problem with no duality gap and necessary and sufficient conditions for an optimal solution are derived. We also show that if a problem has a certain symmetry and at least one optimal solution exists, then there also exists an optimal solution with the same type of symmetry. A minimax strategy for a process discrimination problem is also discussed. As applications of our results, we provide some problems in which an adaptive strategy is not necessary for optimal discrimination. We also present an example of single-shot channel discrimination for which an analytical solution can be obtained.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑