PSO inspired global neighbourhood based Qubit mapping: a new approach

IF 2.8 3区 物理与天体物理 Q2 PHYSICS, MULTIDISCIPLINARY The European Physical Journal Plus Pub Date : 2025-01-03 DOI:10.1140/epjp/s13360-024-05928-z
Subhasree Bhattacharjee, Kunal Das, Bikramjit Sarkar
{"title":"PSO inspired global neighbourhood based Qubit mapping: a new approach","authors":"Subhasree Bhattacharjee,&nbsp;Kunal Das,&nbsp;Bikramjit Sarkar","doi":"10.1140/epjp/s13360-024-05928-z","DOIUrl":null,"url":null,"abstract":"<div><p>Due to limited connectivity between physical qubits of quantum devices, it is a real challenge to map a logical circuit to physical hardware device. To ensure proper mapping of logical qubits to physical qubits, this research introduces particle swarm optimization (PSO) inspired global neighbourhood based (GNB) qubit mapping. Starting with an empty initial mapping, degree of each logical qubit of the circuit is computed. Degree of a qubit refers to the number of qubits with which it is connected in the entire circuit. The proposed technique maps the highest degree qubit and its global neighbours initially based on the designed heuristic and then maps the remaining logical qubits in a way that minimizes the total distance to already allocated physical qubits. The concept of \"global neighbours\" refers to all interconnected qubits within a circuit, regardless of the direction of their connections. Thus, the proposed fitness ensures minimization of the sum of the swap count and the degree difference between logical and mapped physical qubits for the complete mapping. The swap count is determined by the distance between mapped physical qubits for each gate. PSO based implementation of GNB yields efficient mapping of benchmark circuits to physical hardware of IBM QX5 in feasible execution time. Number of operations, depth and execution time (in second) of the mapped circuit obtained from PSO is compared with the previous methodologies and also with Genetic Algorithm (GA). PSO exhibits rapid convergence speed and thus showcase its ability to find near-optimal solution in lesser time.</p></div>","PeriodicalId":792,"journal":{"name":"The European Physical Journal Plus","volume":"140 1","pages":""},"PeriodicalIF":2.8000,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The European Physical Journal Plus","FirstCategoryId":"4","ListUrlMain":"https://link.springer.com/article/10.1140/epjp/s13360-024-05928-z","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Due to limited connectivity between physical qubits of quantum devices, it is a real challenge to map a logical circuit to physical hardware device. To ensure proper mapping of logical qubits to physical qubits, this research introduces particle swarm optimization (PSO) inspired global neighbourhood based (GNB) qubit mapping. Starting with an empty initial mapping, degree of each logical qubit of the circuit is computed. Degree of a qubit refers to the number of qubits with which it is connected in the entire circuit. The proposed technique maps the highest degree qubit and its global neighbours initially based on the designed heuristic and then maps the remaining logical qubits in a way that minimizes the total distance to already allocated physical qubits. The concept of "global neighbours" refers to all interconnected qubits within a circuit, regardless of the direction of their connections. Thus, the proposed fitness ensures minimization of the sum of the swap count and the degree difference between logical and mapped physical qubits for the complete mapping. The swap count is determined by the distance between mapped physical qubits for each gate. PSO based implementation of GNB yields efficient mapping of benchmark circuits to physical hardware of IBM QX5 in feasible execution time. Number of operations, depth and execution time (in second) of the mapped circuit obtained from PSO is compared with the previous methodologies and also with Genetic Algorithm (GA). PSO exhibits rapid convergence speed and thus showcase its ability to find near-optimal solution in lesser time.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
The European Physical Journal Plus
The European Physical Journal Plus PHYSICS, MULTIDISCIPLINARY-
CiteScore
5.40
自引率
8.80%
发文量
1150
审稿时长
4-8 weeks
期刊介绍: The aims of this peer-reviewed online journal are to distribute and archive all relevant material required to document, assess, validate and reconstruct in detail the body of knowledge in the physical and related sciences. The scope of EPJ Plus encompasses a broad landscape of fields and disciplines in the physical and related sciences - such as covered by the topical EPJ journals and with the explicit addition of geophysics, astrophysics, general relativity and cosmology, mathematical and quantum physics, classical and fluid mechanics, accelerator and medical physics, as well as physics techniques applied to any other topics, including energy, environment and cultural heritage.
期刊最新文献
Effect of coupling strength and phase lag asymmetries in two-populations with higher-order interaction PSO inspired global neighbourhood based Qubit mapping: a new approach Determination of resistivity of permanent magnets by AC susceptibility measurements Particle motion and lensing with plasma of black hole in coincident \(f\left( \mathbb{Q}, \mathbb{B}_Q\right) \) gravity coupled to nonlinear electrodynamics Exploring 2d localization with a step-dependent coin
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1