计算机科学

计算机科学 ›› 2026, Vol. 53 ›› Issue (6A): 250700147-7.doi: 10.11896/jsjkx.250700147

• 人工智能 • 上一篇    下一篇

融合量子信息的人工旅鼠算法在Qubit映射中的应用

杜左强1, 刘述娟1, 李晖1,2   

  1. 1 哈尔滨商业大学计算机与信息工程学院 哈尔滨 150028
    2 黑龙江省电子商务与信息处理重点实验室 哈尔滨 150028
  • 出版日期:2026-06-16 发布日期:2026-06-12
  • 通讯作者: 李晖(hrbcu_lh@163.com)
  • 作者简介:(bendian2006@163.com)
  • 基金资助:
    黑龙江省自然科学基金(LH2024F042);黑龙江省普通本科高等学校青年创新人才培养计划(UNPYSCT-2020212);哈尔滨商业大学“青年科研创新人才”培育计划(2023-KYYWF-0983)

Application of Quantum Information Fusing Artificial Lemming Algorithm in Qubit Mapping

DU Zuoqiang1, LIU Shujuan1, LI Hui1,2   

  1. 1 School of Computer and Information Engineering,Harbin University of Commerce,Harbin 150028,China
    2 Heilongjiang Provincial Key Laboratory of Electronic Commerce and Information Processing,Harbin 150028,China
  • Published:2026-06-16 Online:2026-06-12
  • About author:DU Zuoqiang,born in 1977,master,se-nior engineer,is a member of CCF(No.T1017M).His main research interests include quantum circuit optimization,and so on.
    LI Hui,born in 1985,Ph.D,professor,master's supervisor,is a senior member of CCF(No.K9013S).His main research interests include quantum computing and quantum information processing.
  • Supported by:
    Natural Science Foundation of Heilongjiang Province,China(LH2024F042),University Nursing Program for Young Scholars with Creative Talents in Heilongjiang Province(UNPYSCT-2020212) and Science Foundation of Harbin Commerce University(2023-KYYWF-0983).

PDF (PC)

38

摘要： 针对传统量子电路Qubit映射算法受到电路结构限制和硬件耦合影响,导致全局优化效果不够显著,附加门数较多等问题,提出了一种融合量子信息的人工旅鼠算法(Quantum Information Fusing Artificial Lemming Algorithm),并将其应用于量子电路Qubit映射过程中。在传统ALA的基础上引入Bloch球面量子编码技术对种群进行扩容,增加解空间范围的同时,保证系统演化初期个体对多方向探索的可能性;设计基于量子旋转的t分布个体变异方式增强种群演化的多样性,利用量子隧穿效应避免陷入局部最优;设计了自适应搜索方向因子,并讨论全局搜索和局部开发平衡方式,以确保全局优化过程的灵活性和快速性。30个基础测试电路结果表明:相对于传统ALA,QALA附加门数减少100%。同时,在t|ket〉和Qiskit编译器测试中,相比于传统IBM基准测试方法,QALA附加的SWAP门数分别平均减少35.8%和47.8%,CNOT门数分别平均减少12.9%和13.8%,执行时间分别平均减少5.8%和6.4%,从而验证了所提算法在不同编译环境下的适用性。

关键词: 量子电路, Qubit映射, 融合量子信息的人工旅鼠算法, 量子旋转, Bloch球坐标

Abstract: Aiming at the problems that the traditional Qubit mapping algorithm of quantum circuits is limited by the circuit structure and hardware coupling,resulting in insufficient global optimization effect and a large number of additional SWAP gates,this paper proposes an quantum information fusing artificial lemming algorithm(QALA) and applies the algorithm to the qubit mapping process of quantum circuits.Based on the traditional ALA,the Bloch spherical quantum coding technology is introduced to expand the population,increasing the range of the solution space while ensuring the possibility of individuals exploring in multiple directions in the early stage of system evolution.The individual variation mode of t-distribution based on quantum rotation is designed to enhance the diversity of population evolution,and the quantum tunneling effect is utilized to avoid falling into local optimum.An adaptive search direction factor is designed,and the balancing methods of global search and local development are discussed to ensure the flexibility and rapidity of the global optimization process.Results of 30 benchmark test circuits show that,compared with the traditional ALA,the additional gate number of QALA is reduced by 100%.Meanwhile,in the t|ket〉 and Qiskit compilers,compared with the traditional IBM benchmark test methods,the number of SWAP gates added by QALA is decreased by an average of 35.8% and 47.8%,the number of CNOT gates is decreased by an average of 12.9% and 13.8%,and the execution time is decreased by an average of 5.8% and 6.4% respectively.Experiments results show the applicability of the proposed algorithm in different compilation environments.

Key words: Quantum circuits, Qubit mapping, Quantum information fusing artificial lemming algorithm, Quantum rotation, Bloch sphere coordinates

中图分类号: 

  • TP391
