BIMSA >
YMSC-BIMSA 量子信息讨论班
YMSC-BIMSA 量子信息讨论班
Complexity of tensor network simulation for noisy quantum circuits
Complexity of tensor network simulation for noisy quantum circuits
演讲者
时间
2026年06月12日 16:00 至 17:30
地点
Shuangqing-B626
线上
Zoom 230 432 7880
(BIMSA)
摘要
We aim to rigorously address how local noise affects classical simulability of quantum dynamics benchmarked by tensor-network methods. Using operator entanglement entropy (OEE) as a unifying criterion, we prove the following:
(1) For single-qubit depolarizing noise on 1D local circuits, the existence of whole-trajectory error-bounded matrix product operator (MPO) with $\mathrm{poly}(n)$ complexity. (2) For general single-qubit noise in 1D brickwall circuits, we identify the contractivity conditions for the existence of $\mathrm{poly}(n)$ bond-dimension MPO approximations in average and in the worst case. (3) We further extend above results to higher dimensions, yielding $\mathrm{poly}(n)$ average boundary-bond dimensions for projected entangled pair operators~(PEPO) across every cut. Our results establish a rigorous connection between certain noise models, circuit types, and their classical simulability.
(1) For single-qubit depolarizing noise on 1D local circuits, the existence of whole-trajectory error-bounded matrix product operator (MPO) with $\mathrm{poly}(n)$ complexity. (2) For general single-qubit noise in 1D brickwall circuits, we identify the contractivity conditions for the existence of $\mathrm{poly}(n)$ bond-dimension MPO approximations in average and in the worst case. (3) We further extend above results to higher dimensions, yielding $\mathrm{poly}(n)$ average boundary-bond dimensions for projected entangled pair operators~(PEPO) across every cut. Our results establish a rigorous connection between certain noise models, circuit types, and their classical simulability.
演讲者介绍
程嵩，现任北京雁栖湖应用数学研究院副研究员，曾任鹏城实验室量子计算中心助理研究员，博士毕业于中科院物理所理论物理专业。他的研究方向是张量网络算法，研究兴趣主要集中于开发张量网络在凝聚态物理，机器学习，量子计算等方向的新算法。