2021年6月16日学术报告——邓玉欣

报告题目：Quantum Circuit Transformation Based on Subgraph Isomorphism and Tabu Search

报告人：邓玉欣教授  华东师范大学

时间：2021年6月16日（周三） 09：30-10：30

地点：腾讯视频会议线上报告 (ID: 283 550 109)

主办单位：bd手机版官网登录ios 、半岛app应用 、半岛电子官网

报告人简介：

        邓玉欣，华东师范大学软件工程学院教授。长期从事形式化方法领域的基础研究，主要研究方向包括并发计算模型和程序理论。代表性工作包括一个已经被国外学者写进教科书的“邓引理”(Deng Lemma)（R. Gorrieri, C. Versari. Introduction to Concurrency Theory – Transition Systems and CCS. Springer, 2015）和关于概率并发理论的一部英文专著（Y. Deng. Semantics of Probabilistic Processes: An Operational Approach. Springer, 2015）。发表学术论文75篇，其中多篇发表在国际权威期刊和会议如Information and Computation、Theoretical Computer Science、CONCUR、ICALP、LICS、POPL等。曾为CONCUR 2018作特邀报告，担任TASE 2016程序委员会共同主席，多次担任理论计算机科学领域著名会议如ICALP 2013、ICALP 2016、ICALP 2018、CONCUR 2019、CAV 2021的程序委员会委员。

报告内容：

        The goal of quantum circuit adjustment is to construct mappings from logical quantum circuits to physical ones in an acceptable amount of time, and in the meantime to introduce as few auxiliary gates as possible. We present an effective approach to constructing the mapping. It consists of two keys steps: one makes use of a combined subgraph isomorphism and complement (CSIC) to initialize a mapping, the other dynamically adjusts the mapping by using a Tabu search based adjustment (TSA). Our experiments show that, compared with the wghtgraph recently considered in the literature, CSIC can save 22.26% of auxiliary gates and reduce the depths of output circuits by 11.76% on average in the initialization of the mapping, and TSA has a better scalability than many state-of-the-art algorithms for adjusting mappings.