首页 > 最新文献

IET Quantum Communication最新文献

英文 中文
RSCV: Reversible Select, cross and variation architecture in quantum-dot cellular automata 量子点元胞自动机的可逆选择、交叉和变异结构
Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2022-04-25 DOI: 10.1049/qtc2.12040
Arpita Kundu, Jadav Chandra Das, Debashis De

In the past few years, CMOS semiconductor has been a growing and evolving technology in VLSI. However, due to the scaling issue and some other constraints like heat generation, high power consumption QCA (quantum cellular automata) emerged as an alternate and enhanced solution that provides a new technique of computing than CMOS in recent years. QCA is highly effective in implementing both Irreversible and Reversible logic, which has been shown to be incredibly efficient in terms of power consumption. A novel technique to data encryption called as SCV (select, cross, and variation) is demonstrated in this paper, which is based on ASCII to binary conversion and uses reversible logic. The data security procedure is aided by implementing SCV logic in reversible logic. Using Fredkin gate, it is built in QCA. QCADesigner tool has been used here for design and verification purposes. Total 80 cell counts and 0.14 μm2 area are required. The theoretical data and the simulation results are the same as the intended circuit. Comparison to previous QCA architectural features is featured.

在过去的几年中,CMOS半导体已经成为VLSI中不断发展和发展的技术。然而,由于缩放问题和其他一些限制,如发热,高功耗QCA(量子元胞自动机)近年来成为一种替代和增强的解决方案,提供了一种比CMOS新的计算技术。QCA在实现不可逆和可逆逻辑方面都非常有效,这已被证明在功耗方面具有令人难以置信的效率。本文提出了一种新的数据加密技术SCV (select, cross, and variation),该技术基于ASCII到二进制的转换,采用可逆逻辑。通过在可逆逻辑中实现SCV逻辑来辅助数据安全过程。采用Fredkin门,在QCA中构建。这里使用了qcaddesigner工具进行设计和验证。总共需要80个细胞计数和0.14 μm2的面积。理论数据和仿真结果与设计电路基本一致。与以前的QCA架构特性进行了比较。
{"title":"RSCV: Reversible Select, cross and variation architecture in quantum-dot cellular automata","authors":"Arpita Kundu,&nbsp;Jadav Chandra Das,&nbsp;Debashis De","doi":"10.1049/qtc2.12040","DOIUrl":"https://doi.org/10.1049/qtc2.12040","url":null,"abstract":"<p>In the past few years, CMOS semiconductor has been a growing and evolving technology in VLSI. However, due to the scaling issue and some other constraints like heat generation, high power consumption QCA (quantum cellular automata) emerged as an alternate and enhanced solution that provides a new technique of computing than CMOS in recent years. QCA is highly effective in implementing both Irreversible and Reversible logic, which has been shown to be incredibly efficient in terms of power consumption. A novel technique to data encryption called as SCV (select, cross, and variation) is demonstrated in this paper, which is based on ASCII to binary conversion and uses reversible logic. The data security procedure is aided by implementing SCV logic in reversible logic. Using Fredkin gate, it is built in QCA. QCADesigner tool has been used here for design and verification purposes. Total 80 cell counts and 0.14 μm<sup>2</sup> area are required. The theoretical data and the simulation results are the same as the intended circuit. Comparison to previous QCA architectural features is featured.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 2","pages":"139-149"},"PeriodicalIF":0.0,"publicationDate":"2022-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12040","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137883613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Hardware routed quantum key distribution networks 硬件路由量子密钥分发网络
Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2022-04-08 DOI: 10.1049/qtc2.12039
Ansh Singal, Sundaraja Sitharam Iyengar, Latesh Kumar, Azad M. Madni

Quantum communication networks pose immense potential for revolutionising secure communications for several applications such as banking, defence, etc. The majority literature on quantum networks deals with the problems of networking and resource allocation using Software Defined Networks (SDNs). SDNs, however, introduce several issues, such as app manipulation attacks and scalability issues. We propose a novel scheme of implementing quantum communication networks that are hardware routed rather than software defined by labelling qubit photons using laser communications. We provide a comprehensive implementation of the new scheme and propose two novel algorithms—Bandwidth sharing and Equitable bandwidth sharing to implement the hardware routed quantum network. The algorithms result in a key rate increase of 118% and improved network resource utilization of 147% as compared to the First Come First Serve algorithm.

