Toward Super-polynomial Quantum Speedup of Equivariant Quantum Algorithms with SU($d$) Symmetry
迈向具有SU(d)对称性的等变量子算法超多项式量子加速
机构 * Department of Statistics, The University of Chicago, Chicago, IL 60637, USA(统计学系,芝加哥大学) ; DAMTP, Center for Mathematical Sciences, University of Cambridge, Cambridge CB30WA, UK(数学系,剑桥大学) ; Department of Computer Science, University of Oxford(计算机科学系,牛津大学) ; Department of Computer Science, The University of Chicago, Chicago, IL 60637, USA(计算机科学系,芝加哥大学) ; Pritzker School of Molecular Engineering, The University of Chicago, Chicago, IL 60637, USA(分子工程学院,芝加哥大学) ; Kadanoff Center for Theoretical Physics, The University of Chicago, Chicago, IL 60637, USA(理论物理中心,芝加哥大学) ; Department of Computer Science, The University of Pittsburgh, Pittsburgh, PA 15260, USA(计算机科学系,匹兹堡大学)
AI总结 该研究提出了一种基于SU(d)对称性的等变量子算法框架,通过增强置换量子计算模型PQC+,实现了超多项式量子加速,并展示了PQC+在经典模拟上的不可行性。
Comments Presented in TQC 2022
Journal ref Phys. Rev. A 112, 052435 (2025)