检索结果-内蒙古大学图书馆

quantum algorithms for the Physical Layer: Potential Applications to Physical Layer Security

IEEE ACCESS 2025年 13卷 13988-14009页

作者： Matsumine, Toshiki Ochiai, Hideki Shikata, Junji Yokohama Natl Univ Inst Adv Sci Yokohama 2408501 Japan Osaka Univ Grad Sch Engn Osaka 5650871 Japan Yokohama Natl Univ Grad Sch Environm & Informat Sci Yokohama 2408501 Japan

The field of quantum technologies has garnered considerable interest and witnessed noteworthy progress in recent years. It is also anticipated that these technologies will continue to flourish and exert a considerable influence on society, i.e., a plethora of real-world problems that cannot be solved by classical algorithms are believed to benefit from the implementation of quantum algorithms. Meanwhile, as an alternative to cryptographic methods, physical layer security (PLS) has been extensively studied as a means to realize secure wireless communication that is resistant to attacks by both classical and quantum computers, i.e., quantum-safe. While the prevailing approach to PLS has been based on classical algorithms, this could potentially be accelerated by the application of quantum algorithms. This paper examines the potential applications of various quantum algorithms, including quantum annealing, hybrid quantum-classical algorithms, and Grover-based algorithms, to the the PLS problems. In particular, we begin with a concise overview of their applications to physical layer techniques and then proceed to discuss their use in addressing the challenges of secret message transmission and secret key generation from wireless channels.

关键词： Logic gates quantum computing quantum algorithm Optimization Annealing Qubit quantum annealing Cryptography Computers Approximation algorithms Hybrid quantum-classical algorithms multi-input multi-output (MIMO) physical layer security (PLS) quantum algorithms quantum annealing (QA) quantum approximate optimization algorithm (QAOA) reconfigurable intelligent surface (RIS) secret key generation (SKG)

来源：评论

学校读者我要写书评

暂无评论

quantum algorithms use in trust-centric AI applications

引用

INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING 2025年第2期16卷 151-161页

作者： Kaur, Davinder Uslu, Suleyman Durresi, Arjan Indiana Univ Purdue Univ Dept Comp Sci Indianapolis IN USA Indiana Univ Indianapolis Dept Comp Sci Indianapolis IN 46202 USA

The realm of quantum computing is experiencing rapid growth, harnessing the principles of quantum mechanics to exponentially accelerate computations that surpass classical computing capabilities. Such advancements can potentially reshape the landscape of reliable artificial intelligence, particularly in the context of data-intensive, intricate decision-making processes. Diverse trust-oriented AI frameworks have been introduced to address various AI applications. This paper evaluates multiple AI systems focused on trust, compiling observations about their corresponding quantum algorithms. The analysis delves into quantum algorithmic approaches within three key trust-centric AI areas: detecting fraudulent users in social networks, creating diagnostic systems for healthcare, and optimising pathways for trust aggregation in social networks. This study unveils a pivotal observation: quantum algorithms demonstrate diminished time complexity, enhancing trust-based AI applications' expeditiousness.

关键词： quantum algorithms trustworthy AI

来源：评论

学校读者我要写书评

暂无评论

quantum algorithms for Longest Common Substring with a Gap 31st

Quantum Algorithms for Longest Common Substring with a Gap

引用

31st International Symposium on String Processing and Information Retrieval (SPIRE)

作者： Gibney, Daniel Hossen, Md Helal Univ Texas Dallas Dallas TX 75080 USA

ISBN: (纸本)9783031721991;9783031722004

Recent breakthroughs have provided a sublinear time quantum algorithm for the Longest Common Substring Problem running in (O) over tilde (n(2/3)/d(1/6)) time for two strings of length at most n, where d is the length of the solution. At the same time, no subquadratic time quantum algorithm for the Longest Common Subsequence Problem is known, implying increasing difficulty as gaps are allowed within the solution. In this work, we consider the problem of finding two ordered matching substrings such that their total length is maximized. We present a strongly sublinear-time quantum algorithm.

关键词： Longest Common Subsequence Longest Common Substring quantum algorithms

来源：评论

学校读者我要写书评

暂无评论

quantum algorithms for enhanced educational technologies

引用

Discover Education 2025年第1期4卷 1-33页

作者： Hanafi, Basil Ali, Mohammad Singh, Devyaani Department of Computer Science Aligarh Muslim University Aligarh India Department of Political Science Aligarh Muslim University Aligarh India

