The stabiliser formalism plays a central role in quantum computing, error correction, and fault-tolerance. Stabiliser states are used to encode quantum data. Clifford gates are those which can be easily performed fault-tolerantly in the most common error correction schemes. Their mathematical properties are the subject of significant research interest. Numerical experiments are critical to formulating and testing conjectures involving the stabiliser formalism. Conversions between different specifications of stabiliser states and Clifford gates are also important components of classical algorithms for simulating quantum circuits. In this note, we provide fast methods for verifying that a vector is a stabiliser state, and interconverting between its specification as amplitudes, a quadratic form, and a check matrix. We use these to rapidly check if a given unitary matrix is a Clifford gate and to convert between the matrix of a Clifford gate and its compact specification as a stabiliser tableau. For example, we extract the stabiliser tableau of a Clifford gate matrix with $N^2$ entries, which naively requires $O(N^3 \log N)$ time, in time $O(N \log N)$. Our methods outperform the best-known brute force methods by some orders of magnitude with asymptotic improvements that are exponential in the number of qubits. We provide example implementations of our algorithms in Python.
翻译:稳定子形式体系在量子计算、量子纠错和容错中扮演核心角色。稳定子态用于编码量子数据,克利福德门则是能在最常见纠错方案中轻松实现容错操作的量子门。其数学性质是重要研究课题,数值实验对提出和检验涉及稳定子形式体系的猜想至关重要。不同规范下稳定子态与克利福德门之间的转换,也是经典模拟量子电路算法的重要组成部分。本文提出了快速方法:验证向量是否为稳定子态,并在振幅、二次型和校验矩阵三种规范之间进行相互转换。我们利用这些方法快速检验给定酉矩阵是否为克利福德门,并在克利福德门矩阵与其紧凑规范(稳定子表格)之间进行转换。例如,从具有$N^2$个元素的克利福德门矩阵提取稳定子表格,朴素算法需要$O(N^3 \log N)$时间,而本方法仅需$O(N \log N)$时间。我们的方法比已知最优暴力算法快数个数量级,且渐进改进在量子比特数上呈指数级。文中提供了基于Python的算法实现示例。