中科院数学与系统科学研究院
华罗庚数学科学中心
量子信息报告
报告人：Kaifeng Bu (Harvard University)
题 目：Efficient classical simulation of quantum circuits with a loss of tiny information
时 间：2019.07.30（星期二），15:00-16:00
地 点：数学院南楼N602室
摘 要： 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.
--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
报告人：Xiaoqin Gao (University of Vienna)
题 目：Universal Quantum Computation by a Single Photon
时 间：2019.08.01（星期四），15:00-16:00
地 点：数学院南楼N226室
摘 要： We introduce a new scheme to realize universal quantum computation using the orbital angular momentum of a single photon. We implement an n-qubit by the superposition of 2n orbit angular momentum modes of a single photon; a generating set of gates for universal quantum computation on n-qubits by elementary operations on a single photon. All these operations have been realized with high accuracy in the lab. Each gate in the generating set is realized by at most O(n) elementary operations, therefore our scheme is efficient for universal quantum computation. We conclude that photonic quantum computation is one of the promising approaches to universal quantum computation.
附件：