首页 > 最新文献

IET Quantum Communication最新文献

英文 中文
Quantum teleportation in higher dimension and entanglement distribution via quantum switches
IF 2.5 Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2025-01-24 DOI: 10.1049/qtc2.12122
Indrakshi Dey, Nicola Marchetti

High-dimensional quantum states, or ‘qudits’, provide significant advantages over traditional qubits in quantum communication, such as increased information capacity, enhanced noise resilience, and reduced information loss. Despite these benefits, their implementation has been constrained by challenges in generation, transmission, and detection. This paper presents a novel theoretical framework for transmitting quantum information using qudit entanglement distribution over a superposition of causal orders in two quantum channels. Using this model, a quantum switch operation for 2-qudit systems is introduced, which facilitates enhanced fidelity of entanglement distribution and quantum teleportation. The results demonstrate that the use of qudits in entanglement distribution achieves a fidelity improvement from 0.5 (for qubit-based systems) to 0.94 for 20-dimensional qudits, even under noisy channel conditions. This enhancement is achieved by exploiting the increased Hilbert space of high-dimensional states and the inherent noise-resilience properties of quantum switches operating in superpositions of causal orders. The findings underscore the potential of qudit-based quantum systems in achieving robust and high-fidelity communication in environments where traditional qubit-based systems face limitations.

