arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.7256quant-ph
收藏

求解非结构问题的连续时间量子算法

Continuous-Time Quantum Algorithms for Unstructured Problems

Itay Hen

摘要:

我们考虑一个家庭的非结构化问题,我们提出了一种方法来构建模拟,连续时间量子算法,比他们的经典同行更有效。在这个家庭的问题,我们称之为“乱输出”的问题,一个必须找到一个给定的整数值的n位函数的输出值已被打乱在一些任意的方式的最小成本配置。这组问题的特殊情况是格罗弗的搜索问题,在非结构化数据库中找到一个有标记的项目,某些随机能量模型,以及Deutsch-Josza问题的功能。我们仔细考虑几个例子。首先,我们提供了一个确定性模拟量子算法来解决Deutsch和Josza的开创性问题,其中必须确定n位布尔函数是常数(在所有输入上为0或在所有输入上为1)还是平衡(在一半输入状态上返回0,在另一半输入状态上返回1)。我们还研究了随机能量模型的一个变体,并表明,正如人们所期望的那样,它的最小能量配置可以找到二次更快的量子绝热算法比经典算法。

英文摘要:

We consider a family of unstructured problems, for which we propose a method for constructing analog, continuous-time quantum algorithms that are more efficient than their classical counterparts. In this family of problems, which we refer to as `scrambled output' problems, one has to find a minimum-cost configuration of a given integer-valued n-bit function whose output values have been scrambled in some arbitrary way. Special cases within this set of problems are Grover's search problem of finding a marked item in an unstructured database, certain random energy models, and the functions of the Deutsch-Josza problem. We consider a couple of examples in detail. In the first, we provide a deterministic analog quantum algorithm to solve the seminal problem of Deutsch and Josza, in which one has to determine whether an n-bit boolean function is constant (gives 0 on all inputs or 1 on all inputs) or balanced (returns 0 on half the input states and 1 on the other half). We also study one variant of the random energy model, and show that, as one might expect, its minimum energy configuration can be found quadratically faster with a quantum adiabatic algorithm than with classical algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