秩为2的基上的全息算法
Holographaic Alogorithms on Bases of Rank 2
摘要:
设计全息算法的一个基本问题是确定在合适的基变换(SRP)下匹配门是否能实现所需的签名。对于域尺寸为2的全息算法,文献[1,2,4,5]已经建立了一个系统的理论。本文在秩为2的基础上,将区域大小k>2的SRP降为区域大小2的SRP。进一步地,我们将文[3]中的坍缩定理推广到区域大小k>2.
英文摘要:
An essential problem in the design of holographic algorithms is to decide whether the required signatures can be realized by matchgates under a suitable basis transformation (SRP). For holographic algorithms on domain size 2, [1, 2, 4, 5] have built a systematical theory. In this paper, we reduce SRP on domain size k>2 to SRP on domain size 2 for holographic algorithms on bases of rank 2. Furthermore, we generalize the collapse theorem of [3] to domain size k>2.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。