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

2013 3rd International Conference on Advanced Materials and Information Technology Processing (AMITP 2013)

作者： Jiayu Zhuang Junsuo Zhao Fanjiang Xu Wenjun Zhan Dan Li Heng Zhang Science and Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences

ISBN: (纸本)9781845648534

A quantum computation problem of quantum search is discussed in this *** paper focused on researching the quantum search problem with an unknown amount of ***'s search algorithm,the most commonly used quantum search algorithm,is introduced in *** flow of quantum search algorithm and the quantum procedure model are *** the iteration steps in different quantum search problems are *** quantum search algorithm is powerless in fuzzy search problems by simulation and mathematical analysis.

关键词： quantum computation quantum search algorithm Grover's algorithm fuzzy problem

来源：评论

学校读者我要写书评

暂无评论

Efficient quantum algorithms for set operations

引用

SCIENTIFIC REPORTS 2024年第1期14卷 1-24页

作者： Elgendy, Rehab Younes, Ahmed Abu-Donia, H. M. Farouk, R. M. Zagazig Univ Fac Sci Dept Math Zagazig Egypt Alexandria Univ Fac Sci Dept Math & Comp Sci Alexandria Egypt Univ Birmingham Sch Comp Sci Birmingham B15 2TT England

Analyzing the relations between Boolean functions has many applications in many fields, such as database systems, cryptography, and collision problems. This paper proposes four quantum algorithms that use amplitude amplification techniques to perform set operations, including Intersection, Difference, and Union, on two Boolean functions in O ( N ) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {O}(\sqrt{\mathcal {N}} )$$\end{document} time complexity. The proposed algorithms employ two quantum amplitude amplification techniques divided into two stages. The first stage uses the Younes et al. algorithm for quantum searching via entanglement and partial diffusion to prepare incomplete superpositions of the truth set of the first Boolean function. In the second stage, a modified version of Arima's algorithm, along with an oracle that represent the second Boolean function, is employed to handle the set operations. The proposed algorithms have a higher probability of success in more general and comprehensive applications when compared with relevant techniques in literature.

关键词： Set operations quantum search algorithm Union Intersection Difference Amplitude amplification Incomplete superposition

来源：评论

学校读者我要写书评

暂无评论

quantum search-Aided Multi-User Detection for Sparse Code Multiple Access

引用

IEEE ACCESS 2019年 7卷 52804-52817页

作者： Ye, Wenjing Chen, Wei Guo, Xin Sun, Chen Hanzo, Lajos Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Sony China Ltd Sony China Res Lab Beijing 100028 Peoples R China Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

With the explosive proliferation of mobile devices, the scarcity of communication resources has emerged as a critical issue in the next generation (NG) communication systems. To overcome this, non-orthogonal multiple access (NOMA) has been shown to provide a beneficial spectral effi ciency gain, while supporting massive connectivity. Sparse code multiple access (SCMA) is one of the NOMA schemes, but its application is hampered by its high-complexity multi-user detection. Fortunately, quantum search techniques were shown to substantially reduce the complexity of multi-user detectors (MUD). However, the quantum search-aided multiuser detection of SCMA is an open problem at the time of writing. Hence, we conceive a pair of quantum search-aided MUDs for SCMA, namely, a quantum-assisted message passing algorithm (Q-MPA)-based MUD and a quantum-assisted sphere decoder-based MPA (QSD-MPA) MUD.

关键词： Sparse code multiple access multiuser detection quantum search algorithm message passing algorithm sphere decoder

来源：评论

学校读者我要写书评

暂无评论

Explaining Grover’s algorithm with a colony of ants: a pedagogical model for making quantum technology comprehensible

引用

Physics Education 2024年第3期59卷 035003-035003页

作者： Schalkers, Merel A Dankers, Kamiel Wimmer, Michael Vermaas, Pieter Department of Applied Mathematics Delft University of Technology Delft Netherlands Qutech and Kavli Institute of Nanoscience Delft University of Technology Delft Netherlands Department of Philosophy Delft University of Technology Delft Netherlands

