讨论班和报告
当前位置:首页  讨论班和报告  报告
Kaifeng Bu——Efficient classical simulation of quantum circuits with a loss of tiny information
发布人:许全华  发布时间:2019-07-30   浏览次数:74

题目Efficient classical simulation of quantum circuits with a loss of tiny information


报告人Kaifeng Bu(Harvard University and Zhejiang University)


时间:8月5日,10:00-11:00


地点:明德楼B区201学术报告厅


摘要With the advent of noisy intermediate-scale quantum (NISQ) devices, an important near-term milestone in the field is to demonstrate that quantum computers are capable of performing computational tasks that classical computers cannot, a goal known as  quantum supremacy. Several restricted models of quantum computation have been proposed as candidates for demonstrating quantum supremacy, such as instantaneous quantum polynomial-time (IQP) circuits, and Clifford circuits with magic initial states and nonadaptive measurements. In this talk, I will introduce our recent work on the efficient classical simulation of these models with a loss of tiny information. This is a joint work with Zhengwei Liu and Xun Gao.