期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到169篇文章
< 1 2 … 9 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Asymmetrical Quantum Encryption Protocol Based on Quantum Search Algorithm 认领 引用 被引量：3
1
作者 LUO Wenjun LIU Guanli 《China Communications》 SCIE CSCD 2014年第9期104-111,共8页
Quantum cryptography and quantum search algorithm are considered as two important research topics in quantum information science.An asymmetrical quantum encryption protocol based on the properties of quantum one-way f... Quantum cryptography and quantum search algorithm are considered as two important research topics in quantum information science.An asymmetrical quantum encryption protocol based on the properties of quantum one-way function and quantum search algorithm is proposed.Depending on the no-cloning theorem and trapdoor one-way functions of the publickey,the eavesdropper cannot extract any private-information from the public-keys and the ciphertext.Introducing key-generation randomized logarithm to improve security of our proposed protocol,i.e.,one privatekey corresponds to an exponential number of public-keys.Using unitary operations and the single photon measurement,secret messages can be directly sent from the sender to the receiver.The security of the proposed protocol is proved that it is informationtheoretically secure.Furthermore,compared the symmetrical Quantum key distribution,the proposed protocol is not only efficient to reduce additional communication,but also easier to carry out in practice,because no entangled photons and complex operations are required. 展开更多
关键词 quantum cryptography asymmetrical encryption information-theoreticalsecurity quantum search algorithms
暂未订购 下载PDF
Transitionless driving on local adiabatic quantum search algorithm 认领 引用
2
作者 李风光 鲍皖苏 +4 位作者 张硕 汪翔 黄合良 李坦 马博文 《Chinese Physics B》 SCIE EI CAS CSCD 2018年第1期284-288,共5页
We apply the transitionless driving on the local adiabatic quantum search algorithm to speed up the adiabatic process. By studying quantum dynamics of the adiabatic search algorithm with the equivalent two-level syste... We apply the transitionless driving on the local adiabatic quantum search algorithm to speed up the adiabatic process. By studying quantum dynamics of the adiabatic search algorithm with the equivalent two-level system, we derive the transi- tionless driving Hamiltonian for the local adiabatic quantum search algorithm. We found that when adding a transitionless quantum driving term Ht~ （t） on the local adiabatic quantum search algorithm, the success rate is 1 exactly with arbitrary evolution time by solving the time-dependent Schr6dinger equation in eigen-picture. Moreover, we show the reason for the drastic decrease of the evolution time is that the driving Hamiltonian increases the lowest eigenvalues to a maximum of 展开更多
关键词 transitionless driving local adiabatic quantum search algorithm
暂未订购 下载PDF
Quantum search algorithm for continuous domains 认领 引用
3
作者 Lvzhou Li 《Science China(Physics,Mechanics & Astronomy)》 SCIE EI CSCD 2025年第6期211-211,共1页
The paper“Fixed-point quantum continuous search algorithm with optimal query complexity”[1]presents another interesting application of quantum search algorithms by addressing one of the long-standing challenges in q... The paper“Fixed-point quantum continuous search algorithm with optimal query complexity”[1]presents another interesting application of quantum search algorithms by addressing one of the long-standing challenges in quantum computing:how to efficiently perform search over continuous domains.While Grover’s algorithm has been a cornerstone in discrete quantum search with its well-known quadratic speedup[2],many real-world problems—ranging from high-dimensional optimization to spectral analysis of infinite dimensional operators—require searching over continuous,uncountably infinite solution spaces. 展开更多
关键词 spectral analysis infinite dimensi quadratic speedup many discrete quantum search quantum computing how search continuous domainswhile quantum search algorithms fixed point quantum continuous search algorithm quantum search algorithm
暂未订购 下载PDF
Optimized quantum random-walk search algorithm for multi-solution search 认领 引用 被引量：4
4
作者 张宇超 鲍皖苏 +1 位作者 汪翔 付向群 《Chinese Physics B》 SCIE EI CAS CSCD 2015年第11期133-139,共7页
This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the se... This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q. For a given q, we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value. 展开更多
关键词 quantum search algorithm quantum random walk multi-solution abstract search algorithm
暂未订购 下载PDF
General Quantum Meet-in-the-Middle Search Algorithm Based on Target Solution of Fixed Weight 认领 引用 被引量：2
5
作者 Xiang-Qun Fu Wan-Su Bao +1 位作者 Xiang Wang Jian-Hong Shi 《Communications in Theoretical Physics》 SCIE CAS CSCD 2016年第10期401-406,共6页
Similar to the classical meet-in-the-middle algorithm,the storage and computation complexity are the key factors that decide the efficiency of the quantum meet-in-the-middle algorithm.Aiming at the target vector of fi... Similar to the classical meet-in-the-middle algorithm,the storage and computation complexity are the key factors that decide the efficiency of the quantum meet-in-the-middle algorithm.Aiming at the target vector of fixed weight,based on the quantum meet-in-the-middle algorithm,the algorithm for searching all n-product vectors with the same weight is presented,whose complexity is better than the exhaustive search algorithm.And the algorithm can reduce the storage complexity of the quantum meet-in-the-middle search algorithm.Then based on the algorithm and the knapsack vector of the Chor-Rivest public-key crypto of fixed weight d,we present a general quantum meet-in-th√e-middle search algorithm based on the target solution of fixed weight,whose computational complexity is∑(d to j=0)(O((1/2)(Cd-jn-k+1)+O(C^j_klog C^j_k))with∑(d to i=0)C^i_k memory cost.And the optimal value of k is given.Compared to thequantum meet-in-the-middle search algorithm for knapsack problem and the quantum algorithm for searching a target solution of fixed weight,the computational complexity of the algorithm is lower.And its storage complexity is smaller than the quantum meet-in-the-middle-algorithm. 展开更多
关键词 quantum search algorithm meet-in-the-middle public-key crypto knapsack problem
暂未订购 下载PDF
First experimental demonstration of an exact quantum search algorithm in nuclear magnetic resonance system 认领 引用 被引量：5
6
作者 LIU Yang ZHANG FeiHao 《Science China(Physics,Mechanics & Astronomy)》 SCIE EI CAS CSCD 2015年第7期11-16,共6页
The success probability of searching an objective item from an unsorted database using standard Grover's algorithm is usually not exactly 1. It is exactly 1 only when it is used to find the target state from a dat... The success probability of searching an objective item from an unsorted database using standard Grover's algorithm is usually not exactly 1. It is exactly 1 only when it is used to find the target state from a database with four items. Exact search is always important in theoretical and practical applications. The failure rate of Grover's algorithm becomes big when the database is small, and this hinders the use of the commonly used divide-and-verify strategy. Even for large database, the failure rate becomes considerably large when there are many marked items. This has put a serious limitation on the usability of the Grover's algorithm. An important improved version of the Grover's algorithm, also known as the improved Grover algorithm, solves this problem. The improved Grover algorithm searches arbitrary number of target states from an unsorted database with full success rate. Here, we give the first experimental realization of the improved Grover algorithm, which finds a marked state with certainty, in a nuclear magnetic resonance system. The optimal control theory is used to obtain an optimized control sequence. The experimental results agree well with the theoretical predictions. 展开更多
关键词 quantum search algorithm improved Grover algorithm nuclear magnetic resonance success rate
暂未订购 下载PDF
Experimental implementation of a fixed-point duality quantum search algorithm in the nuclear magnetic resonance quantum system 认领 引用 被引量：5
7
作者 HAO Lianga LONG GuiLu 《Science China(Physics,Mechanics & Astronomy)》 SCIE EI CAS 2011年第5期936-941,共6页
In this work, we demonstrated a fixed-point quantum search algorithm in the nuclear magnetic resonance (NMR) system. We constructed the pulse sequences for the pivotal operations in the quantum search protocol. The ex... In this work, we demonstrated a fixed-point quantum search algorithm in the nuclear magnetic resonance (NMR) system. We constructed the pulse sequences for the pivotal operations in the quantum search protocol. The experimental results agree well with the theoretical predictions. The generalization of the scheme to the arbitrary number of qubits has also been given. 展开更多
关键词 quantum search algorithm fixed-point search algorithm duality quantum computing the N1 algorithm NMR realization
暂未订购 下载PDF
Effects of systematic phase errors on optimized quantum random-walk search algorithm 认领 引用 被引量：1
8
作者 张宇超 鲍皖苏 +1 位作者 汪翔 付向群 《Chinese Physics B》 SCIE EI CAS CSCD 2015年第6期155-163,共9页
This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this ... This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this algorithm, a model of the algorithm with phase errors is established, and the relationship between the success rate of the algorithm, the database size, the number of iterations, and the phase error is determined. For a given database size, we obtain both the maximum success rate of the algorithm and the required number of iterations when phase errors are present in the algorithm. Analyses and numerical simulations show that the optimized quantum random-walk search algorithm is more robust against phase errors than Grover＇s algorithm. 展开更多
关键词 quantum search algorithm quantum random walk phase errors robustness
暂未订购 下载PDF
Decoherence in optimized quantum random-walk search algorithm 认领 引用 被引量：1
9
作者 张宇超 鲍皖苏 +1 位作者 汪翔 付向群 《Chinese Physics B》 SCIE EI CAS CSCD 2015年第8期197-202,共6页
This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the opt... This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the optimized quantum random-walk search algorithm with decoherence is depicted through defining the shift operator which includes the possibility of broken links. For a given database size, we obtain the maximum success rate of the algorithm and the required number of iterations through numerical simulations and analysis when the algorithm is in the presence of decoherence. Then the computational complexity of the algorithm with decoherence is obtained. The results show that the ultimate effect of broken-link-type decoherence on the optimized quantum random-walk search algorithm is negative. 展开更多
关键词 quantum search algorithm quantum random walk decoherence
暂未订购 下载PDF
QUANTUM COLLISION SEARCH ALGORITHM AGAINST NEW FORK-256 认领 引用 被引量：1
10
作者 Du Fangwei Wang Hong Ma Zhi 《Journal of Electronics(China)》 2014年第4期366-370,共5页
In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on Grover's quantum search algorithm and birthday attack is proposed. In this algorithm, finding a collision for arbitrary... In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on Grover's quantum search algorithm and birthday attack is proposed. In this algorithm, finding a collision for arbitrary hash function only needs O(2m/3) expected evaluations, where m is the size of hash space value. It is proved that the algorithm can obviously improve the attack efficiency for only needing O(2 74.7) expected evaluations, and this is more efficient than any known classical algorithm, and the consumed space of the algorithm equals the evaluation. 展开更多
关键词 Quantum computation Quantum collision Grover＇s search algorithm New FORK-256CLC number：TN918.1
暂未订购 下载PDF
A Parallel Quantum Algorithm for the Satisfiability Problem 认领 引用 被引量：2
11
作者 LIU Wen-Zhang ZHANG Jing-Fu LONG Gui-Lu 《Communications in Theoretical Physics》 SCIE CAS 2008年第3期629-630,共2页
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 （... 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
暂未订购 下载PDF
Implementation of quantum search scheme by adiabatic passage in a cavity-laser-atom system 认领 引用
12
作者 刘文武 李洪才 杨榕灿 《Chinese Physics B》 SCIE EI CAS 2009年第1期23-29,共7页
This paper proposes a scheme for implementing the adiabatic quantum search algorithm of different marked items in an unsorted list of N items with atoms in a cavity driven by lasers. N identical three-level atoms are ... This paper proposes a scheme for implementing the adiabatic quantum search algorithm of different marked items in an unsorted list of N items with atoms in a cavity driven by lasers. N identical three-level atoms are trapped in a single-mode cavity. Each atom is driven by a set of three pulsed laser fields. In each atom, the same level represents a database entry. Two of the atoms are marked differently. The marked atom has an energy gap between its two ground states. The two different marked states can be sought out respectively starting from an initial entangled state by controlling the ratio of three pulse amplitudes. Moreover, the mechanism, based on adiabatic passage, constitutes a decoherence-free method in the sense that spontaneous emission and cavity damping are avoided since the dynamics follows the dark state. Furthermore, this paper extends the algorithm with m（m〉2） atoms marked in an ideal situation. Any different marked state can be sought out. 展开更多
关键词 adiabatic quantum search algorithm cavity-laser-atom system marked state
暂未订购 下载PDF
Fast quantum search driven by environmental engineering 认领 引用
13
作者 Rui Zhang Tian Chen 《Communications in Theoretical Physics》 SCIE CAS CSCD 2022年第4期31-41,共11页
Studies have demonstrated that a joined complete graph is a typical mathematical model that can support a fast quantum search. In this paper, we study the implementation of joined complete graphs in atomic systems and... Studies have demonstrated that a joined complete graph is a typical mathematical model that can support a fast quantum search. In this paper, we study the implementation of joined complete graphs in atomic systems and realize a quantum search of runtime ■ based on this implementation with a success probability of 50%. Even though the practical systems inevitably interact with the surrounding environment, we reveal that a successful quantum search can be realized through delicately engineering the environment itself. We consider that our study will bring about a feasible way to realize quantum information processing including quantum algorithms in reality. 展开更多
关键词 quantum walk quantum search algorithm environmental engineering non-Markovian
暂未订购 下载PDF
Quantum Algorithm for Mining Frequent Patterns for Association Rule Mining 认领 引用 被引量：1
14
作者 Abdirahman Alasow Marek Perkowski 《Journal of Quantum Information Science》 CAS 2023年第1期1-23,共23页
Maximum frequent pattern generation from a large database of transactions and items for association rule mining is an important research topic in data mining. Association rule mining aims to discover interesting corre... Maximum frequent pattern generation from a large database of transactions and items for association rule mining is an important research topic in data mining. Association rule mining aims to discover interesting correlations, frequent patterns, associations, or causal structures between items hidden in a large database. By exploiting quantum computing, we propose an efficient quantum search algorithm design to discover the maximum frequent patterns. We modified Grover’s search algorithm so that a subspace of arbitrary symmetric states is used instead of the whole search space. We presented a novel quantum oracle design that employs a quantum counter to count the maximum frequent items and a quantum comparator to check with a minimum support threshold. The proposed derived algorithm increases the rate of the correct solutions since the search is only in a subspace. Furthermore, our algorithm significantly scales and optimizes the required number of qubits in design, which directly reflected positively on the performance. Our proposed design can accommodate more transactions and items and still have a good performance with a small number of qubits. 展开更多
关键词 Data Mining Association Rule Mining Frequent Pattern Apriori Algorithm Quantum Counter Quantum Comparator Grover’s Search Algorithm
暂未订购 下载PDF
多策略量子麻雀搜索算法在NISQ量子比特映射中的应用 认领 引用
15
作者 刘述娟 韩雪娜 +2 位作者 李晖 王杰鹏 姬迎松 《计算机系统应用》 2026年第2期237-247,共11页
在噪声中等规模量子(noisy intermediate-scale quantum,NISQ)时代,由于硬件耦合约束,CNOT门往往无法直接执行,需要引入额外的SWAP门将逻辑量子比特映射至合适的物理位置,以确保电路的可执行性.为了减少传统量子比特映射过程中由于SWAP... 在噪声中等规模量子(noisy intermediate-scale quantum,NISQ)时代,由于硬件耦合约束,CNOT门往往无法直接执行,需要引入额外的SWAP门将逻辑量子比特映射至合适的物理位置,以确保电路的可执行性.为了减少传统量子比特映射过程中由于SWAP操作引起的额外开销,提出多策略量子麻雀搜索算法(multi-strategy quantum sparrow search algorithm,MQSSA),并应用于量子比特映射中.基于作用于同一量子比特对的非近邻(non-nearest neighbour,non-NN) CNOT门的个数,定义量子比特联动次数;结合CNOT门物理间距,定义联动量子门集;根据量子比特联动次数以及SWAP门数量构建适应度函数;同时将适应度最优的个体定义为发现者,通过引入量子叠加态机制,使发现者具备并行搜索能力,可以同时探索多个位置,扩大搜索空间.此外,为了避免陷入局部最优,MQSSA引入高斯噪声作为跟随者位置更新扰动机制,增强跳出局部最优能力;设置警戒者机制维持搜索多样性.实验结果表明,在t|ket)和Qiskit编译器中,MQSSA的SWAP门数量分别平均减少37.5%和46.6%,硬件开销分别平均减少13.3%和13.2%.这表明算法在量子比特映射中的表现更加高效,提升了优化结果质量. 展开更多
关键词 耦合约束 量子比特映射 多策略量子麻雀搜索算法 量子比特联动次数 联动量子门集 适应度函数 高斯噪声 扰动机制
暂未订购 下载PDF
多策略改进核搜索算法及其应用 认领 引用 被引量：1
16
作者 董如意 袁文康 《吉林大学学报（工学版）》 EI CAS CSCD 北大核心 2026年第5期1385-1398,共14页
针对核搜索算法(KSO)易陷入局部最优的不足,提出了一种多策略改进的核搜索算法(MSKSO)。首先,引入融合Tent混沌映射与量子计算的种群初始化策略,增强了种群的多样性和随机性;然后,提出了一种动态精英反向学习策略,进一步扩展种群的全局... 针对核搜索算法(KSO)易陷入局部最优的不足,提出了一种多策略改进的核搜索算法(MSKSO)。首先,引入融合Tent混沌映射与量子计算的种群初始化策略,增强了种群的多样性和随机性;然后,提出了一种动态精英反向学习策略,进一步扩展种群的全局搜索范围;最后,采用灰狼优化算法的搜索机制,增强了种群的局部寻优能力。通过使用CEC2017测试函数集,验证了MSKSO具有更优的寻优性能和鲁棒性,并将MSKSO应用于实际的经济排放调度问题中,进一步验证了该算法的有效性和鲁棒性。 展开更多
关键词 计算机应用 群智能优化 核搜索算法 混沌映射 量子计算 动态精英反向学习 灰狼算法 经济排放调度
基于Grover算法的高斯筛法量子线路设计方法 认领 引用
17
作者 曹仁龙 胡红钢 《信息网络安全》 CSCD 北大核心 2026年第2期224-235,共12页
筛法是求解格中最短向量问题的最快方法。在实际应用中,启发式筛法因其较低的时间复杂度和卓越的攻击效率,成为针对格密码算法的新型攻击手段。随着量子计算技术迅猛发展,量子算法的引入使量子筛法在理论上能够达到最优的渐近时间复杂度... 筛法是求解格中最短向量问题的最快方法。在实际应用中,启发式筛法因其较低的时间复杂度和卓越的攻击效率,成为针对格密码算法的新型攻击手段。随着量子计算技术迅猛发展,量子算法的引入使量子筛法在理论上能够达到最优的渐近时间复杂度,但目前针对量子筛法的电路设计研究仍处于初级阶段。因此,文章提出一种基于Grover量子搜索算法的高斯筛法量子线路设计方案,深入探讨高斯筛法中两个核心搜索过程的量子电路设计及其关键操作,并成功构建相应Oracle黑盒的量子线路。通过玩具示例验证该方案不仅能够在量子计算模型下正确执行,而且能有效降低高斯筛法的时间复杂度。 展开更多
关键词 高斯筛法 Grover量子搜索算法 量子线路 最短向量问题
暂未订购 下载PDF
多目标精确量子搜索算法的优化及实现 认领 引用
18
作者 钟仕锦 赵英楠 +1 位作者 代广珍 吴道华 《安徽大学学报（自然科学版）》 CAS 北大核心 2026年第3期43-52,共10页
利用量子旋转门构造了一种新的迭代算子——优化迭代算子,提出了一种优化的多目标精确搜索算法,并在量子计算平台MindQuantum上对优化后的多目标搜索算法进行模拟实验.结果显示,相较于Grover算法和龙算法,优化后的多目标搜索算法在保持1... 利用量子旋转门构造了一种新的迭代算子——优化迭代算子,提出了一种优化的多目标精确搜索算法,并在量子计算平台MindQuantum上对优化后的多目标搜索算法进行模拟实验.结果显示,相较于Grover算法和龙算法,优化后的多目标搜索算法在保持100%搜索成功率的同时,量子门的数量减少了35.4%,线路深度降低了17.8%.另外,通过引入去极化信道,还讨论了优化算法的抗噪声能力.结果表明,在相同噪声环境下,优化算法的搜索成功率始终高于Grover算法和龙算法,具有更好的抗噪声能力. 展开更多
关键词 量子计算 量子模拟 Grover算法 多目标搜索算法 抗噪声能力
暂未订购 下载PDF
基于量子粒子群优化算法的生成对抗网络优化 认领 引用
19
作者 钱楸 张兆娟 《微电子学与计算机》 2026年第3期1-13,共13页
针对传统生成对抗网络(Generative Adversarial Networks,GAN)架构及超参数的设计依赖专家经验、调优成本高昂的问题,提出了一种基于量子粒子群优化(Quantum-behaved Particle Swarm Optimization,QPSO)算法的GAN自动设计与优化方法。通... 针对传统生成对抗网络(Generative Adversarial Networks,GAN)架构及超参数的设计依赖专家经验、调优成本高昂的问题,提出了一种基于量子粒子群优化(Quantum-behaved Particle Swarm Optimization,QPSO)算法的GAN自动设计与优化方法。通过QPSO算法协同指导判别器与生成器的结构更新。设计了一种基于模块化搜索空间的混合操作编码方案,支持深度可分离卷积、降维全连接和稀疏全连接,并引入禁用机制以替代传统层禁用策略。生成器初始化阶段融合残差连接与注意力模块,以增强多尺度特征捕获能力。进一步构建了基于权重分配的多目标损失函数,联合优化对抗性损失、多样性损失和感知损失。在CIFAR-10和STL-10数据集上的实验结果表明:该方法在提升生成样本质量与多样性的同时,有效平衡了模型性能与计算复杂度。 展开更多
关键词 量子粒子群优化 生成对抗网络 进化算法 神经网络架构搜索
暂未订购 下载PDF
A quantum-search-based multi-classifier for image recognition 认领 引用
20
作者 Lu Liu Xingyu Wu +1 位作者 Lufan Zhang Chuan Wang 《Science China(Physics,Mechanics & Astronomy)》 SCIE EI CSCD 2025年第1期17-27,共11页
The multi-class classification of images is a pivotal challenge within the realm of image processing.As the volume of visual data continues to expand,there is a burgeoning interest in harnessing the unique capabilitie... The multi-class classification of images is a pivotal challenge within the realm of image processing.As the volume of visual data continues to expand,there is a burgeoning interest in harnessing the unique capabilities of quantum computation to augment the efficiency of classification tasks.However,many existing methods for training quantum image multi-classifiers parallel classical machine learning techniques,where the requisite circuit measurements increase linearly with the volume of training data.This work introduces a novel approach for training a quantum image multi-classifier based on the quantum search algorithm.We have meticulously conducted rigorous experiments on a handwritten digit dataset,a classic benchmark in the field.The results have been meticulously compared with previous works,and the comparative analysis not only validates the efficiency of our proposed approach,requiring only O(N/b)measurements during training,but also highlights a significant quadratic speedup of the algorithm. 展开更多
关键词 quantum computation image recognition quantum search algorithm
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 9 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