quantum computing is the beginning of a new age for diverse industries, and educational technologies will significantly benefit from such quantum developments. This is a novel approach, applying quantum algorithms to enhance educational technologies, with no previous studies addressing the integration of quantum computing for personalized learning, data security, and resource optimization in such a comprehensive manner. It is in this context that the present paper delves into the role of quantum algorithms in education ecosystems and focuses on their capacity for transforming both learner and institution personalization, resources management, and secure data protection in learning contexts. Modern quantum algorithms like Grover’s Algorithm and quantum Annealing support various functionalities like rapidity in processing as well as instantaneous flexibility towards customization of learning resources for the students and proper optimization of the learning trail. Also, quantum cryptography provides reliable security and prevention against future attacks on cyber security hence providing safe means of transferring educational data. Unfortunately, the use of these technologies in learning institutions has not been without some problems. Some of the challenges are the creation of well-functioning quantum hardware, functional software solutions, the application of data ethically, and others. This study presents a balanced view of the positive impacts as well as the technical and ethical implications of quantum technologies in education. In this respect, the paper advances theoretical and practical knowledge about what quantum computing could potentially do to reshape education. In conclusion, the findings of this study have revealed that more scholarly and collaborative research should be conducted in order to eliminate the existing obstacles to the use and exploitation of potential benefits of quantum computing in the educational system. © The Author(s) 2025.

关键词： Educational technology quantum algorithms quantum computing quantum education

来源：评论

学校读者我要写书评

暂无评论

quantum resource estimation for large scale quantum algorithms

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2025年 162卷

作者： Gheorghiu, Vlad Mosca, Michele SoftwareQ Inc 180 Northfield Dr Waterloo ON N2L 0C7 Canada Univ Waterloo Inst Quantum Comp 200 Univ Ave Waterloo ON N2L 3G1 Canada Univ Waterloo Dept Combinator & Optimizat 200 Univ Ave Waterloo ON N2L 3G1 Canada

quantum algorithms are often represented in terms of quantum circuits operating on ideal (logical) qubits. However, the practical implementation of these algorithms poses significant challenges. Many quantum algorithms require a substantial number of logical qubits, and the inherent susceptibility to errors of quantum computers require quantum error correction. The integration of error correction introduces overhead in terms of both space (physical qubits required) and runtime (how long the algorithm needs to be run for). This paper addresses the complexity of comparing classical and quantum algorithms, primarily stemming from the additional quantum error correction overhead. We propose a comprehensive framework that facilitates a direct and meaningful comparison between classical and quantum algorithms. By acknowledging and addressing the challenges introduced by quantum error correction, our framework aims to provide a clearer understanding of the comparative performance of classical and quantum computing approaches. This work contributes to understanding the practical viability and potential advantages of quantum algorithms in real-world applications. We apply our framework to quantum cryptanalysis, since it is well known that quantum algorithms can break factoring and discrete logarithm based cryptography and weaken symmetric cryptography and hash functions. In order to estimate the real-world impact of these attacks, apart from tracking the development of fault-tolerant quantum computers it is important to have an estimate of the resources needed to implement these quantum attacks. This analysis provides state-of-the art snap-shot estimates of the realistic costs of implementing quantum attacks on these important cryptographic algorithms, assuming quantum fault-tolerance is achieved using surface code methods, and spanning a range of potential error rates. These estimates serve as a guide for gauging the realistic impact of these algorithms and for benchmarking

关键词： quantum computing quantum algorithms quantum error correction Cryptanalysis

来源：评论

学校读者我要写书评

暂无评论

Photon-native quantum algorithms

引用

MATERIALS FOR quantum TECHNOLOGY 2025年第2期5卷 023001-023001页

作者： Salavrakos, Alexia Maring, Nicolas Emeriau, Pierre-Emmanuel Mansfield, Shane Quandela 7 Rue Leonard de Vinci F-91300 Massy France

Photonic platforms occupy a central place in quantum technologies. They appear in quantum networks and communication, in near-term quantum advantage schemes, as well as in fault-tolerant quantum computing proposals. In this perspective article, we review the advances and challenges of this technology, and we focus on algorithms and protocols that we call photon-native, i.e. which closely follow the specificities of the hardware.

关键词： photonic quantum computing quantum algorithms quantum machine learning

来源：评论

学校读者我要写书评

暂无评论

Resilience-runtime tradeoff relations for quantum algorithms

引用

REPORTS ON PROGRESS IN PHYSICS 2025年第3期88卷 037601-037601页

作者： Pedro Garcia-Pintos, Luis O'Leary, Tom Biswas, Tanmoy Bringewatt, Jacob Cincio, Lukasz Brady, Lucas T. Liu, Yi-Kai Los Alamos Natl Lab Theoret Div T4 Los Alamos NM 87545 USA Univ Oxford Clarendon Lab Parks Rd Oxford OX1 3PU England Univ Maryland Joint Ctr Quantum Informat & Comp Sci College Pk MD 20742 USA Univ Maryland Joint Quantum Inst College Pk MD 20742 USA Harvard Univ Dept Phys Cambridge MA 02138 USA NASA Ames Res Ctr Quantum Artificial Intelligence Lab Moffett Field CA 94035 USA Natl Inst Stand & Technol Appl & Computat Math Div Gaithersburg MD 20899 USA

