Quantum Information & Computation最新文献

{"title":"Quantum-based privacy-preserving techniques for secure and trustworthy internet of medical things an extensive analysis","authors":"D. Dhinakaran, L. Srinivasan, S. M. Udhaya Sankar, Dharani Selvaraj","doi":"10.26421/qic24.3-4-3","DOIUrl":"https://doi.org/10.26421/qic24.3-4-3","url":null,"abstract":"The advent of Quantum Key Distribution (QKD) and quantum-based privacy-preserving techniques has ushered in a new era for securing communication channels within the Internet of Medical Things (IoMT) systems. We examine the fundamentals, uses, and ramifications of quantum cryptography in relation to healthcare data security in this thorough investigation. The journey commences with an in-depth overview of quantum cryptography, unraveling the concepts of superposition, entanglement, and quantum gates that form the bedrock of quantum computing. As we proceed, we investigate the uses of quantum cryptography, highlighting its contribution to resolving the particular issues brought about by the data-intensive and networked character of IoMT systems. The relevance of QKD in ensuring secure communication within IoMT is meticulously dissected, with case studies and experiments demonstrating the practicality and effectiveness of quantum-based privacy-preserving techniques. From telemedicine networks to wearable health devices, each case study offers valuable insights into the application of quantum-safe cryptography, showcasing its ability to fortify data integrity and confidentiality. A meticulous survey of existing research, coupled with an analysis of advancements in quantum cryptography, provides a panoramic view of the current landscape. From hardware limitations to distance constraints, the study navigates through challenges and breakthroughs, offering a roadmap for the future integration of quantum technologies into IoMT systems.Comparing quantum-based approaches with classical cryptography unveils a nuanced landscape of computational complexity, key distribution methodologies, and real-time encryption considerations. This comparative analysis serves as a guide for healthcare practitioners and technologists in making informed decisions regarding the adoption of quantum-based privacy-preserving techniques in IoMT environments. The case studies and experiments collectively paint a picture of the practicality and promise of quantum-based privacy-preserving techniques in IoMT scenarios. Anticipating future advancements, the exploration extends into quantum hardware improvements, standardization efforts, and the integration of quantum technologies with emerging trends like edge computing and blockchain. As the healthcare industry stands on the cusp of a quantum revolution, the comprehensive insights provided herein offer a foundation for understanding, implementing, and shaping the future of secure healthcare communication through the lens of quantum cryptography.","PeriodicalId":106838,"journal":{"name":"Quantum Information & Computation","volume":"30 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140278236","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Quantum algorithms for SCS and text assembling problems","authors":"K. Khadiev, Carlos Manuel Bosch Machado,, Ze-Wen Chen, Junde Wu","doi":"10.26421/qic24.3-4-4","DOIUrl":"https://doi.org/10.26421/qic24.3-4-4","url":null,"abstract":"In this paper, we consider two versions of the Text Assembling problem. We are given a sequence of strings $s^1,dots,s^n$ of total length $L$ that is a dictionary, and a string $t$ of length $m$ that is a text. The first version of the problem is assembling $t$ from the dictionary. The second version is the ``Shortest Superstring Problem''(SSP) or the ``Shortest Common Superstring Problem''(SCS). In this case, $t$ is not given, and we should construct the shortest string (we call it superstring) that contains each string from the given sequence as a substring.These problems are connected with the sequence assembly method for reconstructing a long DNA sequence from small fragments. For both problems, we suggest new quantum algorithms that work better than their classical counterparts. In the first case, we present a quantum algorithm with $O(m+log msqrt{nL})$ query complexity. In the case of SSP, we present a quantum algorithm with $tilde{O}(n^3 1.728^n +L +n^{1.5}sqrt{L})$ query complexity. Here $tilde{O}$ hides not only constants but logarithms of $L$ and $n$ also.","PeriodicalId":106838,"journal":{"name":"Quantum Information & Computation","volume":"35 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140268989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}