论文标题
成功或抽奖：一种允许在量子计算中重复实现成功的策略
Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation
论文作者
论文摘要
重复直达成功的策略是一种标准方法，可以在迭代次数中成倍增长的概率获得成功。但是，由于量子系统在量子测量后受到干扰，因此如何在某些量子算法中执行重复启动策略并不是直接的。在本文中，我们为概率的高阶转换提出了一个新的结构，名为“成功或抽奖”，该结构允许重复实现实现。为此，我们提供了成功或抽签结构的普遍结构，该结构适用于单一操作上任何概率的高阶转换。然后，我们提出了一种半决赛编程方法，以获得最佳的成功或绘制协议，并详细分析颠倒一般单一操作的问题。
Repeat-until-success strategy is a standard method to obtain success with a probability which grows exponentially in the number of iterations. However, since quantum systems are disturbed after a quantum measurement, it is not straightforward how to perform repeat-until-success strategies in certain quantum algorithms. In this paper, we propose a new structure for probabilistic higher-order transformation named success-or-draw, which allows a repeat-until-success implementation. For that we provide a universal construction of success-or-draw structure which works for any probabilistic higher-order transformation on unitary operations. We then present a semidefinite programming approach to obtain optimal success-or-draw protocols and analyze in detail the problem of inverting a general unitary operation.
