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

COMPUTING & CONTROL ENGINEERING JOURNAL 1999年第3期10卷 105-112页

作者： Hey, T Univ Southampton Dept Elect & Comp Sci Southampton SO17 1BJ Hants England

The basic ideas of quantum computation are introduced by a brief discussion of Bennett and Fredkin's ideas of reversible computation. After some remarks about Deutsch's pioneering work on quantum complexity and Shor's factorisation algorithm, quantum logic gates, qubits and registers are discussed. The role of quantum entanglement is stressed and Grover's quantum search algorithm described in detail. The paper ends with a review of the current experimental status of quantum computers.

关键词： quantum computing theory registers quantum computation qubits quantum search algorithm reversible computation Computational complexity quantum computers quantum computing quantum entanglement quantum logic gates quantum complexity factorisation algorithm computational complexity

来源：评论

学校读者我要写书评

暂无评论

Global multipartite entanglement dynamics in Grover's search algorithm

引用

quantum INFORMATION PROCESSING 2017年第9期16卷 1-18页

作者： Pan, Minghua Qiu, Daowen Zheng, Shenggen Sun Yat Sen Univ Inst Comp Sci Theory Sch Data & Comp Sci Guangzhou 510006 Guangdong Peoples R China Sun Yat Sen Univ Sch Elect & Informat Technol Guangzhou 510006 Guangdong Peoples R China Wuzhou Univ Sch Informat & Elect Engn Wuzhou 543002 Peoples R China

Entanglement is considered to be one of the primary reasons for why quantum algorithms are more efficient than their classical counterparts for certain computational tasks. The global multipartite entanglement of the multiqubit states in Grover's search algorithm can be quantified using the geometric measure of entanglement (GME). Rossi et al. (Phys Rev A 87: 022331, 2013) found that the entanglement dynamics is scale invariant for large n. Namely, the GME does not depend on the number n of qubits;rather, it only depends on the ratio of iteration k to the total iteration. In this paper, we discuss the optimization of the GME for large n. We prove that " the GME is scale invariant" does not always hold. We show that there is generally a turning point that can be computed in terms of the number of marked states and their Hamming weights during the curve of the GME. The GME is scale invariant prior to the turning point. However, the GME is not scale invariant after the turning point since it also depends on n and the marked states.

关键词： Entanglement dynamics quantum search algorithm Geometricmeasure of entanglement Scale invariance

来源：评论

学校读者我要写书评

暂无评论

QEPP: A quantum Efficient Privacy Protection Protocol in 6G-quantum Internet of Vehicles

IEEE TRANSACTIONS ON INTELLIGENT VEHICLES

引用

IEEE TRANSACTIONS ON INTELLIGENT VEHICLES 2024年第1期9卷 905-916页

作者： Qu, Zhiguo Chen, Zhixiao Ning, Xin Tiwari, Prayag Minist Educ Jiangsu Collaborat Innovat Ctr Atmospher Environm Equipment Technol & Engn Res Ctr Digital Forens Nanjing 210044 Peoples R China Nanjing Univ Informat Sci & Technol Sch Comp Sci Nanjing 210044 Peoples R China Chinese Acad Sci Inst Semicond Beijing 100045 Peoples R China Halmstad Univ Sch Informat Technol S-30118 Halland Sweden

The increasing popularity of 6G communication within the Internet of Vehicles (IoV) ecosystem is expected to induce a surge in both user numbers and data volumes. This expansion will cause substantial challenges in ensuring network security and privacy protection, as well as in addressing the associated issue of inadequate cloud computing resources. In this article, we propose a quantum Efficient Privacy Protection (QEPP) protocol that leverages reversible information hiding in quantum point clouds. This protocol utilizes quantum communication technology in edge-to-cloud communication of the IoV to transmit sensitive information embedded in quantum state data, thereby ensuring privacy protection. It employs quantum error-correction coding and efficient coding techniques to extract information and recover the carriers. In addition, the protocol utilizes an improved quantum Grover algorithm in the cloud to accelerate the processing speed of quantum data. By addressing security vulnerabilities and improving cloud-computing capabilities, the QEPP can effectively accommodate critical requirements, including precision, timeliness, and robust privacy protection.

