The Scalable ZX-calculus is a compact graphical language used to reason about linear maps between quantum states. These diagrams have multiple applications, but they frequently have to be constructed in a case-by-case basis. In this work we present a method to encode quantum programs implemented in a fragment of the linear dependently typed Proto-Quipper-D language as families of SZX-diagrams. We define a subset of translatable Proto-Quipper-D programs and show that our procedure is able to encode non-trivial algorithms as diagrams that grow linearly on the size of the program.
翻译:可缩放的 ZX 计算法是一种缩放图形语言,用来解释量子状态之间的线性地图。 这些图表有多个应用程序, 但通常需要根据具体情况进行构建。 在这项工作中, 我们提出了一个方法, 用于将量子程序编码成一个以线性、 依附性输入的Proto- Quipper- D 语言的碎片, 作为 SZX diagrams 的子集。 我们定义了一个可转式的 Proto- Quipper- D 程序, 并显示我们的程序能够将非三维算法编码为根据程序大小线性增长的图表 。