检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李振宇[1] 梁晨[1] 张梦凡 韩林 LI Zhen-yu;LIANG Chen;ZHANG Meng-fan;HAN Lin(School of Cyber Science and Engineering,Zhengzhou University,Zhengzhou Henan 450002,China;School of Computer and Artificial Intelligence of ZZU,Zhengzhou Henan 450001,China;National Supercomputing Center In Zhengzhou,Zhengzhou Henan 450001,China)
机构地区:[1]郑州大学网络空间安全学院,河南郑州450002 [2]郑州大学计算机与人工智能学院,河南郑州450001 [3]国家超级计算郑州中心,河南郑州450001
出 处:《计算机仿真》2025年第2期317-321,共5页Computer Simulation
基 金:河南省重大科技专项(221100210600)。
摘 要:量子计算机的运算能力是由量子比特的数量和保真度共同决定的,一台实用的量子计算机需要大量的量子比特协同工作,然而随着单个芯片上比特规模的增加,如何在有限空间的芯片上放置更多的比特,也是需要关注的一个问题。现专注于单个超导量子比特所占的面积,通过设计仿真正多边形和圆形比特,首先提前定好比特电荷能和频率算出T,上限,使用HFSS在相同的条件下改变比特的尺寸和耦合电容器的位置,并实现自动化仿真得到相关参数。实验结果表明在相同T,时间上限的背景下比特形状越接近圆占用面积越小,为后续设计超导量子芯片提供参考。The computing power of the quantum computer is determined by the number and fidelity of quantum bits.A practical quantum computer needs a large number of quantum bits to work together.However,with the increase of the size of bits on a single chip,how to place more bits on a chip with limited space is also a problem that needs to be paid attention to.This paper focuses on the area occupied by a single superconducting qubit.By designing and simulating regular polygons and circular bits,the upper limit of T1 is calculated by determining the bit charge energy and frequency in advance.HFSS is used to change the size of the bit and the position of the coupling capacitor under the same conditions,and the relevant parameters are obtained through automatic simulation.The experimental results show that under the background of the same T1 time upper limit,the closer the bit shape is to the circle,the smaller the occupied area,which provides a reference for the subsequent design of superconducting quantum chips.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.208.57