关键词： 6G mobile communication Protocols Privacy Cloud computing Qubit Point cloud compression Servers Privacy protection quantum reversible information hiding quantum point cloud quantum search algorithm

来源：评论

学校读者我要写书评

暂无评论

Three-party quantum dialogue based on Grover's algorithm with identity dual authentication

引用

quantum INFORMATION PROCESSING 2024年第11期23卷 1-16页

作者： Pan, Tian-Jiao Zhou, Ri-Gui Zhang, Xiao-Xue Shanghai Maritime Univ Sch Informat Engn Shanghai 201306 Peoples R China

Based on the study of quantum dialogue and quantum identity authentication, this paper proposes an improved three-party quantum dialogue (3P-QD) with dual authentication of identity protocol based on quantum search algorithm (QSA) and bidirectional verification of user identity. The protocol utilizes two-particle states as quantum resources to achieve bidirectional transmission of information in the channel and uses the non-cloning theorem of quantum mechanics, which ensures that sequences of quantum bits can be reliably and securely guaranteed during transmission. The characteristics of the QSA in the two-qubit are applied to the target state search process of this 3P-QD protocol, which can accomplish the task of safely transferring two bits of information between the two communicating parties. In addition, in the communication, one of the fixed third party is not only a communicating party, but also acts as a controller for the other two parties. Meanwhile, in order to ensure the security and integrity of the communication, a bidirectional authentication step is added to the communication process, which well solves the problem of eavesdropping. Based on the above features, compared with the existing protocols, this protocol has better advantages.

关键词： quantum identity authentication quantum dialogue quantum search algorithm Entanglement swapping

来源：评论

学校读者我要写书评

暂无评论

quantum associative memory with linear and non-linear algorithms for the diagnosis of some tropical diseases

引用

NEURAL NETWORKS 2018年 97卷 1-10页

作者： Njafa, J. -P. Tchapet Engo, S. G. Nana Univ Ngaoundere Dept Phys Lab Photon POB 454 Ngaoundere Cameroon

This paper presents the QAMDiagnos, a model of quantum Associative Memory (QAM) that can be a helpful tool for medical staff without experience or laboratory facilities, for the diagnosis of four tropical diseases (malaria, typhoid fever, yellow fever and dengue) which have several similar signs and symptoms. The memory can distinguish a single infection from a polyinfection. Our model is a combination of the improved versions of the original linear quantum retrieving algorithm proposed by Ventura and the non-linear quantum search algorithm of Abrams and Lloyd. From the given simulation results, it appears that the efficiency of recognition is good when particular signs and symptoms of a disease are inserted given that the linear algorithm is the main algorithm. The non-linear algorithm helps confirm or correct the diagnosis or give some advice to the medical staff for the treatment. So, our QAMDiagnos that has a friendly graphical user interface for desktop and smart-phone is a sensitive and a low-cost diagnostic tool that enables rapid and accurate diagnosis of four tropical diseases. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： quantum associative memory quantum search algorithm Linear search algorithm Non-linear search algorithm Tropical diseases

来源：评论

学校读者我要写书评

暂无评论

Experimental quantum deletion in an NMR quantum information processor

引用

Science China(Physics,Mechanics & Astronomy) 2014年第7期57卷 1256-1261页

作者： LONG Yu FENG GuanRu PEARSON Jasong LONG GuiLu State Key Laboratory of Low-dimensional Quantum Physics and Department of Physics Tsinghua University Collaborative Innovation Center of Quantum Matter Tsinghua National Laboratory for Information Science and Technology Tsinghua University

