AI 中文总结
该研究探讨上下文相关性在序列量子态鉴别中的作用，在n=1的非序列情形下证明COPE形式主义下特定非最优测量也存在上下文相关性，在n>1的序列情形下其存在取决于制备态和所选协议。
AI 中文摘要
广义上下文相关性是量子态鉴别协议最优策略的必要条件。近期人们研究了序列鉴别任务：n个玩家尝试确定一个量子比特被制备于哪个态，使得他们都有有限的成功概率。我们研究上下文相关性在无歧义和最小误差鉴别两种序列版本中所起的作用程度。在标准非序列情形（n=1）下，我们使用COPE形式主义证明，上下文相关性的存在不仅对最优测量有保证，对特定一组非最优测量也有保证。在序列情形（n>1）下，我们证明上下文相关性的存在取决于被制备的态以及所选择的协议（无歧义或最小误差）。
英文摘要
Generalized contextuality is known to be required in optimal strategies for quantum state discrimination protocols. More recently, sequential discrimination tasks have been studied; n players attempt to determine in which state a qubit was prepared, in such a way that they all have a finite probability of success. We consider the extent to which contextuality plays a role in sequential versions of both unambiguous and minimum error discrimination. In the standard nonsequential case where n = 1, we use the COPE formalism to demonstrate that the presence of contextuality is guaranteed not only for the optimal measurement, but for a specific set of nonoptimal measurements as well. In the sequential case n > 1, we show that the presence of contextuality depends on which states are prepared, and on the protocol (unambiguous or minimum error) selected.
Comments18 pages, 4 figures
