Chen and Diao's quantum search algorithm is not exponentially fast
英文摘要：
This paper has been withdrawn due to the withdrawal of the related paper.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
A Quantum Search Algorithm for a Specified Number of Targets
The quantum search algorithm of Chen and Diao, which finds with certainty a single target item in an unsorted database, is modified so as to be capable of searching for an arbitrary specified number of target items. If the number of targets, nu_0, is a power of four, the new algorithm will with certainty find one of the targets in a database of n items using (1/2)(3(N/nu_0)^{log_base_4(3)}-1) \approx (1/2)(3(N/nu_0)^{0.7925}-1) oracle calls, where N is the smallest power of four greater than or equal to n. If nu_0 is not a power of four, the algorithm will, with a probability of at least one-h…
quant-ph
量子吉布斯态局部马尔可夫性的改进估计
Improved estimate of local Markovianity for quantum Gibbs states
University of Illinois Urbana-Champaign（伊利诺伊大学厄巴纳-香槟分校）
本文提出静态证明方法，改进量子吉布斯态在正温度下的局部马尔可夫性质，对有限程、指数及幂律相互作用分别建立指数、拉伸指数及代数衰减的CMI界，优于Chen和Rouzé的动态结果。
math-phmath.MPquant-ph
路径wise Lasso的量子算法
Quantum Algorithms for the Pathwise Lasso
Centre for Quantum Technologies, National University of Singapore（新加坡国立大学量子技术中心）；University of Latvia（拉脱维亚大学）；School of Physical and Mathematical Sciences, Nanyang Technological University（南洋理工大学物理与数学科学学院）；Department of Computer Science, National University of Singapore（新加坡国立大学计算机科学系）
我们提出了一种基于LARS路径算法的量子Lasso算法，利用量子最小值查找实现特征数和观测数上的二次加速，并证明其对误差具有鲁棒性，同时给出经典和量子算法的查询下界。
cs.LGmath.OCquant-ph
