Keshav Kasliwal, Jayanthi P N, Adarsh Jain, Rajesh Kumar Bahl
{"title":"Enhancing satellite-to-ground communication using quantum key distribution","authors":"Keshav Kasliwal, Jayanthi P N, Adarsh Jain, Rajesh Kumar Bahl","doi":"10.1049/qtc2.12053","DOIUrl":"https://doi.org/10.1049/qtc2.12053","url":null,"abstract":"<p>Classical Cryptography has been in use for a long time. It has been the only way of securing people's communication. However, there are some flaws observed during the execution of classical cryptography. One of them being the staunch belief that the number composed of multiplication of two large prime numbers cannot be factorised easily, which is under a threat thanks to the computational power of the quantum computers. The next flaw is the non-detection of the hacker, both of which can be eliminated by using quantum mechanical principles for encryption purposes, which is known as quantum cryptography. Quantum Key Distribution, which provides an information-theoretically safe solution to the key exchange problem, is the most well-known example of quantum cryptography. The benefit of quantum cryptography is that it makes it possible to perform a variety of cryptographic operations that have been demonstrated or are hypothesised to be impractical when using solely traditional (i.e., non-quantum) communication. Free-space quantum communication has been successfully demonstrated across 300 m by the Indian Space Research Organization (ISRO) in March 2021. With this, ISRO is trying to achieve the same using a satellite-based communication mechanism, which would revolutionise the mode of modern communication. It is justified that the key generation rate depends on factors like the aperture diameter of the sender and receiver, distance between them, the quantum bit error rate, and many more. The results vary with the parameters in the discussion as explained in the upcoming sections. The avenue of different types of losses that occur while transmitting at large distances, such as Atmospheric Loss, Pointing Loss and Geometric Loss, is explored.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 2","pages":"57-69"},"PeriodicalIF":0.0,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12053","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50119047","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}
Anthony Chagneau, Laëticia Nathoo, Jérémy Alloul, Bertrand Gabriel
{"title":"Quantum finite difference solvers for physics simulation","authors":"Anthony Chagneau, Laëticia Nathoo, Jérémy Alloul, Bertrand Gabriel","doi":"10.1049/qtc2.12054","DOIUrl":"https://doi.org/10.1049/qtc2.12054","url":null,"abstract":"<p>Physics systems are becoming increasingly complex and require more and more computing time. Quantum computing, which has shown its efficiency on some problems, such as the factorisation of a number with Shor's algorithm, may be the solution to reduce these computation times. Here, the authors propose two quantum numerical schemes for the simulation of physics phenomena, based on the finite difference method. The aim is to see if quantum versions of standard numerical schemes offer an advantage over their classical counterparts, either in accuracy, stability or computation time. First, the authors will present the different phenomena studied as well as the classical solution methods chosen. The authors will then describe the implementation of the quantum numerical schemes and present some results obtained on the different physics phenomena beforehand and then compare both approaches, classical and quantum.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 2","pages":"70-83"},"PeriodicalIF":0.0,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12054","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50119048","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":"Multi-hop teleportation of arbitrary multi-qudit states based on d-level GHZ channels","authors":"Yi Ding, Min Jiang","doi":"10.1049/qtc2.12052","DOIUrl":"https://doi.org/10.1049/qtc2.12052","url":null,"abstract":"<p>The combination of quantum communication technology and wireless networks brings a flexible and secure communication method that adapts to a more complex and open network environment. A new multi-hop teleportation scheme is investigated for transferring arbitrary unknown multi-qudit states between two distant parties. Based on a more general quantum routing protocol, intermediate nodes are introduced and linked with each other via <i>d</i>-level entangled Greenberger-Horne-Zeilinger states as quantum channels. In this multi-hop teleportation protocol, the source node and all the intermediate nodes can perform the entanglement measurement and transmit the measurement results simultaneously, thus reducing the time consumption largely. Furthermore, a general matrix formula is derived between the measurement results and the receiver's state, which enables the receiver to restore the unknown state efficiently. Compared with previous multi-hop teleportation protocols, the teleportation protocol of arbitrary unknown multi-qudit states of the authors can transfer more information, and it demonstrates lower computational complexity and higher flexibility.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 1","pages":"39-55"},"PeriodicalIF":0.0,"publicationDate":"2023-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12052","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50145467","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":"Energy-efficient routing protocol developed for internet of things networks","authors":"Ban Ayad Ahmmad, Salah Abdulghani Alabady","doi":"10.1049/qtc2.12051","DOIUrl":"https://doi.org/10.1049/qtc2.12051","url":null,"abstract":"<p>Wireless Sensor Networks (WSNs) due to their numerous applications have become a significant research topic in recent years, which include monitoring, tracking/detection, medical, military surveillance, and industrial. Due to the small sensors' difficulty in being easily recharged after random deployment, energy consumption is a challenging research problem for WSNs in general. One popular scenario for reducing energy consumption for WSNs is to use cluster-based technology to reduce sensor node communication distance. Along with focusing on the Chain Cluster Based routing protocol classes. Initially, the Calinski Harabasz approach is utilized to find the optimum number of clusters. This modification will take place for two stages that pass via improving techniques of enhancing the Improved Energy-Efficient PEGASIS-Based (IEEPB) protocol to achieve the main goal of this study. The network lifetime was then extended by using the K-means algorithm. As a result, rather than using a single long path, data is transferred over shorter parallel lines. The protocol is simulated with the MatlabR2015b simulator, which produces clear and effective simulation results, particularly in terms of energy savings. The outcome of the simulation results shows that the Improved energy-efficient PEGASIS-based routing protocol- KMeans optimisation (Improved EEPB- K-means Optimisation) protocol outperforms the Low-energy adaptive clustering hierarchy, Power-efficient gathering in sensor information systems, IEEPB, and MIEEPB protocols.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 1","pages":"25-38"},"PeriodicalIF":0.0,"publicationDate":"2022-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12051","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50134105","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":"Second quantised information distance","authors":"Songsong Dai","doi":"10.1049/qtc2.12050","DOIUrl":"https://doi.org/10.1049/qtc2.12050","url":null,"abstract":"<p>The Kolmogorov complexity of a string is the minimum length of a programme that can produce that string. Information distance between two strings based on Kolmogorov complexity is defined as the minimum length of a programme that can transform either string into the other one, both ways. The second quantised Kolmogorov complexity of a quantum state is the minimum average length of a quantum programme that can reproduce that state. In this paper, a second quantised information distance is defined based on the second quantised Kolmogorov complexity. It is described as the minimum average length of a transformation quantum programme between two quantum states. This distance's basic properties are discussed. A practical analogue of quantum information distance is also developed based on quantum data compression.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 1","pages":"17-24"},"PeriodicalIF":0.0,"publicationDate":"2022-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12050","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50146990","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":"Generalised probabilistic theories in a new light","authors":"Raed Shaiia","doi":"10.1049/qtc2.12045","DOIUrl":"10.1049/qtc2.12045","url":null,"abstract":"<p>In this paper, a modified formulation of generalised probabilistic theories that will always give rise to the structure of Hilbert space of quantum mechanics, in any finite outcome space, is presented and the guidelines to how to extend this work to infinite dimensional Hilbert spaces are given. Moreover, this new formulation which will be called as extended operational-probabilistic theories, applies not only to quantum systems, but also equally well to classical systems, without violating Bell's theorem, and at the same time solves the measurement problem. A new answer to the question of why our universe is quantum mechanical rather than classical will be presented. Besides, this extended probability theory shows that it is non-determinacy, or to be more precise, the non-deterministic description of the universe, that makes the laws of physics the way they are. In addition, this paper shows that there is still a possibility that there might be a deterministic level from which our universe emerges, which if understood correctly, may open the door wide to applications in areas such as quantum computing. In addition, this paper explains the deep reason why complex Hilbert spaces in quantum mechanics are needed.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 4","pages":"229-254"},"PeriodicalIF":0.0,"publicationDate":"2022-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12045","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124053287","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":"Quantum medical images processing foundations and applications","authors":"Ahmed Elaraby","doi":"10.1049/qtc2.12049","DOIUrl":"10.1049/qtc2.12049","url":null,"abstract":"<p>Medical imaging is considered one of the most important areas within scientific imaging due to the rapid and ongoing development in computer-aided medical image visualisation, advances in analysis approaches, and computer-aided diagnosis. Here, the principles of quantum computation and information to develop the field of medical image processing will be reviewed. The advancement of quantum computation in image processing has proved its outstanding properties for processing and storage capacity compared to the classical methods. This review provides a comprehensive summary of the common advanced approaches, methodologies and advanced applications in medical images based on quantum computation.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 4","pages":"201-213"},"PeriodicalIF":0.0,"publicationDate":"2022-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12049","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121052449","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":"Complexity analysis of quantum teleportation via different entangled channels in the presence of noise","authors":"Deepak Singh, Sanjeev Kumar, Bikash K. Behera","doi":"10.1049/qtc2.12048","DOIUrl":"https://doi.org/10.1049/qtc2.12048","url":null,"abstract":"<p>Quantum communication is an integral part of quantum computing, where teleportation of a quantum state has gained significant attention from researchers. Many teleportation schemes have been introduced in the recent past. In this study, the authors compare the teleportation of a single-qubit message among different entangled channels such as the two-qubit Bell channel, three-qubit GHZ channel, two/three-qubit cluster states, a highly entangled five-qubit state (Brown et al.) and the six-qubit state (Borras et al.). The authors calculate and compare the quantum costs for these channels. The authors also study the effects of six noise models: bit-flip noise, phase-flip noise, bit-phase-flip noise, amplitude damping, phase damping and depolarising error. These noise models may affect the communication channel used for teleportation. An investigation of the variation of the initial state's fidelity is performed for the teleported state in the presence of the noise model. It is observed that the fidelity decreases in all the entangled channels as the noise parameter <i>η</i> increases in the range [0, 0.5] for all the noise models. The fidelity shows an upward trend in the Bell, GHZ and three-qubit cluster state channels, as <i>η</i> varies in the range [0.5, 1.0] for all the noise models. However, in the rest of the three channels, the fidelity substantially decreases in the case of amplitude damping, phase damping and depolarising noise, and even it reaches zero for <i>η</i> = 1 in Brown et al. and Borras et al. channels.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 1","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2022-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12048","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50124643","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":"Experiment regarding magnetic fields with gravity","authors":"Jong Hoon Lee","doi":"10.1049/qtc2.12047","DOIUrl":"https://doi.org/10.1049/qtc2.12047","url":null,"abstract":"<p>This experiment was designed to test the string theory as a physical reality. The ground-based device placed the N poles of the magnets upwards, north, south, east, and west. Coil Ass'Y was placed between 2 N poles with bearing covers on the top and bottom. Gravity interacts to generate electricity in the Earth's direction or the opposite direction by the repulsive magnetic force. The voltage was measured from 3.60 to 3.80 sequentially while the generator was stationary through the monitor. The author found symmetry in Lex Tertia voltage and current zero data during experiment F4 6380 at a balanced state under gravity with the repulsive magnetic force. It generated from 42.8 to 794 μV in the vacuum chamber but from negative 16.1 to positive 18.3 μV in the air. As a result, the author measured more negative current and positive voltage generated in a vacuum. Trapped gravity was set to behave as free relativistic quantum particles or fluids in the magnetic sea. The result made it accessible to study the magnetic sea for different initial superpositions of positive- and negative-gravity spinor states. This might explain the relativistic quantum gravity exists as a physical reality, graviton interacting with photons to induce a magnetic field.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 4","pages":"218-228"},"PeriodicalIF":0.0,"publicationDate":"2022-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12047","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137543133","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":"Improving approximate vacuum prepared by the adiabatic quantum computation","authors":"Kazuto Oshima","doi":"10.1049/qtc2.12046","DOIUrl":"10.1049/qtc2.12046","url":null,"abstract":"<p>According to the quantum adiabatic theorem, we can in principle obtain a true vacuum of a quantum system starting from a trivial vacuum of a simple Hamiltonian. In actual adiabatic digital quantum simulation with finite time length and non-infinitesimal time steps, we can only obtain an approximate vacuum that is supposed to be a superposition of a true vacuum and excited states. We propose a procedure to improve the approximate vacuum.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 4","pages":"214-217"},"PeriodicalIF":0.0,"publicationDate":"2022-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12046","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132528244","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
