The Nearest Neighbor Arrangement of Quantum Circuits Based on MCT Reversible Circuits

CHENG Xue-yun; GUAN Zhi-jin; XU Hai; TAN Ying-ying; LIU Yang

doi:10.3969/j.issn.0372-2112.2018.08.013

您当前的位置：

首页 >

文章列表页 >

The Nearest Neighbor Arrangement of Quantum Circuits Based on MCT Reversible Circuits

更新时间：2025-07-16

- The Nearest Neighbor Arrangement of Quantum Circuits Based on MCT Reversible Circuits
- Acta Electronica Sinica Vol. 46, Issue 8, Pages: 1891-1897(2018)
- 作者机构：
  
  1. 南通大学电子信息学院,江苏,南通,226019
  2. 南通大学计算机科学与技术学院,江苏,南通,226019
  3. 江苏省专用集成电路设计重点实验室,江苏,南通,226019
  4. 南通大学电子信息学院,江苏,南通,226019
  5. 南通大学计算机科学与技术学院,江苏,南通,226019
  6. 江苏省专用集成电路设计重点实验室,江苏,南通,226019
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2018.08.013
  CLC： TP302
- Published Online：25 August 2018，
  
  Published：2018
- 稿件说明：
移动端阅览
CHENG Xue-yun, GUAN Zhi-jin, XU Hai, et al. The Nearest Neighbor Arrangement of Quantum Circuits Based on MCT Reversible Circuits[J]. Acta Electronica Sinica, 2018, 46(8): 1891-1897.
DOI：

CHENG Xue-yun, GUAN Zhi-jin, XU Hai, et al. The Nearest Neighbor Arrangement of Quantum Circuits Based on MCT Reversible Circuits[J]. Acta Electronica Sinica, 2018, 46(8): 1891-1897. DOI： 10.3969/j.issn.0372-2112.2018.08.013.

摘要

为了实现量子线路线性最近邻（LNN）排布，给出了可逆MCT门的最近邻Toffoli门级联方法.为了解决线路近邻化中额外插入的SWAP门增加量子代价的问题，引入NNTS门减少插入的SWAP门数，并给出了MCT门基于NNTS门的最近邻线路排布.提出了量子线路近邻化排布算法，将多控制MCT门通过交换线路的顺序得到其最近邻线路排布，然后将每个NNTS门替换为其最优的LNN量子线路实现，得到该MCT线路的LNN量子线路，该方法可以减少量子线路的长度和量子代价.通过Benchmark例题测试，并与现有的线路近邻化结果进行比较，所需插入的SWAP门数平均减少42.83%，量子代价平均改善率达14.80%.

Abstract

In order to realize the linear nearest neighbor (LNN) arrangement of a quantum circuit

the nearest neighbor Toffoli gates cascade method of an MCT gate is given.To solve the issue of the increased quantum cost resulted from the extra inserted SWAP gates during the process of nearest neighbor

the NNTS gate is introduced to decrease the number of the inserted SWAP gates

and the LNN line arrangement using NNTS gates of an MCT gate is obtained.The line arrangement algorithm is proposed.The LNN line arrangement of each MCT gate can be realized by the exchange of the order of the lines

and each NNTS gate is replaced by its optimal LNN form

then the LNN quantum circuit is obtained directly

which can greatly reduce the length of the quantum circuit and the quantum cost.Test on benchmark circuits

and compared with the existing relevant results

the average improvement rate is almost 42.83% in SWAP gate count

and 14.80% in terms of quantum cost.

关键词

Keywords

references

Views

179

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Divide and Conquer Algorithms for Quantum Circuit Simulation

A Fast Quantum Simulation Algorithm Based on State Vector

Linear Nearest Neighbor Quantum Circuit Synthesis and Optimization Based on the Matrix

Related Author

FONT face

Verdana

XUE Xi-ling

CHEN Han-wu

LIU Zhi-hao

CHEN Xiong

CHEN Han-wu

LIU Zhi-hao

Related Institution

School of Computer Science and Engineering, Southeast University

Key Laboratory of Compwter Network and Information Integration of Ministry of Education,Southeast University

College of Information Engineering, Yangzhou University

School of Computer Science and Engineering Southeast UniversityNanjingJiangsu 211189China

Key Laboratory of Compwter Network and Information Integration of Ministry of EducationSoutheast University NanjingJiangsu 211189China

⁰