Kunal Das, Sahil Zaman, Alex Khan, Arindam Sadhu, Subhasree Bhattacharjee, Faisal Shah Khan, Bikramjit Sarkar
SARS-CoV-2 epidemic (severe acute respiratory corona virus 2 syndromes) has caused major impacts on a global scale. Several countries, including India, Europe, U.S.A., introduced a full state/nation lockdown to minimise the disease transmission through human interaction after the virus entered the population and to minimise the loss of human life. Millions of people have gone unemployed due to lockdown implementation, resulting in business and industry closure and leading to a national economic slowdown. Therefore, preventing the spread of the COVID-19 virus in the world while also preserving the global economy is an essential problem requiring an effective and immediate solution. Using the compartmental epidemiology S, E, I, R or D (Susceptible, Exposed, Infectious, Recovery or Death) model extended to multiple population regions, the authors predict the evolution of the SARS-CoV-2 disease and construct an optimally scheduled lockdown calendar to execute lockdown over phases, using the well-known Knapsack problem. A comparative analysis of both classical and quantum models shows that our model decreases SARS-CoV-2 active cases while retaining the average global economic factor, Gross Domestic Product, in contrast to the scenario with no lockdown.
{"title":"Hybrid-quantum approach for the optimal lockdown to stop the SARS-CoV-2 community spread subject to maximising nation economy globally","authors":"Kunal Das, Sahil Zaman, Alex Khan, Arindam Sadhu, Subhasree Bhattacharjee, Faisal Shah Khan, Bikramjit Sarkar","doi":"10.1049/qtc2.12068","DOIUrl":"10.1049/qtc2.12068","url":null,"abstract":"<p>SARS-CoV-2 epidemic (severe acute respiratory corona virus 2 syndromes) has caused major impacts on a global scale. Several countries, including India, Europe, U.S.A., introduced a full state/nation lockdown to minimise the disease transmission through human interaction after the virus entered the population and to minimise the loss of human life. Millions of people have gone unemployed due to lockdown implementation, resulting in business and industry closure and leading to a national economic slowdown. Therefore, preventing the spread of the COVID-19 virus in the world while also preserving the global economy is an essential problem requiring an effective and immediate solution. Using the compartmental epidemiology S, E, I, R or D (Susceptible, Exposed, Infectious, Recovery or Death) model extended to multiple population regions, the authors predict the evolution of the SARS-CoV-2 disease and construct an optimally scheduled lockdown calendar to execute lockdown over phases, using the well-known Knapsack problem. A comparative analysis of both classical and quantum models shows that our model decreases SARS-CoV-2 active cases while retaining the average global economic factor, Gross Domestic Product, in contrast to the scenario with no lockdown.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"5 1","pages":"19-37"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12068","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85571773","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}
Hu Yuan, Daniel S. Fowler, Carsten Maple, Gregory Epiphaniou
Quantum-based technologies will provide system engineers with new capabilities for securing data communications. The UK AirQKD project has implemented a Free-Space Optical Quantum Key Distribution (QKD) system to enable the continuous generation of symmetric encryption keys. One of the use cases for the generated keys is to secure Vehicle-to-Everything (V2X) communications. V2X applications would benefit from the certificate-free security provided by QKD for a post-quantum society. How FSO-QKD could integrate into a V2X architecture is examined. An overview of V2X is provided with the role that FSO-QKD could secure V2X data though some obstacles exist. One of the issues with 6G communications is the potential line-of-sight (LOS) considerations between the V2X devices. The modelling required for LOS is examined to analyse the outage performance of the building to infrastructure links in the 6G architecture. The results from the model show that further work is required if 6G LOS communications are going to be relied upon for future safety-critical V2X applications.
{"title":"Analysis of outage performance in a 6G-V2X communications system utilising free-space optical quantum key distribution","authors":"Hu Yuan, Daniel S. Fowler, Carsten Maple, Gregory Epiphaniou","doi":"10.1049/qtc2.12067","DOIUrl":"10.1049/qtc2.12067","url":null,"abstract":"<p>Quantum-based technologies will provide system engineers with new capabilities for securing data communications. The UK AirQKD project has implemented a Free-Space Optical Quantum Key Distribution (QKD) system to enable the continuous generation of symmetric encryption keys. One of the use cases for the generated keys is to secure Vehicle-to-Everything (V2X) communications. V2X applications would benefit from the certificate-free security provided by QKD for a post-quantum society. How FSO-QKD could integrate into a V2X architecture is examined. An overview of V2X is provided with the role that FSO-QKD could secure V2X data though some obstacles exist. One of the issues with 6G communications is the potential line-of-sight (LOS) considerations between the V2X devices. The modelling required for LOS is examined to analyse the outage performance of the building to infrastructure links in the 6G architecture. The results from the model show that further work is required if 6G LOS communications are going to be relied upon for future safety-critical V2X applications.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 4","pages":"191-199"},"PeriodicalIF":0.0,"publicationDate":"2023-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12067","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83122047","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}
The authors devised a protocol that allows two parties, who may malfunction or intentionally convey incorrect information in communication through a quantum channel, to verify each other's measurements and agree on each other's results. This has particular relevance in a modified version of the quantum coin flipping game. The key innovation of the authors’ work includes the new design of a quantum coin that excludes any advantage of cheating, by which the long-standing problem of the fair design of the game is, affirmatively, solved. Furthermore, the analysis is extended to N-parties communicating with each other, where multiple solutions for the verification of each player's measurement is proposed. The results in the N-party scenario could have particular relevance for the implementation of future quantum networks, where verification of quantum information is a necessity.
作者设计了一种协议,允许在通过量子信道进行通信时可能出现故障或故意传递错误信息的双方验证彼此的测量结果并达成一致。这在量子翻硬币游戏的改进版中尤为重要。作者工作的关键创新点包括量子硬币的新设计,它排除了作弊的任何优势,从而肯定地解决了长期存在的游戏公平设计问题。此外,分析还扩展到了相互通信的 N 方,提出了验证每个玩家测量结果的多种解决方案。N 方方案的结果可能对未来量子网络的实施具有特殊意义,因为量子信息的验证是必要的。
{"title":"Quantum protocol for decision making and verifying truthfulness among N-quantum parties: Solution and extension of the quantum coin flipping game","authors":"Kazuki Ikeda, Adam Lowe","doi":"10.1049/qtc2.12066","DOIUrl":"10.1049/qtc2.12066","url":null,"abstract":"<p>The authors devised a protocol that allows two parties, who may malfunction or intentionally convey incorrect information in communication through a quantum channel, to verify each other's measurements and agree on each other's results. This has particular relevance in a modified version of the quantum coin flipping game. The key innovation of the authors’ work includes the new design of a quantum coin that excludes any advantage of cheating, by which the long-standing problem of the fair design of the game is, affirmatively, solved. Furthermore, the analysis is extended to <i>N</i>-parties communicating with each other, where multiple solutions for the verification of each player's measurement is proposed. The results in the <i>N</i>-party scenario could have particular relevance for the implementation of future quantum networks, where verification of quantum information is a necessity.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 4","pages":"218-227"},"PeriodicalIF":0.0,"publicationDate":"2023-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12066","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90710334","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}
Andrea Ceschini, Antonello Rosato, Massimo Panella
Quasi-chaotic generators are used for producing a pseudorandom behaviour that can be used for encryption/decryption and secure communications, introducing an implementation of them based on quantum technology. Namely, the authors propose a quasi-chaotic generator based on quantum modular addition and quantum modular multiplication and they prove that quantum computing allows the parallel processing of data, paving the way for a fast and robust multi-channel encryption/decryption scheme. The resulting structure is validated by means of several experiments, which assessed the performance with respect to the original VLSI solution and ascertained the desired noise-like behaviour.
{"title":"Modular quantum circuits for secure communication","authors":"Andrea Ceschini, Antonello Rosato, Massimo Panella","doi":"10.1049/qtc2.12065","DOIUrl":"10.1049/qtc2.12065","url":null,"abstract":"<p>Quasi-chaotic generators are used for producing a pseudorandom behaviour that can be used for encryption/decryption and secure communications, introducing an implementation of them based on quantum technology. Namely, the authors propose a quasi-chaotic generator based on quantum modular addition and quantum modular multiplication and they prove that quantum computing allows the parallel processing of data, paving the way for a fast and robust multi-channel encryption/decryption scheme. The resulting structure is validated by means of several experiments, which assessed the performance with respect to the original VLSI solution and ascertained the desired noise-like behaviour.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 4","pages":"208-217"},"PeriodicalIF":0.0,"publicationDate":"2023-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12065","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87576074","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}
As past works have shown, information-theoretically secure implementations transmitters of Y00 quantum noise randomised cypher are possible. An advance to the provably secure Y00 protocol by bridging gaps between experimental results and theoretical analyses under so-called quantum collective measurement attacks with known plaintexts is aimed. It would be the strongest attack on the Y00 protocol in the context of quantum key distribution protocols. However, recently proposed security evaluations under the attacks were too abstract to apply to experiments. Therefore, security analyses directly evaluable with the equipped Y00 transmitters under attack are offered. Thus, new security indices are proposed instead of ordinary security measures, such as the bit-error-rate guarantee between optical signals or a masking size. Contrarily, unsolved problems are also listed.
{"title":"Y00 quantum noise randomised cipher; theoretical and experimental background","authors":"Talehisa Iwakoshi","doi":"10.1049/qtc2.12064","DOIUrl":"10.1049/qtc2.12064","url":null,"abstract":"<p>As past works have shown, information-theoretically secure implementations transmitters of Y00 quantum noise randomised cypher are possible. An advance to the provably secure Y00 protocol by bridging gaps between experimental results and theoretical analyses under so-called quantum collective measurement attacks with known plaintexts is aimed. It would be the strongest attack on the Y00 protocol in the context of quantum key distribution protocols. However, recently proposed security evaluations under the attacks were too abstract to apply to experiments. Therefore, security analyses directly evaluable with the equipped Y00 transmitters under attack are offered. Thus, new security indices are proposed instead of ordinary security measures, such as the bit-error-rate guarantee between optical signals or a masking size. Contrarily, unsolved problems are also listed.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 4","pages":"181-190"},"PeriodicalIF":0.0,"publicationDate":"2023-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12064","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78730976","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}
In quantum key distribution-secured optical networks (QKD-ONs), constrained network resources limit the success probability of QKD lightpath requests (QLRs). Thus, the selection of an appropriate route and the efficient utilisation of network resources for establishment of QLRs are the essential and challenging problems. This work addresses the routing and resource assignment (RRA) problem in the quantum signal channel of QKD-ONs. The RRA problem of QKD-ONs is a complex decision making problem, where appropriate solutions depend on understanding the networking environment. Motivated by the recent advances in deep reinforcement learning (DRL) for complex problems and also because of its capability to learn directly from experiences, DRL is exploited to solve the RRA problem and a DRL-based RRA scheme is proposed. The proposed scheme learns the optimal policy to select an appropriate route and assigns suitable network resources for establishment of QLRs by using deep neural networks. The performance of the proposed scheme is compared with the deep-Q network (DQN) method and two baseline schemes, namely, first-fit (FF) and random-fit (RF) for two different networks, namely The National Science Foundation Network (NSFNET) and UBN24. Simulation results indicate that the proposed scheme reduces blocking by 7.19%, 10.11%, and 33.50% for NSFNET and 2.47%, 3.20%, and 19.60% for UBN24 and improves resource utilisation up to 3.40%, 4.33%, and 7.18% for NSFNET and 1.34%, 1.96%, and 6.44% for UBN24 as compared with DQN, FF, and RF, respectively.
{"title":"Deep reinforcement learning-based routing and resource assignment in quantum key distribution-secured optical networks","authors":"Purva Sharma, Shubham Gupta, Vimal Bhatia, Shashi Prakash","doi":"10.1049/qtc2.12063","DOIUrl":"https://doi.org/10.1049/qtc2.12063","url":null,"abstract":"<p>In quantum key distribution-secured optical networks (QKD-ONs), constrained network resources limit the success probability of QKD lightpath requests (QLRs). Thus, the selection of an appropriate route and the efficient utilisation of network resources for establishment of QLRs are the essential and challenging problems. This work addresses the routing and resource assignment (RRA) problem in the quantum signal channel of QKD-ONs. The RRA problem of QKD-ONs is a complex decision making problem, where appropriate solutions depend on understanding the networking environment. Motivated by the recent advances in deep reinforcement learning (DRL) for complex problems and also because of its capability to learn directly from experiences, DRL is exploited to solve the RRA problem and a DRL-based RRA scheme is proposed. The proposed scheme learns the optimal policy to select an appropriate route and assigns suitable network resources for establishment of QLRs by using deep neural networks. The performance of the proposed scheme is compared with the deep-Q network (DQN) method and two baseline schemes, namely, first-fit (FF) and random-fit (RF) for two different networks, namely The National Science Foundation Network (NSFNET) and UBN24. Simulation results indicate that the proposed scheme reduces blocking by 7.19%, 10.11%, and 33.50% for NSFNET and 2.47%, 3.20%, and 19.60% for UBN24 and improves resource utilisation up to 3.40%, 4.33%, and 7.18% for NSFNET and 1.34%, 1.96%, and 6.44% for UBN24 as compared with DQN, FF, and RF, respectively.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 3","pages":"136-145"},"PeriodicalIF":0.0,"publicationDate":"2023-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12063","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50154635","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}
In this article, a protocol for information lossless teleportation using W states is proposed. Firstly, the information lossless teleportation of an unknown state with a maximally entangled W-state channel, which protects the original unknown state information even in case of teleportation failure is investigated. Next, we generalise our scheme to non-maximally entangled W-state channels. Finally, the principle of the proposed scheme is validated by performing experiments on the quantum circuit simulator Quirk. Our study shows that W states can be used to teleport any quantum state without information loss through single-qubit measurements and local unitary operations.
本文提出了一种利用 W 状态进行信息无损远传的协议。首先,我们研究了利用最大纠缠 W 状态信道对未知状态进行信息无损远距传输,即使在远距传输失败的情况下也能保护原始未知状态信息。接下来,我们将方案推广到非最大纠缠 W 状态信道。最后,通过在量子电路模拟器 Quirk 上进行实验,验证了所提方案的原理。我们的研究表明,通过单量子比特测量和局部单元操作,W态可以用来远传任何量子态,而不会造成信息丢失。
{"title":"Research on information lossless teleportation via the W states","authors":"Ao Wang, Yu-Zhen Wei, Zong-Yi Li, Min Jiang","doi":"10.1049/qtc2.12062","DOIUrl":"10.1049/qtc2.12062","url":null,"abstract":"<p>In this article, a protocol for information lossless teleportation using W states is proposed. Firstly, the information lossless teleportation of an unknown state with a maximally entangled W-state channel, which protects the original unknown state information even in case of teleportation failure is investigated. Next, we generalise our scheme to non-maximally entangled W-state channels. Finally, the principle of the proposed scheme is validated by performing experiments on the quantum circuit simulator Quirk. Our study shows that W states can be used to teleport any quantum state without information loss through single-qubit measurements and local unitary operations.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 4","pages":"200-207"},"PeriodicalIF":0.0,"publicationDate":"2023-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12062","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89561254","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}
Zoubeir Mlika, Soumaya Cherkaoui, Jean Frédéric Laprade, Simon Corbeil-Letourneau
This paper applies a quantum machine learning technique to predict mobile users' trajectories in mobile wireless networks by using an approach called quantum reservoir computing (QRC). Mobile users' trajectories prediction belongs to the task of temporal information processing, and it is a mobility management problem that is essential for self-organising and autonomous 6G networks. Our aim is to accurately predict the future positions of mobile users in wireless networks using QRC. To do so, the authors use a real-world time series dataset to model mobile users' trajectories. The QRC approach has two components: reservoir computing (RC) and quantum computing (QC). In RC, the training is more computational-efficient than the training of simple recurrent neural networks since, in RC, only the weights of the output layer are trainable. The internal part of RC is what is called the reservoir. For the RC to perform well, the weights of the reservoir should be chosen carefully to create highly complex and non-linear dynamics. The QC is used to create such dynamical reservoir that maps the input time series into higher dimensional computational space composed of dynamical states. After obtaining the high-dimensional dynamical states, a simple linear regression is performed to train the output weights and, thus, the prediction of the mobile users' trajectories can be performed efficiently. In this study, we apply a QRC approach based on the Hamiltonian time evolution of a quantum system. The authors simulate the time evolution using IBM gate-based quantum computers, and they show in the experimental results that the use of QRC to predict the mobile users' trajectories with only a few qubits is efficient and can outperform the classical approaches such as the long short-term memory approach and the echo-state networks approach.
{"title":"User trajectory prediction in mobile wireless networks using quantum reservoir computing","authors":"Zoubeir Mlika, Soumaya Cherkaoui, Jean Frédéric Laprade, Simon Corbeil-Letourneau","doi":"10.1049/qtc2.12061","DOIUrl":"https://doi.org/10.1049/qtc2.12061","url":null,"abstract":"<p>This paper applies a quantum machine learning technique to predict mobile users' trajectories in mobile wireless networks by using an approach called quantum reservoir computing (QRC). Mobile users' trajectories prediction belongs to the task of temporal information processing, and it is a mobility management problem that is essential for self-organising and autonomous 6G networks. Our aim is to accurately predict the future positions of mobile users in wireless networks using QRC. To do so, the authors use a real-world time series dataset to model mobile users' trajectories. The QRC approach has two components: reservoir computing (RC) and quantum computing (QC). In RC, the training is more computational-efficient than the training of simple recurrent neural networks since, in RC, only the weights of the output layer are trainable. The internal part of RC is what is called the reservoir. For the RC to perform well, the weights of the reservoir should be chosen carefully to create highly complex and non-linear dynamics. The QC is used to create such dynamical reservoir that maps the input time series into higher dimensional computational space composed of dynamical states. After obtaining the high-dimensional dynamical states, a simple linear regression is performed to train the output weights and, thus, the prediction of the mobile users' trajectories can be performed efficiently. In this study, we apply a QRC approach based on the Hamiltonian time evolution of a quantum system. The authors simulate the time evolution using IBM gate-based quantum computers, and they show in the experimental results that the use of QRC to predict the mobile users' trajectories with only a few qubits is efficient and can outperform the classical approaches such as the long short-term memory approach and the echo-state networks approach.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 3","pages":"125-135"},"PeriodicalIF":0.0,"publicationDate":"2023-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12061","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50150729","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}
Muhammad Zulfiqar Ali, Abdoalbaset Abohmra, Muhammad Usman, Adnan Zahid, Hadi Heidari, Muhammad Ali Imran, Qammer H. Abbasi
In the technologically changing world, the demand for ultra-reliable, faster, low power, and secure communication has significantly risen in recent years. Researchers have shown immense interest in emerging quantum computing (QC) due to its potentials of solving the computing complexity in the robust and efficient manner. It is envisioned that QC can act as critical enablers and strong catalysts to considerably reduce the computing complexities and boost the future of sixth generation (6G) and beyond communication systems in terms of their security. In this study, the fundamentals of QC, the evolution of quantum communication that encompasses a wide spectrum of technologies and applications and quantum key distribution, which is one of the most promising applications of quantum security, have been presented. Furthermore, various parameters and important techniques are also investigated to optimise the performance of 6G communication in terms of their security, computing, and communication efficiency. Towards the end, potential challenges that QC and quantum communication may face in 6G have been highlighted along with future directions.
{"title":"Quantum for 6G communication: A perspective","authors":"Muhammad Zulfiqar Ali, Abdoalbaset Abohmra, Muhammad Usman, Adnan Zahid, Hadi Heidari, Muhammad Ali Imran, Qammer H. Abbasi","doi":"10.1049/qtc2.12060","DOIUrl":"https://doi.org/10.1049/qtc2.12060","url":null,"abstract":"<p>In the technologically changing world, the demand for ultra-reliable, faster, low power, and secure communication has significantly risen in recent years. Researchers have shown immense interest in emerging quantum computing (QC) due to its potentials of solving the computing complexity in the robust and efficient manner. It is envisioned that QC can act as critical enablers and strong catalysts to considerably reduce the computing complexities and boost the future of sixth generation (6G) and beyond communication systems in terms of their security. In this study, the fundamentals of QC, the evolution of quantum communication that encompasses a wide spectrum of technologies and applications and quantum key distribution, which is one of the most promising applications of quantum security, have been presented. Furthermore, various parameters and important techniques are also investigated to optimise the performance of 6G communication in terms of their security, computing, and communication efficiency. Towards the end, potential challenges that QC and quantum communication may face in 6G have been highlighted along with future directions.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 3","pages":"112-124"},"PeriodicalIF":0.0,"publicationDate":"2023-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12060","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50149317","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}
Secure Multiparty Computation (SMC) enables multiple parties to cooperate securely without compromising their privacy. SMC has the potential to offer solutions for privacy obstacles in vehicular networks. However, classical SMC implementations suffer from efficiency and security challenges. To address this problem, two quantum communication technologies, Quantum Key Distribution (QKD) and Quantum Oblivious Key Distribution were utilised. These technologies supply symmetric and oblivious keys respectively, allowing fast and secure inter-vehicular communications. These quantum technologies are integrated with the Faster Malicious Arithmetic Secure Computation with Oblivious Transfer (MASCOT) protocol to form a Quantum Secure Multiparty Computation (QSMC) platform. A lane change service is implemented in which vehicles broadcast private information about their intention to exit the highway. The proposed QSMC approach provides unconditional security even against quantum computer attacks. Moreover, the communication cost of the quantum approach for the lane change use case has decreased by 97% when compared to the classical implementation. However, the computation cost has increased by 42%. For open space scenarios, the reduction in communication cost is especially important, because it conserves bandwidth in the free-space radio channel, outweighing the increase in computation cost.
{"title":"Quantum privacy-preserving service for secure lane change in vehicular networks","authors":"Zeinab Rahmani, Luis S. Barbosa, Armando N. Pinto","doi":"10.1049/qtc2.12059","DOIUrl":"https://doi.org/10.1049/qtc2.12059","url":null,"abstract":"<p>Secure Multiparty Computation (SMC) enables multiple parties to cooperate securely without compromising their privacy. SMC has the potential to offer solutions for privacy obstacles in vehicular networks. However, classical SMC implementations suffer from efficiency and security challenges. To address this problem, two quantum communication technologies, Quantum Key Distribution (QKD) and Quantum Oblivious Key Distribution were utilised. These technologies supply symmetric and oblivious keys respectively, allowing fast and secure inter-vehicular communications. These quantum technologies are integrated with the Faster Malicious Arithmetic Secure Computation with Oblivious Transfer (MASCOT) protocol to form a Quantum Secure Multiparty Computation (QSMC) platform. A lane change service is implemented in which vehicles broadcast private information about their intention to exit the highway. The proposed QSMC approach provides unconditional security even against quantum computer attacks. Moreover, the communication cost of the quantum approach for the lane change use case has decreased by 97% when compared to the classical implementation. However, the computation cost has increased by 42%. For open space scenarios, the reduction in communication cost is especially important, because it conserves bandwidth in the free-space radio channel, outweighing the increase in computation cost.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"4 3","pages":"103-111"},"PeriodicalIF":0.0,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12059","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50147996","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}