量子通信网络为银行业、国防等多个应用带来了革命性的安全通信的巨大潜力。关于量子网络的大多数文献都涉及使用软件定义网络(sdn)的网络和资源分配问题。然而,sdn引入了几个问题,例如应用程序操纵攻击和可伸缩性问题。我们提出了一种实现量子通信网络的新方案,该方案通过使用激光通信标记量子比特光子来实现硬件路由而不是软件定义。我们提供了新方案的全面实现,并提出了两种新的算法-带宽共享和公平带宽共享来实现硬件路由量子网络。与先到先得算法相比,该算法使密钥率提高了118%,网络资源利用率提高了147%。
{"title":"Hardware routed quantum key distribution networks","authors":"Ansh Singal,&nbsp;Sundaraja Sitharam Iyengar,&nbsp;Latesh Kumar,&nbsp;Azad M. Madni","doi":"10.1049/qtc2.12039","DOIUrl":"10.1049/qtc2.12039","url":null,"abstract":"<p>Quantum communication networks pose immense potential for revolutionising secure communications for several applications such as banking, defence, etc. The majority literature on quantum networks deals with the problems of networking and resource allocation using Software Defined Networks (SDNs). SDNs, however, introduce several issues, such as app manipulation attacks and scalability issues. We propose a novel scheme of implementing quantum communication networks that are hardware routed rather than software defined by labelling qubit photons using laser communications. We provide a comprehensive implementation of the new scheme and propose two novel algorithms—Bandwidth sharing and Equitable bandwidth sharing to implement the hardware routed quantum network. The algorithms result in a key rate increase of 118% and improved network resource utilization of 147% as compared to the First Come First Serve algorithm.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 2","pages":"127-138"},"PeriodicalIF":0.0,"publicationDate":"2022-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12039","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117274092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
The jump and stagnation of mass with speed 质量随速度的跳跃和停滞
Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2022-03-25 DOI: 10.1049/qtc2.12038
Jun Dong, Na Dong

In the general theory of relativity, the four-dimensional space-time of describing a mass body accelerated motion or in a gravitational field, although it is a curved Riemannian geometric space from the perspective of “integral geometry”, but for any instantaneous position of the moving mass body, there is a local Flat Space of Riemannian geometric space. The local Flat Space is a Mincowski space in which the inertial coordinate system can be used in the local small area. Between the proper coordinate systems of two interacting moving masses, or between a series of following proper coordinate systems experienced by a mass body moving in any way, there should be a coordinate transformation relationship similar to the traditional special theory of relativity. However, they have an important difference: in these instantaneous local inertial systems, the speed of light is no longer the constant c of vacuum, the effect of gravitational field or acceleration on the speed of light is the same as that of a medium with a dielectric constant of ε and a magnetic permeability of μ. Using the special theory of relativity with variable speed of light that the author has established can discuss relevant relativity physics issues in these instantaneous local inertial systems. This article uses the special theory of relativity with variable speed of light to derive the functional relationship between a moving mass and the change of speed. In addition to obtain the traditional continuous increasing function relationship, a step function relationship with stepped discontinuous changes is also obtained. At the same speed, the mass can have two values, such as a ladder upgrade one level; the same mass can be matched with two different speeds, such as one step extension forward on the same step stair. From the perspective of the increase in speed, the mass is stagnant on the step platform (the speed increases, the mass does not change), and it jumps in the step up ladder (the speed does not change, the mass has a jump change). This obviously incorporates the main image of quantum theory into the theory of relativity, which is the result that all physics researchers care about and expect.

