论文标题
抽样随机克利福德操作员的简单方法
A simple method for sampling random Clifford operators
论文作者
论文摘要
我们描述了一种简单的算法，用于随机对$ n $ qubit Clifford操作员进行采样。该算法以量子电路的形式输出Clifford运算符，最多为$ 5N + 2n^2 $基本门，最大深度为$ \ Mathcal {o}（n \ log n \ log n）$在完全连接的拓扑上。随着算法的进行，可以以流方式输出电路，并且电路的不同部分可以并行生成。该算法具有$ \ MATHCAL {O}（n^2）$ time复杂性，与当前的技术状态相匹配。但是，所提出的算法的主要优点在于其简单性和基本推导。
We describe a simple algorithm for sampling $n$-qubit Clifford operators uniformly at random. The algorithm outputs the Clifford operators in the form of quantum circuits with at most $5n + 2n^2$ elementary gates and a maximum depth of $\mathcal{O}(n\log n)$ on fully connected topologies. The circuit can be output in a streaming fashion as the algorithm proceeds, and different parts of the circuit can be generated in parallel. The algorithm has an $\mathcal{O}(n^2)$ time complexity, which matches the current state of the art. The main advantage of the proposed algorithm, however, lies in its simplicity and elementary derivation.
