Extending the Graph Formalism to Higher-Order Gates
Extending the Graph Formalism to Higher-Order Gates
复制标题
将图形式主义扩展到高阶门
DOI：
--
复制
发表时间：
2021
影响因子：
1
通讯作者：
K. Ren
中科院分区：
文献类型：
--
作者：
A. Khesin;K. Ren
我们提出了一种以图的形式高效地模拟量子电路的算法。在图的形式中，我们将状态表示为在其顶点上具有Clifford运算的图的线性组合。我们展示了作用于稳定子态的$\Calc_3$门，如Toffoli门或$\FRAC\pi8$门如何将其分裂成两个稳定子态。我们还描述了将两个稳定子态合并为一个的条件。我们讨论了我们的算法在电路恒等式和寻找幻态的低稳定子阶表示上的应用。
We present an algorithm for efficiently simulating a quantum circuit in the graph formalism. In the graph formalism, we present states as a linear combination of graphs with Clifford operations on their vertices. We show how a $\calC_3$ gate such as the Toffoli gate or $\frac\pi8$ gate acting on a stabilizer state splits it into two stabilizer states. We also describe conditions for merging two stabilizer states into one. We discuss applications of our algorithm to circuit identities and finding low stabilizer rank presentations of magic states.
影响因子：
6.4
作者：
Bravyi, Sergey;Browne, Dan;Howard, Mark
通讯作者：
Howard, Mark