在广义相对论中,描述一个质量体加速运动或处于引力场中的四维时空,虽然从“积分几何”的角度来看是一个弯曲的黎曼几何空间,但对于运动质量体的任何瞬时位置,都存在一个局部黎曼几何空间的平坦空间。局部平坦空间是一种闵可夫斯基空间,在该空间中,惯性坐标系可以在局部小区域内使用。在两个相互作用的运动质量的固有坐标系之间,或者一个以任何方式运动的质量体所经历的一系列后续固有坐标系之间,应该存在类似于传统狭义相对论的坐标变换关系。然而,它们有一个重要的区别:在这些瞬时局部惯性系中,光速不再是真空的常数c,引力场或加速度对光速的影响与介电常数ε和磁导率μ的介质的影响相同。利用作者建立的变光速狭义相对论,可以讨论这些瞬时局部惯性系的相关相对论物理问题。本文利用变光速的狭义相对论推导出运动质量与速度变化的函数关系。除了得到传统的连续递增函数关系外,还得到了阶跃不连续变化的阶跃函数关系。在同样的速度下,质量可以有两个值,如梯子升级一级;同样的质量可以与两种不同的速度相匹配,比如在同样的台阶上一步向前延伸。从速度增加的角度看,质量在台阶平台上停滞(速度增加,质量不变),在台阶上升梯上跳跃(速度不变,质量有跳跃变化)。这显然是将量子理论的主要形象融入到相对论中,这是所有物理学研究者所关心和期待的结果。
{"title":"The jump and stagnation of mass with speed","authors":"Jun Dong,&nbsp;Na Dong","doi":"10.1049/qtc2.12038","DOIUrl":"https://doi.org/10.1049/qtc2.12038","url":null,"abstract":"<p>In the general theory of relativity, the four-dimensional space-time of describing a mass body accelerated motion or in a gravitational field, although it is a curved Riemannian geometric space from the perspective of “integral geometry”, but for any instantaneous position of the moving mass body, there is a local Flat Space of Riemannian geometric space. The local Flat Space is a Mincowski space in which the inertial coordinate system can be used in the local small area. Between the proper coordinate systems of two interacting moving masses, or between a series of following proper coordinate systems experienced by a mass body moving in any way, there should be a coordinate transformation relationship similar to the traditional special theory of relativity. However, they have an important difference: in these instantaneous local inertial systems, the speed of light is no longer the constant <i>c</i> of vacuum, the effect of gravitational field or acceleration on the speed of light is the same as that of a medium with a dielectric constant of <i>ε</i> and a magnetic permeability of <i>μ</i>. Using the special theory of relativity with variable speed of light that the author has established can discuss relevant relativity physics issues in these instantaneous local inertial systems. This article uses the special theory of relativity with variable speed of light to derive the functional relationship between a moving mass and the change of speed. In addition to obtain the traditional continuous increasing function relationship, a step function relationship with stepped discontinuous changes is also obtained. At the same speed, the mass can have two values, such as a ladder upgrade one level; the same mass can be matched with two different speeds, such as one step extension forward on the same step stair. From the perspective of the increase in speed, the mass is stagnant on the step platform (the speed increases, the mass does not change), and it jumps in the step up ladder (the speed does not change, the mass has a jump change). This obviously incorporates the main image of quantum theory into the theory of relativity, which is the result that all physics researchers care about and expect.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 2","pages":"118-126"},"PeriodicalIF":0.0,"publicationDate":"2022-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12038","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137548006","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reversible quantum communication & systems 可逆量子通信与系统
Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2022-03-15 DOI: 10.1049/qtc2.12037
Diganta Sengupta, Ahmed Abd El-Latif, Debashis De, Keivan Navi, Nader Bagherzadeh

Quantum Computing has emerged as one of the important dimensions of global research lately, on both the prospects, hardware as well as algorithms. With enhanced processing powers, several architectures based on adiabatic concepts resulting in reversibility have been proposed to date. Architectures based on Quantum Dot Cellular Automata have also shown considerable promise for realising the concept of reversibility. Recently, research has been focussed on the application of quantum computing for faster and secure communication. Dedicated machine learning algorithms and neural networks for quantum computation have also attracted considerable research. With a plethora of research and advances in this domain, this Special Issue publishes outstanding contributions for dissemination of the knowledge of Reversible Quantum Communication & Systems. This Special Issue publishes latest approaches and findings in Quantum Algorithms and Reversible Computing with focus on emerging Machine Learning approaches in Quantum Communications. Reversible Logic forms a pivotal part of Quantum Computing and has been a topic of high interest among Quantum Computing Scientists and researchers throughout the last decade. It also exhibits considerable prospects in recent research due to its adiabatic characteristics. Logic synthesis and optimisation algorithms within the purview of Reversibility have witnessed credible approaches and pose future prospects, such as the rise of Machine Learning approaches which have also penetrated the Quantum Domain.

