摘要
最近邻量子电路要求满足最近邻约束,只允许在相邻的量子位之间交互,线性量子电路是量子电路的一个重要部分。研究了表示线性最近邻量子电路布尔矩阵有效性的快速判定方法,时间复杂度从n!(n-1)变为O(n^2)。提出了基于有效布尔矩阵的大规模线性最近邻量子电路的并行综合算法,在不到10 s内对128线的任意线性最近邻量子电路完成了电路综合。提出的并行方法不仅保证了精度,也大大减少了量子电路的综合时间,扩大了求解电路的规模.
The nearest quantum circuit is required to meet the nearest neighbor constraint, and interaction occurs only between the adjacent qubits. The linear quantum circuit is an important part of quantum circuit. Linear nearest neighbor quantum circuit can be represented by Boolean matrix, and the fast determination method for the validity of Boolean matrix is invesiigated. The time complexity is changed from n!（n - 1） to O（n^2）. A parallel synthesis algorithm for large scale linear nearest neighbor quantum circuit is proposed based on the valid Boolean matrix, and the circuit synthesis is completed in less than 10 s for an arbitrary linear nearest neighbor quantum circuit with 128 lines. The proposed parallel method can not only guarantee accuracy, but also greatly reduce synthesis time of quantum circuit, and scale of the solved circuit is expanded.
出处
《量子电子学报》
CAS
CSCD
北大核心
2016年第6期743-750,共8页
Chinese Journal of Quantum Electronics
基金
江苏省自然科学基金(BK20151274)
江苏省高校自然科学研究面上项目(14KJB520033)~~
关键词
量子信息
线性量子电路
线性最近邻
有效布尔矩阵
并行综合算法
quantum information
linear quantum circuit
linear nearest neighbor
valid Boolean matrix
parallel synthesis algorithm
