Ruiqi Liu, Georgi Gary Rozenman, Neel Kanth Kundu, Daryus Chandra, Debashis De
{"title":"Towards the industrialisation of quantum key distribution in communication networks: A short survey","authors":"Ruiqi Liu, Georgi Gary Rozenman, Neel Kanth Kundu, Daryus Chandra, Debashis De","doi":"10.1049/qtc2.12044","DOIUrl":"10.1049/qtc2.12044","url":null,"abstract":"<p>Quantum information and communication technology will lead us to the new era of ultra-fast and absolute-secure networks. With the emergence of quantum supremacy on the horizon, the security of various classical encryption systems soon may be deemed obsolete. As a remedy, quantum key distribution (QKD) is proposed as a novel quantum-based secret keys exchange, which is developed to solve the problems of legacy encryption. It is anticipated that QKD will provide stronger security for future communication systems even in the presence of malicious quantum attacks. As the QKD research and development is getting mature, the theoretical use cases of QKD in various industries are proliferating. In this treatise, we summarise the potential applications of QKD for future communication technology while highlighting the ongoing standardisation efforts essential for the sustainability and reliability of the near-future deployment. Additionally, we also present the various challenges faced by both discrete variable and continuous variable QKD schemes hindering their widespread implementation into our future communication networks.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 3","pages":"151-163"},"PeriodicalIF":0.0,"publicationDate":"2022-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12044","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114897932","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}
Ranveer Kumar Singh, Bishvanwesha Panda, Bikash K. Behera, Prasanta K. Panigrahi
{"title":"Demonstration of a general fault-tolerant quantum error detection code for (2n + 1)-qubit entangled state on IBM 16-qubit quantum computer","authors":"Ranveer Kumar Singh, Bishvanwesha Panda, Bikash K. Behera, Prasanta K. Panigrahi","doi":"10.1049/qtc2.12043","DOIUrl":"10.1049/qtc2.12043","url":null,"abstract":"<p>Quantum error detection has always been a fundamental challenge in a fault-tolerant quantum computer. Hence, it is of immense importance to detect and deal with arbitrary errors to efficiently perform quantum computation. Several error detection codes have been proposed and realised for lower number of qubit systems. Here we present an error detection code for a (2<i>n</i> + 1)-qubit entangled state using two syndrome qubits and simulate it on International Business Machines 16-qubit quantum computer for a 13-qubit entangled system. The code is able to detect an arbitrary quantum error in any one of the first 2<i>n</i> qubits of the (2<i>n</i> + 1)-qubit entangled state and detects any bit-flip error on the last qubit of the (2<i>n</i> + 1)-qubit entangled state via measurements on a pair of ancillary error syndrome qubits. The protocol presented here paves the way for designing error detection codes for the general higher number of entangled qubit systems.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 3","pages":"184-199"},"PeriodicalIF":0.0,"publicationDate":"2022-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12043","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115997159","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}
{"title":"Surface code design for asymmetric error channels","authors":"Utkarsh Azad, Aleksandra Lipińska, Shilpa Mahato, Rijul Sachdeva, Debasmita Bhoumik, Ritajit Majumdar","doi":"10.1049/qtc2.12042","DOIUrl":"10.1049/qtc2.12042","url":null,"abstract":"<p>Surface codes are quantum error correcting codes typically defined on a 2D array of qubits. A [<i>d</i><sub><i>x</i></sub>, <i>d</i><sub><i>z</i></sub>] surface code design is being introduced, where <i>d</i><sub><i>x</i></sub>(<i>d</i><sub><i>z</i></sub>) represents the distance of the code for bit (phase) error correction, motivated by the fact that the severity of bit flip and phase flip errors in the physical quantum system is asymmetric. We present pseudo-threshold and threshold values for the proposed surface code design for asymmetric error channels in the presence of various degrees of asymmetry of <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mtext>Pauli</mtext>\u0000 <mrow>\u0000 <mspace></mspace>\u0000 <mover>\u0000 <mi>X</mi>\u0000 <mo>^</mo>\u0000 </mover>\u0000 <mo>,</mo>\u0000 <mspace></mspace>\u0000 <mrow>\u0000 <mover>\u0000 <mi>Y</mi>\u0000 <mo>^</mo>\u0000 </mover>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $text{Pauli},hat{X},,hat{Y}$</annotation>\u0000 </semantics></math>, <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mtext>and</mtext>\u0000 <mrow>\u0000 <mspace></mspace>\u0000 <mover>\u0000 <mi>Z</mi>\u0000 <mo>^</mo>\u0000 </mover>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $text{and},hat{Z}$</annotation>\u0000 </semantics></math> errors in a depolarisation channel. We demonstrate that compared to symmetric surface codes, our asymmetric surface codes can provide almost double the pseudo-threshold rates while requiring less than half the number of physical qubits in the presence of increasing asymmetry in the error channel. Our results show that for low degree of asymmetry, it is advantageous to increase <i>d</i><sub><i>x</i></sub> along with <i>d</i><sub><i>z</i></sub>. However, as the asymmetry of the channel increases, higher pseudo-threshold is obtained with increasing <i>d</i><sub><i>z</i></sub> when <i>d</i><sub><i>x</i></sub> is kept constant at a low value. Additionally, we also show that the advantage in the pseudo-threshold rates begins to saturate for any possible degree of asymmetry in the error channel as the surface code asymmetry is continued to be increased.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 3","pages":"174-183"},"PeriodicalIF":0.0,"publicationDate":"2022-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12042","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132828576","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}
Arpita Kundu, Bikash Debnath, Jadav Chandra Das, Debashis De
{"title":"Digital signature technique with quantum-dot cellular automata","authors":"Arpita Kundu, Bikash Debnath, Jadav Chandra Das, Debashis De","doi":"10.1049/qtc2.12041","DOIUrl":"10.1049/qtc2.12041","url":null,"abstract":"<p>Quantum-dot cellular automaton (QCA) is efficient nanotechnology that may be used as an alternative to Complementary Metal Oxide Semiconductor technology. Here, computation relies upon the electron's polarisation, revealing binary information. Quantum-dot cellular automaton is an appropriate opportunity for the upcoming age of advanced digital frameworks. Security in transferring data is essential since a lot of valuable information is present. Digital Signature is a process where data is transferred from a receiver to an authenticated sender only. In this paper, tile-based Exclusive NOR gate (XNOR) is designed, which is more stable than the regular majority gate-based circuit. It is used to create a novel circuit for authentication of data which is based on tiles. It develops a QCA architecture that works on the principle of Digital Signature. The architecture validates and proves the authentication of the message sent from the sender to the receiver. The decrypted digest and the converted digest of the original dispatch are compared in the proposed Digital Validator circuit, which is developed utilising a QCA XNOR gate. The security for communication at the nanoscale level is enhanced due to the use of the SHA-256 algorithm. The simulation results confirm the theoretical results.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 3","pages":"164-173"},"PeriodicalIF":0.0,"publicationDate":"2022-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12041","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133961997","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}
{"title":"RSCV: Reversible Select, cross and variation architecture in quantum-dot cellular automata","authors":"Arpita Kundu, Jadav Chandra Das, 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}
Ansh Singal, Sundaraja Sitharam Iyengar, Latesh Kumar, Azad M. Madni
{"title":"Hardware routed quantum key distribution networks","authors":"Ansh Singal, Sundaraja Sitharam Iyengar, Latesh Kumar, 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}
{"title":"The jump and stagnation of mass with speed","authors":"Jun Dong, 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}
Diganta Sengupta, Ahmed Abd El-Latif, Debashis De, Keivan Navi, Nader Bagherzadeh
{"title":"Reversible quantum communication & systems","authors":"Diganta Sengupta, Ahmed Abd El-Latif, Debashis De, Keivan Navi, 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 & 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}
{"title":"A new online testing technique for reversible circuits","authors":"Joyati Mondal, 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}
{"title":"Performance of coherent-state quantum target detection in the context of asymmetric hypothesis testing","authors":"Gaetana Spedalieri, 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}