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图表族。我们定义了一个可翻译的Proto-Quipper-D程序子集，并证明我们的方法能够将非平凡算法编码为图表，其规模随程序大小线性增长。