论文标题
计算量子计算中问题的阿贝里安广场
Counting Abelian Squares for a Problem in Quantum Computing
论文作者
论文摘要
在最近的一项工作中，我开发了一个公式，用于有效地计算出长度为$ d $的字母上的长度$ t+t $的阿贝利亚广场数量，其中$ d $可能非常大。在这里，我展示了如何将一类参数化量子电路的表现力降低到在大型字母上计数Abelian正方形的问题，并使用最近开发的公式有效地计算此数量。
In a recent work I developed a formula for efficiently calculating the number of abelian squares of length $t+t$ over an alphabet of size $d$, where $d$ may be very large. Here I show how the expressiveness of a certain class of parameterized quantum circuits can be reduced to the problem of counting abelian squares over a large alphabet, and use the recently developed formula to efficiently calculate this quantity.
