Qubit Mapping Based on Tabu Search

扫码查看

原文链接

万方数据
维普

外文摘要：The goal of qubit mapping is to map a logical circuit to a physical device by introducing additional gates as few as possible in an acceptable amount of time.We present an effective approach called Tabu Search Based Adjustment(TSA)algorithm to construct the mappings.It consists of two key steps:one is making use of a combined subgraph iso-morphism and completion to initialize some candidate mappings,and the other is dynamically modifying the mappings by TSA.Our experiments show that,compared with state-of-the-art methods,TSA can generate mappings with a smaller number of additional gates and have better scalability for large-scale circuits.

外文关键词：

quantum computingqubit mappinginitial mappingtabu searchlogical circuit

作者：

蒋慧、邓玉欣、徐鸣

展开 >

作者单位：

Shanghai Key Laboratory of Trustworthy Computing,East China Normal University,Shanghai 200062,China

基金：

National Natural Science Foundation of ChinaNational Natural Science Foundation of ChinaNational Natural Science Foundation of ChinaNational Natural Science Foundation of ChinaResearch Funds of Happiness Flower of East China Normal UniversityFundamental Research Funds for the Central Universities of ChinaShanghai Trusted Industry Internet Software Collaborative Innovation Centerthe"Digital Silk Road"Shanghai International Joint Lab of Trustworthy Intelligent Software

项目编号：

618320156207217612271172118712212020ECNU-XFZH0052021JQRH01422510750100

出版年：

2024

DOI：

10.1007/s11390-023-2121-5

计算机科学技术学报(英文版)

中国计算机学会

计算机科学技术学报(英文版)

CSTPCD

影响因子：0.432

ISSN：1000-9000

年,卷(期)：2024.39(2)