近年来,量子计算已成为全球研究的重要领域之一,无论是在前景、硬件还是算法方面。随着处理能力的增强,迄今为止已经提出了几种基于绝热概念的体系结构,从而导致可逆性。基于量子点元胞自动机的架构在实现可逆性概念方面也显示出相当大的希望。近年来,研究重点是应用量子计算实现更快、更安全的通信。用于量子计算的专用机器学习算法和神经网络也吸引了大量的研究。随着这一领域的大量研究和进展,本期特刊发表了对可逆量子通信知识传播的杰出贡献。系统。这一期特刊发表了量子算法和可逆计算的最新方法和发现,重点是量子通信中新兴的机器学习方法。可逆逻辑是量子计算的关键组成部分,在过去十年中一直是量子计算科学家和研究人员高度感兴趣的话题。由于它的绝热特性,在最近的研究中也显示出相当大的前景。可逆性范围内的逻辑综合和优化算法已经见证了可靠的方法,并提出了未来的前景,例如机器学习方法的兴起也渗透到了量子领域。
{"title":"Reversible quantum communication & systems","authors":"Diganta Sengupta,&nbsp;Ahmed Abd El-Latif,&nbsp;Debashis De,&nbsp;Keivan Navi,&nbsp;Nader Bagherzadeh","doi":"10.1049/qtc2.12037","DOIUrl":"10.1049/qtc2.12037","url":null,"abstract":"<p>Quantum Computing has emerged as one of the important dimensions of global research lately, on both the prospects, hardware as well as algorithms. With enhanced processing powers, several architectures based on adiabatic concepts resulting in reversibility have been proposed to date. Architectures based on Quantum Dot Cellular Automata have also shown considerable promise for realising the concept of reversibility. Recently, research has been focussed on the application of quantum computing for faster and secure communication. Dedicated machine learning algorithms and neural networks for quantum computation have also attracted considerable research. With a plethora of research and advances in this domain, this Special Issue publishes outstanding contributions for dissemination of the knowledge of Reversible Quantum Communication &amp; Systems. This Special Issue publishes latest approaches and findings in Quantum Algorithms and Reversible Computing with focus on emerging Machine Learning approaches in Quantum Communications. Reversible Logic forms a pivotal part of Quantum Computing and has been a topic of high interest among Quantum Computing Scientists and researchers throughout the last decade. It also exhibits considerable prospects in recent research due to its adiabatic characteristics. Logic synthesis and optimisation algorithms within the purview of Reversibility have witnessed credible approaches and pose future prospects, such as the rise of Machine Learning approaches which have also penetrated the Quantum Domain.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2022-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12037","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123037668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A new online testing technique for reversible circuits 一种新的可逆电路在线测试技术
Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2022-03-04 DOI: 10.1049/qtc2.12035
Joyati Mondal, Debesh Kumar Das

Any technology offering zero power dissipation must be reversible. A reversible circuit can be envisaged as a cascade of reversible gates only, such as Toffoli gate, which has two components: k control bits and a target bit (k-CNOT), k ≥ 1. Analysing testability issues in a reversible circuit is an important phenomenon. A new online design-for-testability (DFT) technique for reversible circuits is proposed. The authors’ method yields less overhead in terms of quantum cost as compared to the previous online approaches.

任何提供零功耗的技术必须是可逆的。可逆电路可以设想为可逆门的级联,例如Toffoli门,它有两个组成部分:k个控制位和一个目标位(k- cnot), k≥1。分析可逆电路中的可测试性问题是一个重要的问题。提出了一种新的可逆电路在线可测性设计(DFT)技术。与之前的在线方法相比,作者的方法在量子成本方面产生的开销更少。
{"title":"A new online testing technique for reversible circuits","authors":"Joyati Mondal,&nbsp;Debesh Kumar Das","doi":"10.1049/qtc2.12035","DOIUrl":"10.1049/qtc2.12035","url":null,"abstract":"<p>Any technology offering zero power dissipation must be reversible. A reversible circuit can be envisaged as a cascade of reversible gates only, such as Toffoli gate, which has two components: <i>k</i> control bits and a target bit (<i>k</i>-CNOT), <i>k</i> ≥ 1. Analysing testability issues in a reversible circuit is an important phenomenon. A new online design-for-testability (DFT) technique for reversible circuits is proposed. The authors’ method yields less overhead in terms of quantum cost as compared to the previous online approaches.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 1","pages":"50-59"},"PeriodicalIF":0.0,"publicationDate":"2022-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12035","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131097877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Performance of coherent-state quantum target detection in the context of asymmetric hypothesis testing 非对称假设检验下相干态量子目标检测性能
Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2022-03-03 DOI: 10.1049/qtc2.12036
Gaetana Spedalieri, Stefano Pirandola

Due to the difficulties of implementing joint measurements, quantum illumination schemes that are based on signal-idler entanglement are difficult to implement in practice. For this reason, one may consider quantum-inspired designs of quantum lidar/radar where the input sources are semi-classical (coherent states) while retaining the quantum aspects of the detection. The performance of these designs could be studied in the context of asymmetric hypothesis testing by resorting to the quantum Stein’s lemma. However, here the authors discuss that, for typical finite-size regimes, the second- and third-order expansions associated with this approach are not sufficient to prove quantum advantage.

由于联合测量难以实现,基于信号闲散纠缠的量子照明方案在实践中难以实现。出于这个原因,人们可以考虑量子启发的量子激光雷达/雷达设计,其中输入源是半经典(相干态),同时保留探测的量子方面。这些设计的性能可以在不对称假设检验的背景下通过诉诸量子斯坦引理来研究。然而,在这里,作者讨论,对于典型的有限大小区域,与此方法相关的二阶和三阶展开不足以证明量子优势。
{"title":"Performance of coherent-state quantum target detection in the context of asymmetric hypothesis testing","authors":"Gaetana Spedalieri,&nbsp;Stefano Pirandola","doi":"10.1049/qtc2.12036","DOIUrl":"10.1049/qtc2.12036","url":null,"abstract":"<p>Due to the difficulties of implementing joint measurements, quantum illumination schemes that are based on signal-idler entanglement are difficult to implement in practice. For this reason, one may consider quantum-inspired designs of quantum lidar/radar where the input sources are semi-classical (coherent states) while retaining the quantum aspects of the detection. The performance of these designs could be studied in the context of asymmetric hypothesis testing by resorting to the quantum Stein’s lemma. However, here the authors discuss that, for typical finite-size regimes, the second- and third-order expansions associated with this approach are not sufficient to prove quantum advantage.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 2","pages":"112-117"},"PeriodicalIF":0.0,"publicationDate":"2022-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12036","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129773460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Unconventional reconciliation path for quantum mechanics and general relativity 量子力学与广义相对论的非常规调和之路
Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2022-01-15 DOI: 10.1049/qtc2.12034
Samuel Polopa Yuguru

Physics in general is successfully governed by quantum mechanics at the microscale and principles of relativity at the macroscale. Any attempts to unify them using conventional methods have somewhat remained elusive for nearly a century up to the present stage. Here, a classical gedanken experiment of electron-wave diffraction of a single slit is intuitively examined for its quantized states. A unidirectional monopole pair (MP) field as quanta of the electric field is pictorially conceptualised into 4D space-time. Its application towards quantum mechanics and general relativity appears consistent with existing knowledge in physics. This considers a multiverse of MP models at a hierarchy of scales. Einsteinian gravity is then defined to be of circular acceleration with angular momentum in time reversal mode to an overarching MP field precessing into forward time. Such descriptions provide a credible intuitive tool for physics applications in general. Its proposed design can be assessed using conventional methods, perhaps in incremental steps and this warrants further investigations.

一般来说,物理学成功地由微观尺度上的量子力学和宏观尺度上的相对性原理所支配。近一个世纪以来,任何用传统方法统一它们的尝试,在某种程度上都是难以捉摸的。本文直观地考察了单缝电子波衍射的经典格丹肯实验的量子化态。单向单极子对(MP)场作为电场的量子被图示地概念化为四维时空。它在量子力学和广义相对论上的应用似乎与现有的物理学知识是一致的。这考虑了在层次结构上的MP模型的多重宇宙。然后,将爱因斯坦引力定义为具有时间反转模式的圆形加速度,其角动量与一个整体的MP场进行正向时间处理。这样的描述为一般的物理应用提供了一个可信的直观工具。它提出的设计可以用传统的方法进行评估,也许是循序渐进的,这值得进一步的研究。
{"title":"Unconventional reconciliation path for quantum mechanics and general relativity","authors":"Samuel Polopa Yuguru","doi":"10.1049/qtc2.12034","DOIUrl":"https://doi.org/10.1049/qtc2.12034","url":null,"abstract":"<p>Physics in general is successfully governed by quantum mechanics at the microscale and principles of relativity at the macroscale. Any attempts to unify them using conventional methods have somewhat remained elusive for nearly a century up to the present stage. Here, a classical gedanken experiment of electron-wave diffraction of a single slit is intuitively examined for its quantized states. A unidirectional monopole pair (MP) field as quanta of the electric field is pictorially conceptualised into 4D space-time. Its application towards quantum mechanics and general relativity appears consistent with existing knowledge in physics. This considers a multiverse of MP models at a hierarchy of scales. Einsteinian gravity is then defined to be of circular acceleration with angular momentum in time reversal mode to an overarching MP field precessing into forward time. Such descriptions provide a credible intuitive tool for physics applications in general. Its proposed design can be assessed using conventional methods, perhaps in incremental steps and this warrants further investigations.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 2","pages":"99-111"},"PeriodicalIF":0.0,"publicationDate":"2022-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12034","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137523825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Encoding patterns for quantum algorithms 量子算法的编码模式
Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2021-12-10 DOI: 10.1049/qtc2.12032
Manuela Weigold, Johanna Barzen, Frank Leymann, Marie Salm

As quantum computers are based on the laws of quantum mechanics, they are capable of solving certain problems faster than their classical counterparts. However, quantum algorithms with a theoretical speed-up often assume that data can be loaded efficiently. In general, the runtime complexity of the loading routine depends on (i) the data encoding that defines how the data is represented by the state of the quantum computer and (ii) the data itself. In some cases, loading the data requires at least exponential time that destroys a potential speed-up. And especially for the first generation of devices that are currently available, the resources (qubits and operations) needed to encode the data are limited. In this work, we, therefore, present six patterns that describe how data is handled by quantum computers.

由于量子计算机基于量子力学定律,它们能够比经典计算机更快地解决某些问题。然而,理论上加速的量子算法通常假设数据可以有效加载。一般来说,加载例程的运行时复杂性取决于(i)数据编码,该编码定义了如何用量子计算机的状态表示数据,以及(ii)数据本身。在某些情况下,加载数据至少需要指数级的时间,这会破坏潜在的加速。特别是对于目前可用的第一代设备,编码数据所需的资源(量子比特和操作)是有限的。因此,在这项工作中,我们提出了描述量子计算机如何处理数据的六种模式。
{"title":"Encoding patterns for quantum algorithms","authors":"Manuela Weigold,&nbsp;Johanna Barzen,&nbsp;Frank Leymann,&nbsp;Marie Salm","doi":"10.1049/qtc2.12032","DOIUrl":"10.1049/qtc2.12032","url":null,"abstract":"<p>As quantum computers are based on the laws of quantum mechanics, they are capable of solving certain problems faster than their classical counterparts. However, quantum algorithms with a theoretical speed-up often assume that data can be loaded efficiently. In general, the runtime complexity of the loading routine depends on (i) the data encoding that defines how the data is represented by the state of the quantum computer and (ii) the data itself. In some cases, loading the data requires at least exponential time that destroys a potential speed-up. And especially for the first generation of devices that are currently available, the resources (qubits and operations) needed to encode the data are limited. In this work, we, therefore, present six patterns that describe how data is handled by quantum computers.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"2 4","pages":"141-152"},"PeriodicalIF":0.0,"publicationDate":"2021-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12032","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125615537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 25
Circuit design for clique problem and its implementation on quantum computer 团问题的电路设计及其在量子计算机上的实现
Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2021-12-09 DOI: 10.1049/qtc2.12029
Arpita Sanyal Bhaduri, Amit Saha, Banani Saha, Amlan Chakrabarti

Finding cliques in a graph has a wide range of applications due to its pattern matching ability. The k-clique problem, a subset of the clique problem, determines whether or not an arbitrary network has a clique of size k. Modern-day applications include a variation of the k-clique problem that lists all cliques of size k. However, the quantum implementation of such a variation of the k-clique problem has not been addressed yet. In this work, apart from the theoretical solution of such a k-clique problem, practical quantum-gate-based implementation has been addressed using Grover's algorithm. In a classical-quantum hybrid architecture, this approach is extended to build the circuit for the maximum clique problem. Our technique is generalised since the program automatically builds the circuit for any given undirected and unweighted graph and any chosen k. For a small k with regard to a big graph, the proposed solution to addressing the k-clique issue has shown a reduction in qubit cost and circuit depth when compared to the state-of-the-art approach. A framework is also presented for mapping the automated generated circuit for clique problems to quantum devices. Using IBM's Qiskit, an analysis of the experimental results is demonstrated.

由于其模式匹配能力,在图中查找团块具有广泛的应用。k-clique问题是团问题的一个子集,它决定了任意网络是否具有大小为k的团。现代应用包括列出大小为k的所有团的k-clique问题的变体。然而,k-clique问题的这种变体的量子实现尚未得到解决。在这项工作中,除了这种k团问题的理论解决方案外,还使用Grover算法解决了基于量子门的实际实现。在经典量子混合体系结构中,将此方法扩展到最大团问题的电路构建。我们的技术是泛化的,因为程序会自动为任何给定的无向和无权图以及任何选择的k构建电路。对于大图的小k,与最先进的方法相比,解决k团问题的建议解决方案显示出量子位成本和电路深度的降低。提出了将团问题的自动生成电路映射到量子器件的框架。利用IBM的Qiskit对实验结果进行了分析。
{"title":"Circuit design for clique problem and its implementation on quantum computer","authors":"Arpita Sanyal Bhaduri,&nbsp;Amit Saha,&nbsp;Banani Saha,&nbsp;Amlan Chakrabarti","doi":"10.1049/qtc2.12029","DOIUrl":"10.1049/qtc2.12029","url":null,"abstract":"<p>Finding cliques in a graph has a wide range of applications due to its pattern matching ability. The <i>k</i>-clique problem, a subset of the clique problem, determines whether or not an arbitrary network has a clique of size <i>k</i>. Modern-day applications include a variation of the <i>k</i>-clique problem that lists all cliques of size <i>k</i>. However, the quantum implementation of such a variation of the <i>k</i>-clique problem has not been addressed yet. In this work, apart from the theoretical solution of such a <i>k</i>-clique problem, practical quantum-gate-based implementation has been addressed using Grover's algorithm. In a classical-quantum hybrid architecture, this approach is extended to build the circuit for the maximum clique problem. Our technique is generalised since the program automatically builds the circuit for any given undirected and unweighted graph and any chosen <i>k</i>. For a small <i>k</i> with regard to a big graph, the proposed solution to addressing the <i>k</i>-clique issue has shown a reduction in qubit cost and circuit depth when compared to the state-of-the-art approach. A framework is also presented for mapping the automated generated circuit for clique problems to quantum devices. Using IBM's Qiskit, an analysis of the experimental results is demonstrated.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 1","pages":"30-49"},"PeriodicalIF":0.0,"publicationDate":"2021-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12029","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129905279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Guest editorial: Selected extended papers from the Quantum Software Architecture Workshop at IEEE International Conference on Software Architecture 2021 (ICSA 2021) 客座编辑:IEEE国际软件架构会议2021 (ICSA 2021)量子软件架构研讨会扩展论文选集
Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2021-12-07 DOI: 10.1049/qtc2.12031
Johanna Barzen, Sebastian Feld, Frank Leymann, Karoline Wild
<p>At a fast pace, applications of quantum algorithms are being built by industrial and academic users to gain experiences with this quickly evolving technology. The more these endeavours are shifting from an experimental stage towards solving real practical problems, it becomes clear that a systematic approach is needed to develop the corresponding quantum applications. This need is based on the fact that software that involves quantum computers is very different from classical software. Such a systematic approach for building quantum software must especially consider the early phases of the corresponding development process addressing the architecture of quantum software.</p><p>Guidelines for successful quantum software architecture are missing and research in this domain has just begun. Questions to be answered include, for example, which architectural style should be followed, or whether there are already established best practices? Real-world quantum software is most often hybrid—that is, a quantum application consists of quantum circuits as well as classical programs. This implies that building a quantum application means having to solve a corresponding integration problem. For decades, such integration problems are addressed by workflow technology, implying a first architectural style for building hybrid quantum software. A quantum circuit that processes data expects this data as quantum states. Such states can be prepared by using any of a multitude of approaches each having pros and cons. The knowledge about these solutions can be presented as patterns, indicating the relevance of architectural pattern languages for hybrid quantum applications.</p><p>Running individual circuits is appropriate for initial experiments with quantum algorithms. But when quantum software is used in production, issues such as scalability, availability, or security, for example, appear. Furthermore, it should not be assumed that all quantum software is developed from scratch. Instead, existing applications should be reused as much as possible to accelerate benefitting from potential speedups or enhanced precision of quantum algorithms. For this purpose, methods for re-factoring existing applications, for example, are needed.</p><p>The articles in this special issue are partly based on contributions of the <i>1st Workshop on Quantum Software Architecture</i>. The goal of this workshop was to bring together researchers and practitioners from different areas of quantum computing and (classical) software architecture to help shaping a quantum software community and to discuss problems and solutions for hybrid quantum software like the ones mentioned above.</p><p>The workshop also proposed solutions to several questions of a lifecycle for developing hybrid quantum software on how to test implemented quantum software, how to migrate from proof of concepts to productive systems, how to automate the deployment of hybrid quantum software, and how to specify KPIs for mea
工业和学术用户正在快速构建量子算法的应用程序,以获得这种快速发展的技术的经验。这些努力越是从实验阶段转向解决实际问题,就越清楚需要一种系统的方法来开发相应的量子应用。这种需求是基于这样一个事实,即涉及量子计算机的软件与经典软件非常不同。这种构建量子软件的系统方法必须特别考虑解决量子软件体系结构的相应开发过程的早期阶段。成功的量子软件架构的指导方针是缺失的,在这个领域的研究才刚刚开始。要回答的问题包括,例如,应该遵循哪种架构风格,或者是否已经建立了最佳实践?现实世界的量子软件通常是混合的——也就是说,量子应用程序由量子电路和经典程序组成。这意味着构建量子应用程序意味着必须解决相应的集成问题。几十年来,工作流技术解决了这样的集成问题,这意味着构建混合量子软件的第一种架构风格。处理数据的量子电路期望这些数据作为量子态。这种状态可以通过使用多种方法中的任何一种来准备,每种方法都有优缺点。关于这些解决方案的知识可以作为模式来表示,这表明了混合量子应用程序的架构模式语言的相关性。运行单独的电路对于量子算法的初始实验是合适的。但是,当量子软件用于生产时,诸如可伸缩性、可用性或安全性等问题就会出现。此外,我们不应该假设所有的量子软件都是从零开始开发的。相反,现有的应用程序应该尽可能地重用,以加速受益于潜在的速度或量子算法的提高精度。为此,需要重构现有应用程序的方法。本期特刊中的文章部分基于第一届量子软件架构研讨会的贡献。本次研讨会的目标是将来自量子计算和(经典)软件架构不同领域的研究人员和实践者聚集在一起,帮助塑造一个量子软件社区,并讨论上述混合量子软件的问题和解决方案。研讨会还提出了开发混合量子软件生命周期的几个问题的解决方案,包括如何测试实现的量子软件,如何从概念证明迁移到生产系统,如何自动化混合量子软件的部署,以及如何指定衡量解决方案质量的kpi。行业领袖发表的两个主题演讲为会议画上了句号,并开启了进一步的讨论。四篇论文被选入本期特刊。其中三个是研讨会提交的扩展版本,增加了对原始出版物的进一步见解。《量子算法的编码模式》,作者:Manuela Weigold和Marie Salm。第一篇论文提出了正在构建的量子计算模式语言的扩展。描述了量子算法的其他数据编码模式。这有助于理解状态准备电路对整个算法的(潜在的严重)后果,这可能会减少潜在的量子加速。Gerhard Hellstern的《用于分类任务的混合量子网络分析》。第二篇文章提出了一种用于金融和MNIST数据分类的混合量子-经典神经网络。与纯经典神经网络相比,量子-经典混合神经网络具有性能优势,但同时也存在过拟合的问题。由Thien Nguyen等人撰写的《QuaSiMo:一个用于量子模拟混合工作流编程的可组合库》下一篇论文将提出一种混合量子经典算法的可组合编程方案以及用于量子模拟的混合工作流。为此目的,构建了一组具有表现力的数据结构,并伴随着能够开发复杂混合应用程序的新方法。《qproof:量子计算的溯源系统》,作者:Benjamin Weder等。最后一篇论文关注的是来源:它确定了在具体设备上构建混合量子应用程序时相关的信息。提出了一种用于量子计算的溯源系统,该系统可以自动收集识别信息,并在特殊的溯源数据库中以统一的方式进行准备。不存在利益冲突。
{"title":"Guest editorial: Selected extended papers from the Quantum Software Architecture Workshop at IEEE International Conference on Software Architecture 2021 (ICSA 2021)","authors":"Johanna Barzen,&nbsp;Sebastian Feld,&nbsp;Frank Leymann,&nbsp;Karoline Wild","doi":"10.1049/qtc2.12031","DOIUrl":"10.1049/qtc2.12031","url":null,"abstract":"&lt;p&gt;At a fast pace, applications of quantum algorithms are being built by industrial and academic users to gain experiences with this quickly evolving technology. The more these endeavours are shifting from an experimental stage towards solving real practical problems, it becomes clear that a systematic approach is needed to develop the corresponding quantum applications. This need is based on the fact that software that involves quantum computers is very different from classical software. Such a systematic approach for building quantum software must especially consider the early phases of the corresponding development process addressing the architecture of quantum software.&lt;/p&gt;&lt;p&gt;Guidelines for successful quantum software architecture are missing and research in this domain has just begun. Questions to be answered include, for example, which architectural style should be followed, or whether there are already established best practices? Real-world quantum software is most often hybrid—that is, a quantum application consists of quantum circuits as well as classical programs. This implies that building a quantum application means having to solve a corresponding integration problem. For decades, such integration problems are addressed by workflow technology, implying a first architectural style for building hybrid quantum software. A quantum circuit that processes data expects this data as quantum states. Such states can be prepared by using any of a multitude of approaches each having pros and cons. The knowledge about these solutions can be presented as patterns, indicating the relevance of architectural pattern languages for hybrid quantum applications.&lt;/p&gt;&lt;p&gt;Running individual circuits is appropriate for initial experiments with quantum algorithms. But when quantum software is used in production, issues such as scalability, availability, or security, for example, appear. Furthermore, it should not be assumed that all quantum software is developed from scratch. Instead, existing applications should be reused as much as possible to accelerate benefitting from potential speedups or enhanced precision of quantum algorithms. For this purpose, methods for re-factoring existing applications, for example, are needed.&lt;/p&gt;&lt;p&gt;The articles in this special issue are partly based on contributions of the &lt;i&gt;1st Workshop on Quantum Software Architecture&lt;/i&gt;. The goal of this workshop was to bring together researchers and practitioners from different areas of quantum computing and (classical) software architecture to help shaping a quantum software community and to discuss problems and solutions for hybrid quantum software like the ones mentioned above.&lt;/p&gt;&lt;p&gt;The workshop also proposed solutions to several questions of a lifecycle for developing hybrid quantum software on how to test implemented quantum software, how to migrate from proof of concepts to productive systems, how to automate the deployment of hybrid quantum software, and how to specify KPIs for mea","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"2 4","pages":"139-140"},"PeriodicalIF":0.0,"publicationDate":"2021-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12031","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82569601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
IET Quantum Communication
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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