我们导出那为一条量隧道和为二个给定的家庭送 i 给 B i (1 i k ) 的概括单一的操作的存在的足够、必要的条件 { i } i=1 k, { B i } 矩阵的 i=1 k 分别地。作为一个应用程序,为有给定的输入产量状态的一台单一的两重性量计算机的存在的一个足够、必要的条件被获得。
We derive that sufficient and necessary conditions for existence of a quantum channel Ф and a generalized unitary operation ε sending Ai to Bi(1 ≤ i ≤ k) for two given families {Ai}k i=1, {Bi}k i=1 of matrices, respectively. As an application, a sufficient and necessary condition for existence of a unitary duality quantum computer with given input-output states is obtained.