期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到119篇文章
< 1 2 … 6 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Three-party semi-quantum dialogue enhanced with Grover's algorithm based encoding and hypergraph access control 认领 引用
1
作者 Rui Tao Jin-Zhe Jiang Zhi-Hua Zhang 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第7期435-447,共13页
We introduce a new three-party semi-quantum dialogue(3P-SQD)protocol that combines GHZ-state-based semiquantum communication,a Grover's algorithm-driven 2-bit encoding scheme,and hypergraph-based access control.In... We introduce a new three-party semi-quantum dialogue(3P-SQD)protocol that combines GHZ-state-based semiquantum communication,a Grover's algorithm-driven 2-bit encoding scheme,and hypergraph-based access control.In each round,the fully quantum participant Alice sends two bits,whereas the semi-quantum participants Bob and Charlie,restricted to semi-quantum operations such as measurements in the computational basis and reflection,each transmit one bit.The protocol incorporates probe state checking,Grover's algorithm-based encoding,and hypergraph-based authorization.It achieves information-theoretic security and controlled access,while preserving high message throughput and imposing no additional requirements on the semi-quantum users. 展开更多
关键词 semi-quantum dialogue Grover’s algorithm based encoding hypergraph access structure quantum communication
暂未订购 下载PDF
Eavesdropping in a quantum secret sharing protocol based on Grover algorithm and its solution 认领 引用 被引量：21
2
作者 HAO Liang LI JunLin LONG GuiLu 《Science China(Physics,Mechanics & Astronomy)》 SCIE EI CAS 2010年第3期491-495,共5页
A detailed analysis has showed that the quantum secret sharing protocol based on the Grover algorithm(Phys Rev A,2003,68:022306)is insecure.A dishonest receiver may obtain the full information without being detected.A... A detailed analysis has showed that the quantum secret sharing protocol based on the Grover algorithm(Phys Rev A,2003,68:022306)is insecure.A dishonest receiver may obtain the full information without being detected.A quantum secret-sharing protocol is presents here,which mends the security loophole of the original secret-sharing protocol,and doubles the information capacity. 展开更多
关键词 quantum secret sharing Grover algorithm quantum cryptography quantum search algorithm
暂未订购 下载PDF
基于Grover算法的高斯筛法量子线路设计方法 认领 引用
3
作者 曹仁龙 胡红钢 《信息网络安全》 CSCD 北大核心 2026年第2期224-235,共12页
筛法是求解格中最短向量问题的最快方法。在实际应用中,启发式筛法因其较低的时间复杂度和卓越的攻击效率,成为针对格密码算法的新型攻击手段。随着量子计算技术迅猛发展,量子算法的引入使量子筛法在理论上能够达到最优的渐近时间复杂度... 筛法是求解格中最短向量问题的最快方法。在实际应用中,启发式筛法因其较低的时间复杂度和卓越的攻击效率,成为针对格密码算法的新型攻击手段。随着量子计算技术迅猛发展,量子算法的引入使量子筛法在理论上能够达到最优的渐近时间复杂度,但目前针对量子筛法的电路设计研究仍处于初级阶段。因此,文章提出一种基于Grover量子搜索算法的高斯筛法量子线路设计方案,深入探讨高斯筛法中两个核心搜索过程的量子电路设计及其关键操作,并成功构建相应Oracle黑盒的量子线路。通过玩具示例验证该方案不仅能够在量子计算模型下正确执行,而且能有效降低高斯筛法的时间复杂度。 展开更多
关键词 高斯筛法 Grover量子搜索算法 量子线路 最短向量问题
暂未订购 下载PDF
Grover quantum searching algorithm based on weighted targets 认领 引用 被引量：1
4
作者 Li Panchi Li Shiyong 《Journal of Systems Engineering and Electronics》 SCIE EI 2008年第2期363-369,共7页
The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal... The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example. 展开更多
关键词 Grover algorithm targets weighting quantum searching quantum computing.
暂未订购 下载PDF
A Four-Phase Improvement of Grover's Algorithm 认领 引用 被引量：3
5
作者 马博文 鲍皖苏 +3 位作者 李坦 李风光 张硕 付向群 《Chinese Physics Letters》 SCIE EI CAS CSCD 2017年第7期33-37,共5页
When applying Grover＇s algorithm to an unordered database, the probabifity of obtaining correct results usually decreases as the quantity of target increases. A four-phase improvement of Grover＇s algorithm is propos... When applying Grover＇s algorithm to an unordered database, the probabifity of obtaining correct results usually decreases as the quantity of target increases. A four-phase improvement of Grover＇s algorithm is proposed to fix the deficiency, and the unitary and the phase-matching condition are also proposed. With this improved scheme, when the proportion of target is over 1/3, the probability of obtaining correct results is greater than 97.82% with only one iteration using two phases. When the computational complexity is O（ √M/N）, the algorithm can succeed with a probability no less than 99.63%. 展开更多
关键词 A Four-Phase Improvement of Grover’s Algorithm
暂未订购 下载PDF
Grover search algorithm in an ion trap systen 认领 引用
6
作者 郑仕标 《Chinese Physics B》 CAS 2005年第11期2222-2225,共4页
Two schemes for the implementation of the two-qubit Grover search algorithm in the ion trap system are proposed. These schemes might be experimentally realizable with presently available techniques. The experimental i... Two schemes for the implementation of the two-qubit Grover search algorithm in the ion trap system are proposed. These schemes might be experimentally realizable with presently available techniques. The experimental implementation of the schemes would be an important step toward more complex quantum computation in the ion trap system. 展开更多
关键词 grover search algorithm ion trap system quantum computation
暂未订购 下载PDF
Effects of initial states on the quantum correlations in the generalized Grover search algorithm 认领 引用 被引量：1
7
作者 Zhen-Yu Chen Tian-HuiQiu +1 位作者 Wen-Bin Zhang Hong-Yang Ma 《Chinese Physics B》 SCIE EI CAS CSCD 2021年第8期145-151,共7页
We investigate the correlations between two qubits in the Grover search algorithm with arbitrary initial states by numerical simulation.Using a set of suitable bases,we construct the reduced density matrix and give th... We investigate the correlations between two qubits in the Grover search algorithm with arbitrary initial states by numerical simulation.Using a set of suitable bases,we construct the reduced density matrix and give the numerical expression of correlations relating to the iterations.For different initial states,we obtain the concurrence and quantum discord compared with the success probability in the algorithm.The results show that the initial states affect the correlations and the limit point of the correlations in the searching process.However,the initial states do not influence the whole cyclical trend. 展开更多
关键词 Grover search algorithm quantum correlations initial states the success probability
暂未订购 下载PDF
A Memory-efficient Simulation Method of Grover’s Search Algorithm 认领 引用 被引量：2
8
作者 Xuwei Tang Juan Xu Bojia Duan 《Computers, Materials & Continua》 SCIE EI 2018年第11期307-319,共13页
Grover’s search algorithm is one of the most significant quantum algorithms,which can obtain quadratic speedup of the extensive search problems.Since Grover's search algorithm cannot be implemented on a real quan... Grover’s search algorithm is one of the most significant quantum algorithms,which can obtain quadratic speedup of the extensive search problems.Since Grover's search algorithm cannot be implemented on a real quantum computer at present,its quantum simulation is regarded as an effective method to study the search performance.When simulating the Grover's algorithm,the storage space required is exponential,which makes it difficult to simulate the high-qubit Grover’s algorithm.To this end,we deeply study the storage problem of probability amplitude,which is the core of the Grover simulation algorithm.We propose a novel memory-efficient method via amplitudes compression,and validate the effectiveness of the method by theoretical analysis and simulation experimentation.The results demonstrate that our compressed simulation search algorithm can help to save nearly 87.5%of the storage space than the uncompressed one.Thus under the same hardware conditions,our method can dramatically reduce the required computing nodes,and at the same time,it can simulate at least 3 qubits more than the uncompressed one.Particularly,our memory-efficient simulation method can also be used to simulate other quantum algorithms to effectively reduce the storage costs required in simulation. 展开更多
关键词 Grover’s search algorithm probability amplitude quantum simulation memory compression
暂未订购 下载PDF
Quantum-Enhanced Algorithm for Complex Flow Field Simulation in Near-Space 认领 引用
9
作者 CUI Fuxin KANG Jian XU Liang 《Aerospace China》 2025年第3期46-54,共9页
High-fidelity simulation of rarefied gas flows in near-space is essential for hypersonic vehicle design,but the classical Direct Simulation Monte Carlo(DSMC)method faces computational bottlenecks due to its O(N2)co... High-fidelity simulation of rarefied gas flows in near-space is essential for hypersonic vehicle design,but the classical Direct Simulation Monte Carlo(DSMC)method faces computational bottlenecks due to its O(N2)complexity in molecular collision handling.This paper proposes a quantum-enhanced DSMC algorithm that leverages the Grover search algorithm to accelerate collision pair selection,reducing the complexity to O(N).The algorithm encodes molecular pairs into quantum superpositions and applies amplitude amplification for parallel screening,while retaining the full physical fidelity of classical DSMC.Numerical experiments validate the efficient preparation of high-fidelity Gaussian states for representing Maxwell-Boltzmann distributions,and confirm that the quantum-enhanced DSMC maintains physical accuracy while exhibiting increasingly pronounced acceleration with system size.This work offers a novel pathway for efficient simulation of complex near-space flow fields. 展开更多
关键词 quantum computing near‑space flow DSMC Grover algorithm collision selection
暂未订购 下载PDF
Time Complexity of the Oracle Phase in Grover’s Algorithm 认领 引用 被引量：1
10
作者 Ying Liu 《American Journal of Computational Mathematics》 2024年第1期1-10,共10页
Since Grover’s algorithm was first introduced, it has become a category of quantum algorithms that can be applied to many problems through the exploitation of quantum parallelism. The original application was the uns... Since Grover’s algorithm was first introduced, it has become a category of quantum algorithms that can be applied to many problems through the exploitation of quantum parallelism. The original application was the unstructured search problems with the time complexity of O(). In Grover’s algorithm, the key is Oracle and Amplitude Amplification. In this paper, our purpose is to show through examples that, in general, the time complexity of the Oracle Phase is O(N), not O(1). As a result, the time complexity of Grover’s algorithm is O(N), not O(). As a secondary purpose, we also attempt to restore the time complexity of Grover’s algorithm to its original form, O(), by introducing an O(1) parallel algorithm for unstructured search without repeated items, which will work for most cases. In the worst-case scenarios where the number of repeated items is O(N), the time complexity of the Oracle Phase is still O(N) even after additional preprocessing. 展开更多
关键词 Quantum Computing Oracle Amplitude Amplification Grover’s Algorithm
暂未订购 下载PDF
Quantum Circuit Implementation and Resource Evaluation of Ballet‑p/k Under Grover’s Attack 认领 引用
11
作者 HONG Rui-Peng ZHANG Lei +3 位作者 PANG Chen-Xu LI Guo-Yuan DING Ding WANG Jian-Xin 《密码学报（中英文）》 CSCD 北大核心 2025年第5期1178-1194,共17页
The advent of Grover’s algorithm presents a significant threat to classical block cipher security,spurring research into post-quantum secure cipher design.This study engineers quantum circuit implementations for thre... The advent of Grover’s algorithm presents a significant threat to classical block cipher security,spurring research into post-quantum secure cipher design.This study engineers quantum circuit implementations for three versions of the Ballet family block ciphers.The Ballet‑p/k includes a modular-addition operation uncommon in lightweight block ciphers.Quantum ripple-carry adder is implemented for both“32+32”and“64+64”scale to support this operation.Subsequently,qubits,quantum gates count,and quantum circuit depth of three versions of Ballet algorithm are systematically evaluated under quantum computing model,and key recovery attack circuits are constructed based on Grover’s algorithm against each version.The comprehensive analysis shows:Ballet-128/128 fails to NIST Level 1 security,while when the resource accounting is restricted to the Clifford gates and T gates set for the Ballet-128/256 and Ballet-256/256 quantum circuits,the design attains Level 3. 展开更多
关键词 Grover’s algorithm quantum circuit Ballet family block ciphers quantum ripple-carry adder
暂未订购 下载PDF
Grover’s Algorithm in a 4-Qubit Search Space 认领 引用 被引量：1
12
作者 Saasha Joshi Deepti Gupta 《Journal of Quantum Computing》 2021年第4期137-150,共14页
This paper provides an introduction to a quantum search algorithm,known as Grover’s Algorithm,for unsorted search purposes.The algorithm is implemented in a search space of 4 qubits using the Python-based Qiskit SDK ... This paper provides an introduction to a quantum search algorithm,known as Grover’s Algorithm,for unsorted search purposes.The algorithm is implemented in a search space of 4 qubits using the Python-based Qiskit SDK by IBM.While providing detailed proof,the computational complexity of the algorithm is generalized to n qubits.The implementation results obtained from the IBM QASM Simulator and IBMQ Santiago quantum backend are analyzed and compared.Finally,the paper discusses the challenges faced in implementation and real-life applications of the algorithm hitherto.Overall,the implementation and analysis depict the advantages of this quantum search algorithm over its classical counterparts. 展开更多
关键词 Grover’s algorithm unsorted search Oracle amplitude amplification quantum computing
暂未订购 下载PDF
O(logN) Algorithm for Amplitude Amplification and O(logN) Algorithms for Amplitude Transfer in Grover’s Algorithm 认领 引用
13
作者 Ying Liu 《American Journal of Computational Mathematics》 2024年第2期169-188,共20页
Grovers algorithm is a category of quantum algorithms that can be applied to many problems through the exploitation of quantum parallelism. The Amplitude Amplification in Grovers algorithm is T = O(N). This paper intr... Grovers algorithm is a category of quantum algorithms that can be applied to many problems through the exploitation of quantum parallelism. The Amplitude Amplification in Grovers algorithm is T = O(N). This paper introduces two new algorithms for Amplitude Amplification in Grovers algorithm with a time complexity of T = O(logN), aiming to improve efficiency in quantum computing. The difference between Grovers algorithm and our first algorithm is that the Amplitude Amplification ratio in Grovers algorithm is an arithmetic series and ours, a geometric one. Because our Amplitude Amplification ratios converge much faster, the time complexity is improved significantly. In our second algorithm, we introduced a new concept, Amplitude Transfer where the marked state is transferred to a new set of qubits such that the new qubit state is an eigenstate of measurable variables. When the new qubit quantum state is measured, with high probability, the correct solution will be obtained. 展开更多
关键词 Quantum Computing Oracle Amplitude Amplification Grover’s Algorithm
暂未订购 下载PDF
任意初始态下Grover搜索算法的相干性演化研究 认领 引用
14
作者 陈祯羽 王晓辉 邵倩倩 《科学技术创新》 2025年第12期30-34,共5页
本文使用两种相干度量研究量子相干资源在任意初始态下Grover搜索算法中的作用。在不同初始态下,基于相对熵测度的相干性(Cr)和基于l1测度的相干性(C_(l1))影响算法性能,这说明相干性是Grover搜索算法的重要资源。
关键词 Grover搜索算法 初始态 量子相干性
暂未订购 下载PDF
三类非平衡广义Feistel结构的量子中间相遇攻击 认领 引用
15
作者 杜小妮 吴家辉 +1 位作者 徐莹 孙瑞 《软件学报》 EI CSCD 北大核心 2026年第5期2257-2273,共17页
研究3类非平衡广义Feistel结构的中间相遇攻击,并在Q1模型下对这3类结构进行量子中间相遇攻击.首先,采用多重集和差分枚举技术对3分支Type-III型广义Feistel结构构建4轮中间相遇区分器,分别向前向后扩展1轮进行6轮中间相遇攻击,并利用Gr... 研究3类非平衡广义Feistel结构的中间相遇攻击,并在Q1模型下对这3类结构进行量子中间相遇攻击.首先,采用多重集和差分枚举技术对3分支Type-III型广义Feistel结构构建4轮中间相遇区分器,分别向前向后扩展1轮进行6轮中间相遇攻击,并利用Grover算法和量子爪搜索算法对该结构进行6轮量子密钥恢复攻击,该攻击所需的时间复杂度为O(23ℓ/2·ℓ)次量子查询,其中ℓ为广义Feistel结构的分支长度.其次,对3分支Type-I型广义Feistel结构的9轮区分器分别向前向后扩展1轮进行11轮中间相遇攻击及量子密钥恢复攻击,相应的时间复杂度分别为O(22ℓ)次11轮加密和O(23ℓ/2·ℓ)次量子查询.最后,以3-cell型广义Feistel结构为例探讨了n-cell型广义Feistel结构的量子中间相遇过程,对n-cell型广义Feistel结构构建2n轮中间相遇区分器,并进行2(n+1)轮中间相遇攻击及量子密钥恢复攻击,且时间复杂度分别为O(22ℓ)次2(n+1)轮加密和O(23ℓ/2·ℓ)次量子查询.结果表明,相比于经典环境,Q1模型下消耗的时间复杂度更低. 展开更多
关键词 广义Feistel结构 量子中间相遇攻击 Q1模型 量子爪搜索算法 Grover算法
暂未订购 下载PDF
Grover算法改进与应用综述 认领 引用 被引量：6
16
作者 刘晓楠 宋慧超 +2 位作者 王洪 江舵 安家乐 《计算机科学》 CSCD 北大核心 2021年第10期315-323,共9页
量子信息科学是一门新兴的交叉学科,它在信息领域中有着独特的性能,在提高运算速度、确保信息安全、增大信息容量和提高检测精度等方面可突破现有经典信息系统的极限。Grover算法是一类典型的量子算法,能够对任意经典暴力穷举搜索问题... 量子信息科学是一门新兴的交叉学科,它在信息领域中有着独特的性能,在提高运算速度、确保信息安全、增大信息容量和提高检测精度等方面可突破现有经典信息系统的极限。Grover算法是一类典型的量子算法,能够对任意经典暴力穷举搜索问题实现二次加速,进一步推动了量子计算的发展,如何有效地改进和应用Grover算法成为量子计算的一个重要研究领域。文中综述了Grover算法的优化改进和应用,对Grover算法在不同领域应用及不同方面的改进进行了概述,并对Grover算法未来的改进和相关应用的若干研究方向进行了探讨。 展开更多
关键词 Grover算法 量子计算 相位改进 密钥搜索 数据挖掘
暂未订购 下载PDF
多目标精确量子搜索算法的优化及实现 认领 引用
17
作者 钟仕锦 赵英楠 +1 位作者 代广珍 吴道华 《安徽大学学报（自然科学版）》 CAS 北大核心 2026年第3期43-52,共10页
利用量子旋转门构造了一种新的迭代算子——优化迭代算子,提出了一种优化的多目标精确搜索算法,并在量子计算平台MindQuantum上对优化后的多目标搜索算法进行模拟实验.结果显示,相较于Grover算法和龙算法,优化后的多目标搜索算法在保持1... 利用量子旋转门构造了一种新的迭代算子——优化迭代算子,提出了一种优化的多目标精确搜索算法,并在量子计算平台MindQuantum上对优化后的多目标搜索算法进行模拟实验.结果显示,相较于Grover算法和龙算法,优化后的多目标搜索算法在保持100%搜索成功率的同时,量子门的数量减少了35.4%,线路深度降低了17.8%.另外,通过引入去极化信道,还讨论了优化算法的抗噪声能力.结果表明,在相同噪声环境下,优化算法的搜索成功率始终高于Grover算法和龙算法,具有更好的抗噪声能力. 展开更多
关键词 量子计算 量子模拟 Grover算法 多目标搜索算法 抗噪声能力
暂未订购 下载PDF
基于Grover搜索算法的整数分解 认领 引用 被引量：4
18
作者 宋慧超 刘晓楠 +2 位作者 王洪 尹美娟 江舵 《计算机科学》 CSCD 北大核心 2021年第4期20-25,共6页
非结构化搜索是计算机科学中最基本的问题之一,而Grover量子搜索算法就是针对非结构化搜索问题设计的。Grover量子搜索算法可用于解决图着色、最短路径排序等问题,也可以有效破译密码系统。文中提出基于Grover搜索算法并结合经典预处理... 非结构化搜索是计算机科学中最基本的问题之一,而Grover量子搜索算法就是针对非结构化搜索问题设计的。Grover量子搜索算法可用于解决图着色、最短路径排序等问题,也可以有效破译密码系统。文中提出基于Grover搜索算法并结合经典预处理实现整数分解。首先基于IBMQ云平台对不同量子比特的Grover算法量子电路进行了仿真,以及模拟使用Grover算法求解N的素因子P和Q;然后将化简后的方程转化为布尔逻辑关系,以此来构建Grover算法中的Oracle;最后通过改变迭代次数来改变搜索到解的概率。仿真结果验证了使用Grover算法求解素因子P和Q的可行性。文中实现了在搜索空间为16且一次G迭代条件下以近78%的成功概率搜索到目标项。文中还比较了Grover算法与Shor算法在求解一些数字时所耗费的量子比特数和时间渐近复杂度的差异。通过Grover量子搜索算法分解整数的实验拓展了该算法的应用领域,Grover算法的加速效果在大型搜索问题中尤为明显。 展开更多
关键词 Grover算法 VQF算法 IBMQ 整数分解 Shor算法
暂未订购 下载PDF
基于Grover算法的ECC扫描式攻击 认领 引用 被引量：15
19
作者 陈宇航 贾徽徽 +1 位作者 姜丽莹 王潮 《信息网络安全》 2016年第2期28-32,共5页
相对于传统的RSA等公钥密码,ECC具有密钥长度短,计算复杂度高等特点,因此针对ECC加密体制的攻击复杂度高、难度大。研究针对ECC公钥密码的攻击方法有利于提前完善和防止不必要的损失。Grover算法作为一种量子搜索算法,将搜索步数从经典... 相对于传统的RSA等公钥密码,ECC具有密钥长度短,计算复杂度高等特点,因此针对ECC加密体制的攻击复杂度高、难度大。研究针对ECC公钥密码的攻击方法有利于提前完善和防止不必要的损失。Grover算法作为一种量子搜索算法,将搜索步数从经典算法的N缩小到N1/2,实现了对经典搜索算法的二次方加速作用,能更快速地寻找所需的解。扫描式攻击作为一种新生的侧信道攻击技术,它的出现给当前密码系统的安全性带来了极大的威胁。文章利用量子Grover搜索算法的快速搜索优点,对Rynuta提出的针对ECC密码芯片的扫描式攻击进行了改进,提出了基于Grover算法的ECC扫描式攻击方法。该算法对于密钥长度为N的ECC,计算复杂度由2~N降低到2N3/2,进一步提高了破解效率。由于Grover搜索算法的确定性,该算法的攻击成功率为100%。 展开更多
关键词 ECC扫描式攻击 Grover算法 椭圆曲线密码 侧信道攻击 计算复杂度
暂未订购 下载PDF
基于Grover融合理论的无线传感网络路由算法研究 认领 引用 被引量：4
20
作者 丁伟杰 周凯 +1 位作者 周国民 王勋 《传感技术学报》 CAS CSCD 北大核心 2016年第9期1425-1429,共5页
如何在各种网络资源受限制的情况,实现高质量的信息传输是无线传感网络研究领域的关键问题之一。首先,分析了网络传输中所需要考虑的受限制因素,并提出各种因素的计算办法;然后,针对确保服务质量的多目标规划算法存在计算量过大的缺陷,... 如何在各种网络资源受限制的情况,实现高质量的信息传输是无线传感网络研究领域的关键问题之一。首先,分析了网络传输中所需要考虑的受限制因素,并提出各种因素的计算办法;然后,针对确保服务质量的多目标规划算法存在计算量过大的缺陷,借鉴量子搜索算法中的Grover理论用以降低信息传输过程的搜索计算量;最后,通过Grover理论得到的各种资源路由选择方案,本文采用了计算机控制中的D-S信息融合理论,将多目标规划转化为单目标规划。为了验证本文所提出的Grover融合路由算法,文章建立MATLAB仿真环境,对比传统的DSR路由协议与多目标规划TOPSIS算法,可见本文所提出的算法在降低网络搜索计算量、延长网络生存时间、降低网络时延方面具有较大的改善。 展开更多
关键词 路由协议 多目标规划 Grover算法 数据融合 TOPSIS
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 6 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