Laughlin波函数的量子算法
Quantum algorithm for the Laughlin wave function
摘要：
我们构造了一个量子算法，在填充分数为1的情况下，为任意数量的粒子$n$创建Laughlin态。这种量子线路是有效的，因为它只使用$n(n-1)/2$局部量子门和它的深度尺度为$2n-3$。我们进一步证明了最优的电路使用置换理论的参数，我们精确计算如何纠缠发展沿每个门的行动。最后，讨论了量子比特和量子比特门分解的实验可行性，以及对任意填充分数的推广。
英文摘要：
We construct a quantum algorithm that creates the Laughlin state for an arbitrary number of particles $n$ in the case of filling fraction one. This quantum circuit is efficient since it only uses $n(n-1)/2$ local qudit gates and its depth scales as $2n-3$. We further prove the optimality of the circuit using permutation theory arguments and we compute exactly how entanglement develops along the action of each gate. Finally, we discuss its experimental feasibility decomposing the qudits and the gates in terms of qubits and two qubit-gates as well as the generalization to arbitrary filling fraction.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