[1] WU Y,BAO W S,CAO S,et al.Strong quantum computational advantage using a superconducting quantum processor[J].Physi-cal Review Letters,2021,127(18):180501.
[2] BLINOV S,WU B,MONROE C.Comparison of cloud-based ion trap and superconducting quantum computer architectures[J].AVS Quantum Science,2021,3(3):33-801.
[3] KHUMALO M.Review of Quantum Optimisation Techniquesfor the Quadratic Assignment Problem[D].Johannesburgy:University of the Witwatersrand,2023:3178-7376.
[4] DING Y,WU X C,HOLMES A,et al.Square:Strategic quantum ancilla reuse for modular quantum programs via cost-effective uncomputation[C]//2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture(ISCA).IEEE,2020:570-583.
[5] ZHU P,GUAN Z,CHENG X.A dynamic look-ahead heuristic for the qubit mapping problem of NISQ computers[J].IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,2020,39(12):4721-4735.
[6] KHAIRY S,SHAYDULIN R,CINCIO L,et al.Learning to opti-mize variational quantum circuits to solve combinatorial problems[C]//Proceedings of the AAAI Conference on Artificial Intelligence.2020:2367-2375.
[7] LI J,ALAM M,SAKI A A,et al.Hierarchical improvement of quantum approximate optimization algorithm for object detection[C]//2020 21st International Symposium on Quality Electronic Design(ISQED).IEEE,2020:335-340.
[8] ZHANG C Y,SHANG T,LIU J W.SWAP-Based Prospective Heuristic Quantum Circuit Mapping Algorithm [J].Journal of University of Electronic Science and Technology of China,2023,52(4):489-497.
[9] SIRAICHI M Y,SANTOS V F,COLLANGE C,et al.Qubit allocation[C]//Proceedings of the 2018 International Symposium on Code Generation and Optimization.2018:113-125.
[10] FAN H,GUO C,LU K W.Optimizing quantum circuit placement via machine learning[C]//Proceedings of the 59th ACM/IEEE Design Automation Conference.2022:19-24.
[11] TANNU S S,QURESHIM K.Not all qubits are created equal:A case for variability-aware policies for NISQ-era quantum computers[C]//Proceedings of the Twenty-fourth International Conference on Architectural Support for Programming Languages and Operating Systems.2019:987-999.
[12] LIU H,ZHANG B,ZHU Y,et al.QM-DLA:an efficient qubit mapping method based on dynamic look-ahead strategy[J].Scientific Reports,2024,14(1):13118.
[13] LAO L,VAN SOMEREN H,ASHRAF I,et al.Timing and resource-aware mapping of quantum circuits to superconducting processors[J].IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,2021,41(2):359-371.
[14] ZHOU X,LI S,FENG Y.Quantum circuit transformation based on simulated annealing and heuristic search[J].IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,2020,39(12):4683-4694.
[15] LAO L,BROWNED E.2qan:A quantum compiler for 2-localqubit hamiltonian simulation algorithms[C]//Proceedings of the 49th Annual International Symposium on Computer Architecture.2022:351-365.
[16] STEINBERG M A,FELD S,ALMUDEVER C G,et al.Topological-graph dependencies and scaling properties of a heuristic qubit-assignment algorithm[J].IEEE Transactions on Quantum Engineering,2022,3:1-14.
[17] DOU X L,LIU L,CHEN Y T.An Investigation into Quantum Program Mapping on Superconducting Quantum Computers [J].Journal of Computer Research and Development,2021,58(9):1856-1874.
[18] LIU X N,AN J L,HE M,et al.Chaotic Adaptive QuantumFirefly Algorithm[J].Computer Science,2023,50(4):204-211.
[19] LI H,LU K,HAN Z,et al.Research on Qubit Mapping Technique Based on Batch SWAP Optimization[J].International Journal of Advanced Computer Science & Applications,2023,14(12).
[20] HAN Z,LI H,LU K,et al.Application of Genetic-InspiredMapping Strategy in Quantum Circuit Optimization[J].Computer Engineering and Applications,2025,61(5):94-103.
[21] LI H,LIU S J,JU M M,et al.High Frequency-Dense QuantumGate Set Optimization Algorithm for Quantum Circuit in NISQ Era [J].Computer Science,1-15[2025-07-20] .http://kns.cnki.net/kcms/detail/50.1075.TP.20250515.1001.006.html.
[22] SILVA A,ZHANG X,WEBB Z,et al.Multi-qubit Lattice Surgery Scheduling[J].arXiv:2405.17688,2024.
[23] NEHA K.Quantum programming:working with IBM'S qiskit tool[J].The Scientific Temper,2023,14(1):93-99.
[24] SIVARAJAH S,DILKES S,COWTANA,et al.t|ket〉:a retargetable compiler for NISQ devices[J].Quantum Science and Technology,2020,6(1):014003.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
地址：重庆市两江新区洪湖西路18号    邮编：401121  
电话：023-63500828（编辑部） 023-67039612（会议/专题） 023-67039623（财务/发票）
E-mail：jsjkx12@163.com
本系统由北京玛格泰克科技发展有限公司设计开发