arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.1202math.QAmath-phmath.MPquant-ph
收藏

亚模范畴及其应用

On Metaplectic Modular Categories and their applications

Matthew B. Hastings, Chetan Nayak, Zhenghan Wang

摘要:

对于酉模范畴中的非阿贝尔简单对象,它们的辫群表示的密度、它们相关的链接不变量的#P-硬求值以及它们的任意子量子计算模型的BQP-完备性是密切相关的。本文系统地研究了元模范畴中非交换简单对象的这类性质。元模范畴是具有SO(m)_2对奇数m \geq 3的融合规则的酉模范畴。具有量子维数\sqrt{m}的简单对象具有有限像辫群表示,并且它们的链接不变量是经典有效的。我们还提供了经典有效的模拟他们的辫群表示。这些辫群表示的模拟可以被视为量子比特情形下的Knill-Gottesmann定理的量子推广。2维的简单对象给了我们一个令人惊讶的结果:虽然它们的辫群表示具有有限的图像,并且在广义局部化后可以有效地经典模拟,但它们的链接不变量是#P-难以精确评估的。我们通过证明任何足够精确的近似其相关的链接不变量已经是#P-hard来锐化#P-hardness。

英文摘要:

For non-abelian simple objects in a unitary modular category, the density of their braid group representations, the #P-hard evaluation of their associated link invariants, and the BQP-completeness of their anyonic quantum computing models are closely related. We systematically study such properties of the non-abelian simple objects in metaplectic modular categories, which are unitary modular categories with fusion rules of SO(m)_2 for an odd integer m \geq 3. The simple objects with quantum dimensions \sqrt{m} have finite image braid group representations, and their link invariants are classically efficient to evaluate. We also provide classically efficient simulation of their braid group representations. These simulations of the braid group representations can be regarded as qudit generalizations of the Knill-Gottesmann theorem for the qubit case. The simple objects of dimension 2 give us a surprising result: while their braid group representations have finite images and are efficiently simulable classically after a generalized localization, their link invariants are #P-hard to evaluate exactly. We sharpen the #P-hardness by showing that any sufficiently accurate approximation of their associated link invariants is already #P-hard.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