Randomized benchmarking in measurement-based quantum computing
Randomized benchmarking in measurement-based quantum computing
复制标题
DOI：
10.1103/physreva.94.032303
复制
发表时间：
2016-05
影响因子：
2.9
通讯作者：
R. N. Alexander;P. Turner;S. Bartlett
中科院分区：
文献类型：
--
作者：
R. N. Alexander;P. Turner;S. Bartlett
随机基准测试通常被用作表征小型量子器件中基本逻辑门组的性能的有效方法。在基于测量的量子计算模型中，逻辑门是通过对固定的通用资源状态进行单点测量来实现的。在这里，我们将单个量子位的随机基准测试协议调整为线性簇状态计算，这提供了与目标门集相关的噪声的部分但有效的表征。将随机基准测试应用于基于测量的量子计算，在基于测量的模型中与逻辑门相关的固有随机性与基准测试中使用的随机门序列之间表现出有趣的相互作用。我们考虑两种不同的方法：第一种使用标准的单量子位Clifford群，而第二种使用最近推出的（非Clifford）基于测量的2-设计，利用固有的随机性来实现门序列。
Randomized benchmarking is routinely used as an efficient method for characterizing the performance of sets of elementary logic gates in small quantum devices. In the measurement-based model of quantum computation, logic gates are implemented via single-site measurements on a fixed universal resource state. Here we adapt the randomized benchmarking protocol for a single qubit to a linear cluster state computation, which provides partial, yet efficient characterization of the noise associated with the target gate set. Applying randomized benchmarking to measurement-based quantum computation exhibits an interesting interplay between the inherent randomness associated with logic gates in the measurement-based model and the random gate sequences used in benchmarking. We consider two different approaches: the first makes use of the standard single-qubit Clifford group, while the second uses recently introduced (non-Clifford) measurement-based 2-designs, which harness inherent randomness to implement gate sequences.