{"title":"Quantum teleportation in higher dimension and entanglement distribution via quantum switches","authors":"Indrakshi Dey,&nbsp;Nicola Marchetti","doi":"10.1049/qtc2.12122","DOIUrl":"https://doi.org/10.1049/qtc2.12122","url":null,"abstract":"<p>High-dimensional quantum states, or ‘qudits’, provide significant advantages over traditional qubits in quantum communication, such as increased information capacity, enhanced noise resilience, and reduced information loss. Despite these benefits, their implementation has been constrained by challenges in generation, transmission, and detection. This paper presents a novel theoretical framework for transmitting quantum information using qudit entanglement distribution over a superposition of causal orders in two quantum channels. Using this model, a quantum switch operation for 2-qudit systems is introduced, which facilitates enhanced fidelity of entanglement distribution and quantum teleportation. The results demonstrate that the use of qudits in entanglement distribution achieves a fidelity improvement from 0.5 (for qubit-based systems) to 0.94 for 20-dimensional qudits, even under noisy channel conditions. This enhancement is achieved by exploiting the increased Hilbert space of high-dimensional states and the inherent noise-resilience properties of quantum switches operating in superpositions of causal orders. The findings underscore the potential of qudit-based quantum systems in achieving robust and high-fidelity communication in environments where traditional qubit-based systems face limitations.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"6 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12122","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143118771","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
Quantum blockchain: Trends, technologies, and future directions
IF 2.5 Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2024-12-11 DOI: 10.1049/qtc2.12119
Manjula Gandhi S, Chaitrali Mulay, Karthiganesh Durai, G. Murali, Jafar Ali Ibrahim Syed Masood, V. Vijayarajan, Kumar Gautam, N. S. Kalyan Chakravarthy, S. Suresh Kumar, Saurabh Agarwal, Murali S, Vijayasherly V, David Asirvatham, Sarfraz Brohi, Chandru Vignesh C, Anbuchelian S

Blockchain technology is a highly developed database system that shares information within a business web. It stores details in blocks connected chronologically, ensuring information integrity through consensus mechanisms that prevent unauthorised alterations. This decentralised system removes the need for a believable mediator, mitigating vulnerabilities and enhancing transaction security. Blockchain’s application spans the energy, finance, media, entertainment, and retail sectors. However, classical blockchain faces threats from quantum computing advancements, necessitating the development of quantum blockchain technology. Quantum blockchain, leveraging quantum computation and information theory, offers enhanced security and immutability. In this paper, different mathematical foundations, practical implementations and effectiveness of lattice-based cryptography in securing blockchain applications are discussed. Analysis of how the cryptographic techniques can protect blockchain systems against quantum attacks is being done by using mathematical formulations and examples. Quantum computing strengthens blockchain security with advanced encryption and authentication, which is critical for safeguarding diverse sectors from evolving cyber threats. Further study on quantum-resistant design is necessary if blockchain networks are to be robust and intact in the face of future technological developments.

{"title":"Quantum blockchain: Trends, technologies, and future directions","authors":"Manjula Gandhi S,&nbsp;Chaitrali Mulay,&nbsp;Karthiganesh Durai,&nbsp;G. Murali,&nbsp;Jafar Ali Ibrahim Syed Masood,&nbsp;V. Vijayarajan,&nbsp;Kumar Gautam,&nbsp;N. S. Kalyan Chakravarthy,&nbsp;S. Suresh Kumar,&nbsp;Saurabh Agarwal,&nbsp;Murali S,&nbsp;Vijayasherly V,&nbsp;David Asirvatham,&nbsp;Sarfraz Brohi,&nbsp;Chandru Vignesh C,&nbsp;Anbuchelian S","doi":"10.1049/qtc2.12119","DOIUrl":"https://doi.org/10.1049/qtc2.12119","url":null,"abstract":"<p>Blockchain technology is a highly developed database system that shares information within a business web. It stores details in blocks connected chronologically, ensuring information integrity through consensus mechanisms that prevent unauthorised alterations. This decentralised system removes the need for a believable mediator, mitigating vulnerabilities and enhancing transaction security. Blockchain’s application spans the energy, finance, media, entertainment, and retail sectors. However, classical blockchain faces threats from quantum computing advancements, necessitating the development of quantum blockchain technology. Quantum blockchain, leveraging quantum computation and information theory, offers enhanced security and immutability. In this paper, different mathematical foundations, practical implementations and effectiveness of lattice-based cryptography in securing blockchain applications are discussed. Analysis of how the cryptographic techniques can protect blockchain systems against quantum attacks is being done by using mathematical formulations and examples. Quantum computing strengthens blockchain security with advanced encryption and authentication, which is critical for safeguarding diverse sectors from evolving cyber threats. Further study on quantum-resistant design is necessary if blockchain networks are to be robust and intact in the face of future technological developments.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"5 4","pages":"516-542"},"PeriodicalIF":2.5,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12119","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143252533","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
Real-time seedless post-processing for quantum random number generators
IF 2.5 Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2024-12-11 DOI: 10.1049/qtc2.12118
Qian Li, Hongyi Zhou

Quantum-proof randomness extraction is essential for handling quantum side information possessed by a quantum adversary, which is widely applied in various quantum cryptography tasks. In this study, the authors introduce a real-time two-source quantum randomness extractor against quantum side information. The authors’ extractor is tailored for forward block sources, a novel category of min-entropy sources introduced in this work. These sources retain the flexibility to accommodate a broad range of quantum random number generators. The authors’ online algorithms demonstrate the extraction of a constant fraction of min-entropy from two infinitely long independent forward block sources. Moreover, the authors’ extractor is inherently block-wise parallelisable, presenting a practical and efficient solution for the timely extraction of high-quality randomness. Applying the authors’ extractors to the raw data of one of the most commonly used quantum random number generators, a simulated extraction speed as high as 64 Gbps is achieved.

{"title":"Real-time seedless post-processing for quantum random number generators","authors":"Qian Li,&nbsp;Hongyi Zhou","doi":"10.1049/qtc2.12118","DOIUrl":"https://doi.org/10.1049/qtc2.12118","url":null,"abstract":"<p>Quantum-proof randomness extraction is essential for handling quantum side information possessed by a quantum adversary, which is widely applied in various quantum cryptography tasks. In this study, the authors introduce a real-time two-source quantum randomness extractor against quantum side information. The authors’ extractor is tailored for forward block sources, a novel category of min-entropy sources introduced in this work. These sources retain the flexibility to accommodate a broad range of quantum random number generators. The authors’ online algorithms demonstrate the extraction of a constant fraction of min-entropy from two infinitely long independent forward block sources. Moreover, the authors’ extractor is inherently block-wise parallelisable, presenting a practical and efficient solution for the timely extraction of high-quality randomness. Applying the authors’ extractors to the raw data of one of the most commonly used quantum random number generators, a simulated extraction speed as high as 64 Gbps is achieved.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"5 4","pages":"650-657"},"PeriodicalIF":2.5,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12118","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143252349","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
Quantum anonymous one vote veto protocol based on entanglement swapping
IF 2.5 Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2024-12-03 DOI: 10.1049/qtc2.12117
Yanmeng Wang, Min Jiang, Yuzhen Wei, Wenhao Zhao

As a special voting method, one-vote veto voting also has a wide range of applications. A veto means that when the voting council puts forward a proposal, it cannot pass unless all the voters agree to it. If there is a no vote, the proposal will be rejected, but no one will know how anyone else votes. In most existing quantum anonymous one-vote veto voting protocols, an absolutely honest third party is generally required to assist the voting. However, it is difficult to find a fully trusted third party in reality. In addition, the existing quantum anonymous one-vote veto protocol does not consider the attack from the insider voters. Therefore, based on the characteristics of entanglement swapping between the Cat state and Bell state, the authors propose a new quantum anonymous one-vote veto protocol, which can not only calculate the voting result quickly and effectively but also demonstrate higher security.

{"title":"Quantum anonymous one vote veto protocol based on entanglement swapping","authors":"Yanmeng Wang,&nbsp;Min Jiang,&nbsp;Yuzhen Wei,&nbsp;Wenhao Zhao","doi":"10.1049/qtc2.12117","DOIUrl":"https://doi.org/10.1049/qtc2.12117","url":null,"abstract":"<p>As a special voting method, one-vote veto voting also has a wide range of applications. A veto means that when the voting council puts forward a proposal, it cannot pass unless all the voters agree to it. If there is a no vote, the proposal will be rejected, but no one will know how anyone else votes. In most existing quantum anonymous one-vote veto voting protocols, an absolutely honest third party is generally required to assist the voting. However, it is difficult to find a fully trusted third party in reality. In addition, the existing quantum anonymous one-vote veto protocol does not consider the attack from the insider voters. Therefore, based on the characteristics of entanglement swapping between the Cat state and Bell state, the authors propose a new quantum anonymous one-vote veto protocol, which can not only calculate the voting result quickly and effectively but also demonstrate higher security.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"5 4","pages":"641-649"},"PeriodicalIF":2.5,"publicationDate":"2024-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12117","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143248326","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
Enhanced QSVM with elitist non-dominated sorting genetic optimisation algorithm for breast cancer diagnosis
IF 2.5 Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2024-10-23 DOI: 10.1049/qtc2.12113
Jose P, Shanmugasundaram Hariharan, Vimaladevi Madhivanan, Sujaudeen N, Murugaperumal Krisnamoorthy, Aswani Kumar Cherukuri

Machine learning has emerged as a promising method for predicting breast cancer using quantum computation techniques. Quantum machine learning algorithms, such as quantum support vector machines (QSVMs), are demonstrating superior efficiency and economy in tackling complex problems compared to traditional machine learning methods. When compared with classical support vector machine, the quantum machine produces remarkably accurate results. The suggested quantum SVM model in this study effectively resolved the binary classification problem for diagnosing malignant breast cancer. This work introduces an enhanced approach to breast cancer diagnosis by integrating QSVM with elitist non-dominated sorting genetic optimization (ENSGA), leveraging the strengths of both techniques to achieve more accurate and efficient classification results. ENSGA plays a crucial role in optimising QSVM parameters, ensuring that the model attains the best possible classification accuracy while considering multiple objectives simultaneously. Moreover, the quantum kernel estimation method demonstrated exceptional performance by achieving high accuracy within an impressive execution time of 0.14 in the IBM QSVM simulator. The seamless integration of quantum computation techniques with optimisation strategies such as ENSGA highlights the potential of quantum machine learning in revolutionising the field of healthcare, particularly in the domain of breast cancer diagnosis.

{"title":"Enhanced QSVM with elitist non-dominated sorting genetic optimisation algorithm for breast cancer diagnosis","authors":"Jose P,&nbsp;Shanmugasundaram Hariharan,&nbsp;Vimaladevi Madhivanan,&nbsp;Sujaudeen N,&nbsp;Murugaperumal Krisnamoorthy,&nbsp;Aswani Kumar Cherukuri","doi":"10.1049/qtc2.12113","DOIUrl":"https://doi.org/10.1049/qtc2.12113","url":null,"abstract":"<p>Machine learning has emerged as a promising method for predicting breast cancer using quantum computation techniques. Quantum machine learning algorithms, such as quantum support vector machines (QSVMs), are demonstrating superior efficiency and economy in tackling complex problems compared to traditional machine learning methods. When compared with classical support vector machine, the quantum machine produces remarkably accurate results. The suggested quantum SVM model in this study effectively resolved the binary classification problem for diagnosing malignant breast cancer. This work introduces an enhanced approach to breast cancer diagnosis by integrating QSVM with elitist non-dominated sorting genetic optimization (ENSGA), leveraging the strengths of both techniques to achieve more accurate and efficient classification results. ENSGA plays a crucial role in optimising QSVM parameters, ensuring that the model attains the best possible classification accuracy while considering multiple objectives simultaneously. Moreover, the quantum kernel estimation method demonstrated exceptional performance by achieving high accuracy within an impressive execution time of 0.14 in the IBM QSVM simulator. The seamless integration of quantum computation techniques with optimisation strategies such as ENSGA highlights the potential of quantum machine learning in revolutionising the field of healthcare, particularly in the domain of breast cancer diagnosis.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"5 4","pages":"384-398"},"PeriodicalIF":2.5,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12113","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143253108","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
Advancing quantum communication security: Metamaterial based quantum key distribution with enhanced protocols
IF 2.5 Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2024-10-19 DOI: 10.1049/qtc2.12116
Sujit Biswas, Rajat S. Goswami, K. Hemant Kumar Reddy, Sachi Nandan Mohanty, Mohammed Altaf Ahmed

Quantum Key Distribution (QKD) is increasingly pivotal in securing communication channels against the looming threats posed by quantum computing. However, existing QKD protocols encounter challenges related to efficiency and transmission capabilities. In response, this research investigates the integration of metamaterials into QKD systems, aiming to fortify security and enhance practicality. In the current landscape of quantum communication, where the vulnerability of classical encryption methods is magnified by rapid advancements in quantum computing, finding innovative solutions is imperative. This study is motivated by the need to strengthen the security and viability of QKD protocols to meet the demands of evolving cryptographic threats. By integrating metamaterials, the authors optimise quantum state control, improve signal-to-noise ratio (SNR), and enable longer transmission distances. Through mathematical modelling and simulations, the authors demonstrate how metamaterials reduce errors and enhance the robustness of QKD systems. Our findings show significant improvements in transmission efficiency and security, making Metamaterial-Based Quantum Key Distribution (MQKD) a promising approach for future quantum communication networks. The study not only advances the understanding of the theoretical foundations, but also presents simulated results illustrating the practical effectiveness of MQKD. The exploration of these innovative techniques contributes to the ongoing efforts to secure quantum communication channels.

{"title":"Advancing quantum communication security: Metamaterial based quantum key distribution with enhanced protocols","authors":"Sujit Biswas,&nbsp;Rajat S. Goswami,&nbsp;K. Hemant Kumar Reddy,&nbsp;Sachi Nandan Mohanty,&nbsp;Mohammed Altaf Ahmed","doi":"10.1049/qtc2.12116","DOIUrl":"https://doi.org/10.1049/qtc2.12116","url":null,"abstract":"<div>\u0000 \u0000 \u0000 <section>\u0000 \u0000 <p>Quantum Key Distribution (QKD) is increasingly pivotal in securing communication channels against the looming threats posed by quantum computing. However, existing QKD protocols encounter challenges related to efficiency and transmission capabilities. In response, this research investigates the integration of metamaterials into QKD systems, aiming to fortify security and enhance practicality. In the current landscape of quantum communication, where the vulnerability of classical encryption methods is magnified by rapid advancements in quantum computing, finding innovative solutions is imperative. This study is motivated by the need to strengthen the security and viability of QKD protocols to meet the demands of evolving cryptographic threats. By integrating metamaterials, the authors optimise quantum state control, improve signal-to-noise ratio (SNR), and enable longer transmission distances. Through mathematical modelling and simulations, the authors demonstrate how metamaterials reduce errors and enhance the robustness of QKD systems. Our findings show significant improvements in transmission efficiency and security, making Metamaterial-Based Quantum Key Distribution (MQKD) a promising approach for future quantum communication networks. The study not only advances the understanding of the theoretical foundations, but also presents simulated results illustrating the practical effectiveness of MQKD. The exploration of these innovative techniques contributes to the ongoing efforts to secure quantum communication channels.</p>\u0000 </section>\u0000 </div>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"5 4","pages":"399-416"},"PeriodicalIF":2.5,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12116","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143253006","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
Optimising energy consumption in Nano-cryptography: Quantum cellular automata-based multiplexer/demultiplexer design
IF 2.5 Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2024-10-10 DOI: 10.1049/qtc2.12115
Aswathy N, N. M. Siva Mangai

Future global communications will depend heavily on nano-communication networks, which use ultra-low power nano-circuits to transmit data efficiently at very high rates. An essential part of distributed communication networks is the circuit-switched network, which distributes the input signal among several users. For designing nanoscale digital circuits, Quantum Cellular Automata technology (QCA) emerges as a formidable contender against the established complementary metal-oxide-semiconductor (CMOS) technology for low-power devices. The authors endeavour to achieve an efficient design for multiplexer and demultiplexer switching circuits. The designed multiplexer and demultiplexer have 15 cells with an area of 0.02 μm2 and a latency of 0.5 clock cycles. The authors assess the energy dissipation and temperature impacts for both multiplexer and demultiplexer circuits. The novel design of switch circuits facilitates the sharing of a single communication link across multiple devices at the nano-scale.

{"title":"Optimising energy consumption in Nano-cryptography: Quantum cellular automata-based multiplexer/demultiplexer design","authors":"Aswathy N,&nbsp;N. M. Siva Mangai","doi":"10.1049/qtc2.12115","DOIUrl":"https://doi.org/10.1049/qtc2.12115","url":null,"abstract":"<div>\u0000 \u0000 \u0000 <section>\u0000 \u0000 <p>Future global communications will depend heavily on nano-communication networks, which use ultra-low power nano-circuits to transmit data efficiently at very high rates. An essential part of distributed communication networks is the circuit-switched network, which distributes the input signal among several users. For designing nanoscale digital circuits, Quantum Cellular Automata technology (QCA) emerges as a formidable contender against the established complementary metal-oxide-semiconductor (CMOS) technology for low-power devices. The authors endeavour to achieve an efficient design for multiplexer and demultiplexer switching circuits. The designed multiplexer and demultiplexer have 15 cells with an area of 0.02 μm<sup>2</sup> and a latency of 0.5 clock cycles. The authors assess the energy dissipation and temperature impacts for both multiplexer and demultiplexer circuits. The novel design of switch circuits facilitates the sharing of a single communication link across multiple devices at the nano-scale.</p>\u0000 </section>\u0000 </div>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"5 4","pages":"632-640"},"PeriodicalIF":2.5,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12115","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143252441","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
Design and analysis of parallel quantum transfer fractal priority replay with dynamic memory algorithm in quantum reinforcement learning for robotics
IF 2.5 Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2024-09-27 DOI: 10.1049/qtc2.12111
R. Palanivel, P. Muthulakshmi

This paper introduces the parallel quantum transfer fractal priority reply with dynamic memory (P-QTFPR-DM) algorithm, an innovative approach that combines quantum computing and reinforcement learning (RL) to enhance decision-making in autonomous vehicles. Leveraging quantum principles such as superposition and entanglement, P-QTFPR-DM optimises Q-value approximation through a custom quantum circuit (UQC), facilitating efficient exploration and exploitation in high-dimensional state-action spaces. This algorithm utilises a quantum neural network (QNN) with 4 qubits to encode and process Q-values. The autonomous vehicle, equipped with GPS for real-time navigation, uses P-QTFPR-DM to reach a predefined destination with coordinates 12.82,514,234,148 latitude and 80.0,451,311,962,242 longitude. Through extensive numerical simulations, P-QTFPR-DM demonstrates a 30% reduction in decision-making time and a 25% improvement in navigation accuracy compared to classical RL methods. The QNN-based approach achieves a 95% success rate in reaching the destination within a 5-m accuracy threshold, whereas traditional RL methods achieve only an 85% success rate. Dynamic memory management in P-QTFPR-DM optimises computational resources, enhancing the vehicle's adaptability to environmental changes. These results highlight the potential of quantum computing to significantly advance autonomous vehicle technology by improving both efficiency and effectiveness in complex navigation tasks. Future research will focus on refining the algorithm and exploring its real-world applications to enhance autonomous vehicle performance.

{"title":"Design and analysis of parallel quantum transfer fractal priority replay with dynamic memory algorithm in quantum reinforcement learning for robotics","authors":"R. Palanivel,&nbsp;P. Muthulakshmi","doi":"10.1049/qtc2.12111","DOIUrl":"https://doi.org/10.1049/qtc2.12111","url":null,"abstract":"<p>This paper introduces the parallel quantum transfer fractal priority reply with dynamic memory (P-QTFPR-DM) algorithm, an innovative approach that combines quantum computing and reinforcement learning (RL) to enhance decision-making in autonomous vehicles. Leveraging quantum principles such as superposition and entanglement, P-QTFPR-DM optimises <i>Q</i>-value approximation through a custom quantum circuit (UQC), facilitating efficient exploration and exploitation in high-dimensional state-action spaces. This algorithm utilises a quantum neural network (QNN) with 4 qubits to encode and process <i>Q</i>-values. The autonomous vehicle, equipped with GPS for real-time navigation, uses P-QTFPR-DM to reach a predefined destination with coordinates 12.82,514,234,148 latitude and 80.0,451,311,962,242 longitude. Through extensive numerical simulations, P-QTFPR-DM demonstrates a 30% reduction in decision-making time and a 25% improvement in navigation accuracy compared to classical RL methods. The QNN-based approach achieves a 95% success rate in reaching the destination within a 5-m accuracy threshold, whereas traditional RL methods achieve only an 85% success rate. Dynamic memory management in P-QTFPR-DM optimises computational resources, enhancing the vehicle's adaptability to environmental changes. These results highlight the potential of quantum computing to significantly advance autonomous vehicle technology by improving both efficiency and effectiveness in complex navigation tasks. Future research will focus on refining the algorithm and exploring its real-world applications to enhance autonomous vehicle performance.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"5 4","pages":"360-383"},"PeriodicalIF":2.5,"publicationDate":"2024-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12111","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143253683","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
x2DL: A high throughput architecture for binary-ring-learning-with-error-based post quantum cryptography schemes
IF 2.5 Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2024-09-06 DOI: 10.1049/qtc2.12110
Shaik Ahmadunnisa, Sudha Ellison Mathe
<p>Lattice-based cryptography is one of the most promising cryptographic scheme which lies on the hardness of ring-learning-with-error (RLWE). A new variant of RLWE, known as binary-ring-learning-with-error (BRLWE), has less key size and more efficient hardware implementations compared to RLWE-based schemes. The key arithmetic operation for BRLWE-based encryption scheme is the implementation of arithmetic operation represented by <span></span><math> <semantics> <mrow> <mi>F</mi> <mi>D</mi> <mo>+</mo> <mi>H</mi> </mrow> <annotation> $FD+H$</annotation> </semantics></math>, where both <span></span><math> <semantics> <mrow> <mi>F</mi> </mrow> <annotation> $F$</annotation> </semantics></math> and <span></span><math> <semantics> <mrow> <mi>H</mi> </mrow> <annotation> $H$</annotation> </semantics></math> are integer polynomials, and <span></span><math> <semantics> <mrow> <mi>D</mi> </mrow> <annotation> $D$</annotation> </semantics></math> is a binary polynomial. An efficient architecture to perform the arithmetic operation <span></span><math> <semantics> <mrow> <mi>F</mi> <mi>D</mi> <mo>+</mo> <mi>H</mi> </mrow> <annotation> $FD+H$</annotation> </semantics></math> over a polynomial ring <span></span><math> <semantics> <mrow> <msup> <mi>x</mi> <mi>n</mi> </msup> <mo>+</mo> <mn>1</mn> </mrow> <annotation> ${x}^{n}+1$</annotation> </semantics></math> is proposed. We employ two linear feedback shift register structures comprising <span></span><math> <semantics> <mrow> <msup> <mi>x</mi> <mn>2</mn> </msup> </mrow> <annotation> ${x}^{2}$</annotation> </semantics></math>-<i>net</i> units in our design to reduce the computational time. This reduction in computational time yields to a significant improvement in the other performance metrics such as delay, area-delay product (ADP), power-delay product, throughput and efficiency compared to the existing designs. As per the experimental results, the authors’ proposed design has <span></span><ma
{"title":"x2DL: A high throughput architecture for binary-ring-learning-with-error-based post quantum cryptography schemes","authors":"Shaik Ahmadunnisa,&nbsp;Sudha Ellison Mathe","doi":"10.1049/qtc2.12110","DOIUrl":"https://doi.org/10.1049/qtc2.12110","url":null,"abstract":"&lt;p&gt;Lattice-based cryptography is one of the most promising cryptographic scheme which lies on the hardness of ring-learning-with-error (RLWE). A new variant of RLWE, known as binary-ring-learning-with-error (BRLWE), has less key size and more efficient hardware implementations compared to RLWE-based schemes. The key arithmetic operation for BRLWE-based encryption scheme is the implementation of arithmetic operation represented by &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $FD+H$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, where both &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $F$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $H$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; are integer polynomials, and &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $D$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is a binary polynomial. An efficient architecture to perform the arithmetic operation &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $FD+H$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; over a polynomial ring &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;x&lt;/mi&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/msup&gt;\u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${x}^{n}+1$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is proposed. We employ two linear feedback shift register structures comprising &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;x&lt;/mi&gt;\u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msup&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${x}^{2}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-&lt;i&gt;net&lt;/i&gt; units in our design to reduce the computational time. This reduction in computational time yields to a significant improvement in the other performance metrics such as delay, area-delay product (ADP), power-delay product, throughput and efficiency compared to the existing designs. As per the experimental results, the authors’ proposed design has &lt;span&gt;&lt;/span&gt;&lt;ma","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"5 4","pages":"349-359"},"PeriodicalIF":2.5,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12110","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143248706","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
An efficient and secure quantum blind signature-based electronic cash transaction scheme
IF 2.5 Q3 QUANTUM SCIENCE & TECHNOLOGY Pub Date : 2024-09-04 DOI: 10.1049/qtc2.12109
Aman Gupta, Gunja Venkat Chandra, Nayana Das, Goutam Paul

The authors present a novel token exchange scheme with an example of an electronic cash (eCash) transaction scheme that ensures quantum security, addressing the vulnerabilities of existing models in the face of quantum computing threats. The authors’ comprehensive analysis of various quantum blind signature mechanisms revealed significant shortcomings in their applicability to eCash transactions and their resilience against quantum adversaries. In response, the authors drew inspiration from D. Chaum's original classical eCash scheme and innovated a quantum-secure transaction framework. The authors detail the developed protocol and rigorously evaluate its security aspects. The protocol's adherence to critical security requirements such as blindness, non-forgeability, non-deniability, and prevention of double spending is analysed. Moreover, the scheme against Intercept and Resend, Denial of Service, Man-in-the-Middle, and Entangle-and-Measure attacks is rigorously tested. The authors’ findings indicate a robust eCash transaction model capable of withstanding the challenges posed by quantum computing advancements.

{"title":"An efficient and secure quantum blind signature-based electronic cash transaction scheme","authors":"Aman Gupta,&nbsp;Gunja Venkat Chandra,&nbsp;Nayana Das,&nbsp;Goutam Paul","doi":"10.1049/qtc2.12109","DOIUrl":"https://doi.org/10.1049/qtc2.12109","url":null,"abstract":"<p>The authors present a novel token exchange scheme with an example of an electronic cash (eCash) transaction scheme that ensures quantum security, addressing the vulnerabilities of existing models in the face of quantum computing threats. The authors’ comprehensive analysis of various quantum blind signature mechanisms revealed significant shortcomings in their applicability to eCash transactions and their resilience against quantum adversaries. In response, the authors drew inspiration from D. Chaum's original classical eCash scheme and innovated a quantum-secure transaction framework. The authors detail the developed protocol and rigorously evaluate its security aspects. The protocol's adherence to critical security requirements such as blindness, non-forgeability, non-deniability, and prevention of double spending is analysed. Moreover, the scheme against Intercept and Resend, Denial of Service, Man-in-the-Middle, and Entangle-and-Measure attacks is rigorously tested. The authors’ findings indicate a robust eCash transaction model capable of withstanding the challenges posed by quantum computing advancements.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"5 4","pages":"619-631"},"PeriodicalIF":2.5,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12109","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143248538","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