Duan Runyao, Feng Yuan, Ying Mingsheng
State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing, China, 100084.
Phys Rev Lett. 2007 Mar 9;98(10):100503. doi: 10.1103/PhysRevLett.98.100503.
We show that a unitary operation (quantum circuit) secretly chosen from a finite set of unitary operations can be determined with certainty by sequentially applying only a finite amount of runs of the unknown circuit. No entanglement or joint quantum operations are required in our scheme. We further show that our scheme is optimal in the sense that the number of the runs is minimal when discriminating only two unitary operations.
我们证明，从有限酉运算集合中秘密选择的一个酉运算（量子电路），可以通过仅顺序应用有限次数的未知电路运行来确定。在我们的方案中不需要纠缠或联合量子操作。我们进一步表明，在仅区分两个酉运算时，我们的方案在运行次数最小化的意义上是最优的。