We report an NMR experimental realization of a rapid quantum deletion algorithm that deletes marked states in an unsorted *** classical deletion,where search and deletion are equivalent,quantum deletion can be implemented with only a single query,which achieves exponential speed-up compared to the optimal classical *** the experimental realization,the GRAPE algorithm was used to obtain an optimized NMR pulse sequence,and the efficient method of maximum-likelihood has been used to reconstruct the experimental output state.

关键词： quantum deletion algorithm quantum computing nuclear magnetic resonance quantum search algorithm

来源：评论

学校读者我要写书评

暂无评论

Computing hypergraph Ramsey numbers by using quantum circuit

引用

quantum INFORMATION PROCESSING 2013年第7期12卷 2487-2496页

作者： Qu, Ri Li, Zong-shang Wang, Juan Bao, Yan-ru Cao, Xiao-chun Tianjin Univ Sch Comp Sci & Technol Tianjin 300072 Peoples R China

Gaitan and Clark (Phys Rev Lett 108:010501, 2012) have recently shown a quantum algorithm for the computation of the Ramsey numbers using adiabatic quantum evolution. We present a quantum algorithm to compute the two-... 详细信息

关键词： Ramsey numbers r-Uniform hypergraphs quantum counting quantum search algorithm

来源：评论

学校读者我要写书评

暂无评论

A Parallel quantum algorithm for the Satisfiability Problem

引用

Communications in Theoretical Physics 2008年第3期49卷 629-630页

作者： LIU Wen-Zhang ZHANG Jing-Fu LONG Gui-Lu Key Laboratory for Atomic and Molecular NanoSciences and Department of Physics Tsinghua University Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

In this paper we present a classical parallel quantum algorithm for the satisfiability problem. We have exploited the classical parallelism of quantum algorithms developed in [G.L. Long and L. Xiao, Phys. Rev. A 69 （2004） 052303], so that additional acceleration can be gained by using classical parallelism. The quantum algorithm first estimates the number of solutions using the quantum counting algorithm, and then by using the quantum searching algorithm, the explicit solutions are found.

关键词： satisfiability problem quantum search algorithm long algorithm

来源：评论

学校读者我要写书评

暂无评论

Verifier-based algorithm for unsorted database search problem

引用

INTERNATIONAL JOURNAL OF quantum INFORMATION 2007年第4期5卷 597-604页

作者： Di Wu, Xiao Long, Gui Lu Tsinghua Univ Dept Phys Beijing 100084 Peoples R China Tsinghua Univ Key Lab Atom & Mol Nanosci Beijing 100084 Peoples R China Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

Unsorted database search problem is an important science and engineering problem. We proposed quantum algorithm to solve the problem by dividing the database binarily and then use a probabilistic veri. er algorithm to determine if the item is within one part of the divided database. We analyzed the computational complexity of this algorithm, and found that in general, the number of steps is proportional to that in the standard Grover algorithm. However in some cases, it is less than that of the Grover algorithm.

关键词： quantum search algorithm Grover algorithm long algorithm

来源：评论

学校读者我要写书评

暂无评论

Phase condition for the Grover algorithm

引用

THEORETICAL AND MATHEMATICAL PHYSICS 2005年第3期144卷 1279-1287页

作者： Li, DF Li, XX Huang, HT Tsinghua Univ Natl Lab Artificial Intellect Dept Math Sci Beijing 100084 Peoples R China Wayne State Univ Dept Comp Sci Detroit MI 48202 USA Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

For the Grover algorithm, we derive the exact formula of the norm of the amplitude in the marked state in a sine-function form and use this formula, to derive the necessary and sufficient phase condition sin Delta <= vertical bar beta vertical bar for this algorithm with arbitrary phase rotations. We show that the condition of identical rotation angles theta = phi, which is a special case of our condition, is a sufficient but not necessary, phase condition.

关键词： Grover algorithm quantum search algorithm phase condition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：