A leading approach to algorithm design aims to minimize the number of operations in an algorithm's compilation. One intuitively expects that reducing the number of operations may decrease the chance of errors. This paradigm is particularly prevalent in quantum computing, where gates are hard to implement and noise rapidly decreases a quantum computer's potential to outperform classical computers. Here, we find that minimizing the number of operations in a quantum algorithm can be counterproductive, leading to a noise sensitivity that induces errors when running the algorithm in non-ideal conditions. To show this, we develop a framework to characterize the resilience of an algorithm to perturbative noises (including coherent errors, dephasing, and depolarizing noise). Some compilations of an algorithm can be resilient against certain noise sources while being unstable against other noises. We condense these results into a tradeoff relation between an algorithm's number of operations and its noise resilience. We also show how this framework can be leveraged to identify compilations of an algorithm that are better suited to withstand certain noises.

关键词： quantum algorithms noise resilience quantum computing quantum compilation

来源：评论

学校读者我要写书评

暂无评论

A Systematic Mapping Study on quantum and quantum-inspired algorithms in Operations Research

引用

ACM COMPUTING SURVEYS 2025年第3期57卷 1-35页

作者： Gomes, Claudio Fernandes, Joao paulo Falcao, Gabriel Kar, Soummya Tayur, Sridhar Univ Porto Fac Engn Dept Informat Engn Porto Portugal Carnegie Mellon Univ Elect & Comp Engn Pittsburgh PA 15213 USA Univ Porto Lab Inteligencia Artificial & Ciencia Comp Porto Portugal New York Univ Abu Dhabi Abu Dhabi U Arab Emirates Univ Coimbra Dept Elect & Comp Engn Coimbra Portugal Inst Telecomunicacoes Coimbra Coimbra Portugal Carnegie Mellon Univ Tepper Sch Business Quantum Technol Grp Pittsburgh PA USA

quantum and quantum-inspired algorithms have not yet been systematically classified in the context of potential Operations Research (OR) applications. Our systematic mapping is designed for quick consultation and shows which algorithms have been significantly explored in the context of OR, as well as which algorithms have been vaguely addressed in the same context. The study provides rapid access to OR professionals, both practitioners and researchers, who are interested in applying and/or further developing these algorithms in their respective contexts. We prepared a replicable protocol as a backbone of this systematic mapping study, specifying research questions, establishing effective search and selection methods, defining quality metrics for assessment, and guiding the analysis of the selected studies. A total of more than 2,000 studies were found, of which 149 were analyzed in detail. Readers can have an interactive hands-on experience with the collected

关键词： quantum algorithms quantum-inspired algorithms operations research systematic mapping study

来源：评论

学校读者我要写书评

暂无评论

quantum algorithms and Experiment Implementations Based on IBM Q

引用

Computers, Materials & Continua 2020年第11期65卷 1671-1689页

作者： Wenjie Liu Junxiu Chen Yinsong Xu Jiahao Tang Lian Tong Xiaoyu Song Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and TechnologyNanjing210044China School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China School of Information Engineering Jiangsu Maritime InstituteNanjing211100China Department of Electrical and Computer Engineering Portland State UniversityOregon97207USA

With the rapid development of quantum theory and technology in recent years,especially the emergence of some quantum cloud computing platforms,more and more researchers are not satisfied with the theoretical derivation and simulation verification of quantum computation(especially quantum algorithms),experimental verification on real quantum devices has become a new *** this paper,three representative quantum algorithms,namely Deutsch-Jozsa,Grover,and Shor algorithms,are briefly depicted,and then their implementation circuits are presented,*** program these circuits on python with QISKit to connect the remote real quantum devices(i.e.,ibmqx4,ibmqx5)on IBM Q to verify these *** experimental results not only show the feasibility of these algorithms,but also serve to evaluate the functionality of these devices.

关键词： quantum algorithms implementation circuit IBM Q QISKit program

来源：评论

学校读者我要写书评

暂无评论

quantum algorithms FOR THE SHORTEST COMMON SUPERSTRING AND TEXT ASSEMBLING PROBLEMS

引用

quantum INFORMATION & COMPUTATION 2024年第3-4期24卷 267-294页

作者： Khadiev, Kamil Machado, Carlos Manuel Bosch Chen, Zeyu Wu, Junde Kazan Fed Univ Inst Computat Math & Informat Technol Kremlyovskaya 35 Kazan Russia Zhejiang Univ Sch Math Sci Hangzhou 310058 Peoples R China

In this paper, we consider two versions of the Text Assembling problem. We are given a sequence of strings s1, ... , sn 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 m nL) query complexity. In the case of SSP, we present a quantum algorithm with O-similar to(n(3)1.728(n) + L + n(1.5)root L) query complexity. Here O-similar to hides not only constants but logarithms of L and n also.

关键词： quantum algorithms shortest superstring strings DNA assembly

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：