The rapid growth of quantum technologies requires an increasing number of physicists, computer scientists, and engineers who can work on these technologies. For educating these professionals, quantum mechanics should stop being perceived as incomprehensible. In this paper we contribute to this change by presenting a pedagogical model for explaining Grover’s search algorithm, a prominent quantum algorithm. This model visualizes the three main steps of Grover’s algorithm and, in addition to explaining the algorithm itself, introduces three key principles of quantum mechanics: superposition, interference, and state collapse at measurement. The pedagogical model, visualized by a video, is called the ant colony maze model. It represents the search problems as finding the exit of a maze, and visualizes Grover’s search algorithm as a strategy by which a colony of ants finds that exit. © 2024 The Author(s). Published by IOP Publishing Ltd.

关键词： Grover’s algorithm quantum computing quantum search algorithm

来源：评论

学校读者我要写书评

暂无评论

Authenticated Multiparty quantum Key Agreement for Optical-Ring quantum Communication Networks

引用

FRONTIERS IN PHYSICS 2022年 10卷

作者： Gao, Li-Zhen Zhang, Xin Lin, Song Wang, Ning Guo, Gong-De Xiamen Inst Technol Coll Comp Sci & Informat Engn Xiamen Peoples R China Fujian Normal Univ Coll Comp & Cyber Secur Fuzhou Peoples R China Fujian Normal Univ Digital Fujian Internet Of Things Lab Environm Mo Fuzhou Peoples R China

quantum communication networks are connected by various devices to achieve communication or distributed computing for users in remote locations. In order to solve the problem of generating temporary session key for secure communication in optical-ring quantum networks, a quantum key agreement protocol is proposed. In the key agreement protocols, an attacker can impersonate a legal user to participate in the negotiation process and eavesdrop the agreement key easily. This is often overlooked in most quantum key agreement protocols, which makes them insecure in practical implementation. Considering this problem, the function of authenticating the user's identity is added in the proposed protocol. Combining classical hash function with identity information, we design the authentication operation conforming to the characteristics of quantum search algorithm. In the security analysis of the proposed protocol, quantum state discrimination is utilized to show that the protocol is secure against common attacks and impersonation attack. In addition, only single photons need to be prepared and measured, which makes our protocol feasible with existing technology.

关键词： quantum communication quantum key agreement identity authentication quantum search algorithm unambiguous state discrimination

来源：评论

学校读者我要写书评

暂无评论

Metasurface-Based quantum searcher on a Silicon-On-Insulator Chip

引用

MICROMACHINES 2022年第8期13卷 1204-1204页

作者： Wei, Zeyong Li, Haoyu Dou, Linyuan Xie, Lingyun Wang, Zhanshan Cheng, Xinbin Tongji Univ Sch Phys Sci & Engn Inst Precis Opt Engn Shanghai 200092 Peoples R China Tongji Univ MOE Key Lab Adv Microstruct Mat Shanghai 200092 Peoples R China Tongji Univ Shanghai Frontiers Sci Res Base Digital Opt Shanghai 200092 Peoples R China

Optical analog computing has natural advantages of parallel computation, high speed and low energy consumption over traditional digital computing. To date, research in the field of on-chip optical analog computing has mainly focused on classical mathematical operations. Despite the advantages of quantum computing, on-chip quantum analog devices based on metasurfaces have not been demonstrated so far. In this work, based on a silicon-on-insulator (SOI) platform, we illustrated an on-chip quantum searcher with a characteristic size of 60 x 20 mu m(2). We applied classical waves to simulate the quantum search algorithm based on the superposition principle and interference effect, while combining it with an on-chip metasurface to realize modulation capability. The marked items are found when the incident waves are focused on the marked positions, which is precisely the same as the efficiency of the quantum search algorithm. The proposed on-chip quantum searcher facilitates the miniaturization and integration of wave-based signal processing systems.

关键词： metasurface on-chip optical analog computing quantum search algorithm

来源：评论

学校读者我要写书评

暂无评论

quantum Secret Sharing Based on quantum search algorithm

引用

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS 2012年第10期51卷 3101-3108页

