[论文解读] Unambiguous State Discrimination of two density matrices in Quantum Information Theory

Philippe Raynal|ArXiv.org|Nov 12, 2006

Quantum Information and Cryptography参考文献 41被引用 20

一句话总结

本文为两个通用混合量子态的精确无歧义态判别（USD）提供了解析解，将问题简化为在2r维希尔伯特空间中具有等秩密度矩阵的等价情形。通过保真度推导出更紧致的失败概率下界，并给出了最优性的必要与充分条件，从而实现了对四维希尔伯特空间中几何均匀混合态（如相干态下的BB84 QKD协议）的精确解，超越了以往基于纯态的简化方法。

ABSTRACT

In this thesis we study the problem of unambiguously discriminating two mixed quantum states. We first present reduction theorems for optimal unambiguous discrimination of two generic density matrices. We show that this problem can be reduced to that of two density matrices that have the same rank $r$ in a 2$r$-dimensional Hilbert space. These reduction theorems also allow us to reduce USD problems to simpler ones for which the solution might be known. As an application, we consider the unambiguous comparison of $n$ linearly independent pure states with a simple symmetry. Moreover, lower bounds on the optimal failure probability have been derived. For two mixed states they are given in terms of the fidelity. Here we give tighter bounds as well as necessary and sufficient conditions for two mixed states to reach these bounds. We also construct the corresponding optimal measurement. With this result, we provide analytical solutions for unambiguously discriminating a class of generic mixed states. This goes beyond known results which are all reducible to some pure state case. We however show that examples exist where the bounds cannot be reached. Next, we derive properties on the rank and the spectrum of an optimal USD measurement. This finally leads to a second class of exact solutions. Indeed we present the optimal failure probability as well as the optimal measurement for unambiguously discriminating any pair of geometrically uniform mixed states in four dimensions. This class of problems includes for example the discrimination of both the basis and the bit value mixed states in the BB84 QKD protocol with coherent states.

研究动机与目标

• 解决两个通用混合量子态最优无歧义判别的开放问题，此前尚未有完整解法。
• 将两个任意混合态的一般USD问题约化为在低维希尔伯特空间中具有等秩密度矩阵的更简单等价问题。
• 推导出两个混合态USD失败概率的更紧致下界，改进现有基于保真度的下界。
• 识别这些下界可实现的必要与充分条件，从而实现解析解。
• 为特定类别的混合态（特别是四维希尔伯特空间中的几何均匀态）构造显式最优测量。

提出的方法

• 提出约化定理，将任意两个混合态的USD问题映射为在2r维希尔伯特空间中两个秩为r的密度矩阵的等价问题。
• 引入标准形式的USD问题，利用重叠支撑、正交子空间和分块对角结构以简化分析。
• 应用算子的并行加法概念，记为 $ \rho_0 \Sigma^{-1} \rho_1 $，以推导失败概率的界。
• 在算子迹空间中使用极分解与柯西-施瓦茨不等式，推导最优性的必要与充分条件。
• 表征最优POVM元素的秩与谱，以识别精确解的结构约束。
• 利用对称性与谱性质，为四维希尔伯特空间中的几何均匀混合态构造显式最优测量。

实验结果

研究问题

• RQ1 两个任意混合量子态的最优无歧义判别能否约化为更简单、等价的问题？
• RQ2 两个混合态无歧义判别的失败概率是否存在更紧致的下界？这些下界在何种条件下可实现？
• RQ3 两个混合态在何种必要与充分条件下可实现目前已知最紧致的失败概率下界？
• RQ4 能否为超越可约化为纯态情形的混合态类别推导出精确解析解？
• RQ5 四维希尔伯特空间中几何均匀混合态的最优POVM结构如何？

主要发现

• 两个通用混合态的USD问题可约化为在2r维希尔伯特空间中两个等秩r密度矩阵的等价问题。
• 通过保真度推导出更紧致的失败概率下界，并给出实现这些下界的必要与充分条件。
• 为一类不可约化为纯态情形的通用混合态提供了无歧义判别的解析解。
• 展示了理论失败概率下界无法实现的实例，表明这些下界存在局限性。
• 为四维希尔伯特空间中的几何均匀混合态推导出第二类精确解，包括BB84 QKD协议中相干态的相关情形。
• 显式构造了几何均匀态的最优测量算子，并完整表征了其秩与谱。