Shorter gate sequences for quantum computing by mixing unitaries
Shorter gate sequences for quantum computing by mixing unitaries
复制标题
通过混合酉来缩短量子计算的门序列
DOI：
10.1103/physreva.95.042306
复制
发表时间：
2017
影响因子：
2.9
通讯作者：
Campbell E
中科院分区：
文献类型：
--
作者：
Campbell E
容错量子计算机组成离散门集的元素，以近似目标酉。最小化门数的问题称为门合成。近似误差是相干噪声的一种形式，它比非相干噪声具有更大的破坏性。我们展示了在不同门序列上的混合如何将这种相干噪声转换为非相干形式。通过菱形距离测量，混合后噪声比混合前二次减小，且不增加资源成本上界。同样地，我们可以寻找更短的门序列，以达到与单门合成相同的精度。对于一类广泛的问题，这使最坏情况下的资源成本降低了一个因子。
Fault-tolerant quantum computers compose elements of a discrete gate set in order to approximate a target unitary. The problem of minimizing the number of gates is known as gate synthesis. The approximation error is a form of coherent noise, which can be significantly more damaging than comparable incoherent noise. We show how mixing over different gate sequences can convert this coherent noise into an incoherent form. As measured by diamond distance, the postmixing noise is quadratically smaller than before mixing, without increasing resource cost upper bounds. Equivalently, we can look for shorter gate sequences that achieve the same precision as unitary gate synthesis. For a broad class of problems this gives a factorreduction in worst-case resource costs.
将门综合错误转变为不相干错误
DOI：
10.26421/qic17.5-6-7
发表时间：
2016
期刊：
Quantum Inf. Comput.
影响因子：
--
作者：
M. Hastings
通讯作者：
M. Hastings