作者： Tseng, Hsin-Yi Tsai, Chia-Wei Hwang, Tzonelih Li, Chuan-Ming 1 Univ Rd Tainan 701 Taiwan

quantum secret sharing (QSS) and quantum search algorithm (QSA) are considered as two important but different research topics in quantum information science. This paper recognizes an important feature in the well-known Grover's QSA and then applies it to propose a QSS protocol. In contrast to the existing QSA-based QSS protocols, the newly proposed protocol has the following two advantages: (1) no quantum memory is required by the agents, whereas the agents in the existing QSA-based QSS protocols need long-term quantum memories to store their secret shadows;(2) the agents can cooperate to recover the boss's secret by using shadows in classical bits, whereas, the others have to combine their shadows in photons and perform a unitary operation on the retained photons. The proposed QSS protocol is also shown to be secure against eavesdroppers or malicious agents.

关键词： quantum information science quantum secret sharing quantum search algorithm

来源：评论

学校读者我要写书评

暂无评论

quantum Maximum Likelihood Decoding for Linear Block Codes 11

Quantum Maximum Likelihood Decoding for Linear Block Codes

引用

11th International Conference on Information and Communication Technology Convergence (ICTC) - Data, Network, and AI in the age of Untact (ICTC)

作者： Jung, Hyunwoo Kang, Jeonghwan Ha, Jeongseok Korea Adv Inst Sci & Technol Sch Elect Engn Daejeon South Korea

ISBN: (纸本)9781728167589

While the maximum likelihood decoding (MLD) is optimal, it suffers from a high decoding complexity. In this work, we propose a quantum MLD (QMLD) for linear block codes, which provides an optimal decoding performance at reduced asymptotic complexity. To this end, we utilize the Durr-Hoyer algorithm (DHA) to find out a codeword, c(ML) for a received signal vector y maximizing the conditional probability Pr(y vertical bar c) among codewords in a linear code C. Meanwhile, the DHA requires a quantum state representing the equiprobable superposition of all possible codewords as its input. To resolve the technical challenge, this work proposes a novel quantum circuit that produces the input quantum state to the DHA. Complexities of the proposed QMLD and classic MLD will be compared, which clearly demonstrates the computational superiority of the proposed QMLD.

关键词： Linear code Maximum likelihood decoding quantum search algorithm The Durr-Hoyer algorithm

来源：评论

学校读者我要写书评

暂无评论

Controlled Deterministic Secure quantum Communication Based on quantum search algorithm

引用

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS 2012年第8期51卷 2447-2454页

作者： Tseng, Hsin-Yi Tsai, Chia-Wei Hwang, Tzonelih Natl Cheng Kung Univ Dept Comp Sci & Informat Engn Tainan 70101 Taiwan

In this study, we propose a controlled deterministic secure quantum communication (CDSQC) protocol based on the idea of Grover's quantum search algorithm (QSA). The proposed protocol has the following two advantages over the existing CDSQC protocols: (1) high qubit frequency and (2) less quantum memory. Moreover, the security analysis of the proposed protocol shows that any eavesdropper will be detected with a very high probability under both ideal and noisy quantum channel conditions.

关键词： quantum information science Controlled deterministic secure quantum communication quantum search algorithm

来源：评论

学校读者我要写书评

暂无评论

quantum dialogue protocol based on Grover's search algorithms

引用

MODERN PHYSICS LETTERS A 2019年第21期34卷

作者： Yin, Aihan He, Kemeng Fan, Ping East China Jiao Tong Univ Dept Informat Engn Shuanggang Rd 808 Nanchang 330013 Jiangxi Peoples R China

Among many classic heuristic search algorithms, the Grover quantum search algorithm (QSA) can play a role of secondary acceleration. Based on the properties of the two-qubit Grover QSA, a quantum dialogue (QD) protocol is proposed. In addition, our protocol also utilizes the unitary operations and single-particle measurements. The transmitted quantum state (except for the decoy state used for detection) can transmit two-bits of security information simultaneously. Theoretical analysis shows that the proposed protocol has high security.

关键词： quantum search algorithm quantum dialogue controlled-not gate

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：