星图上的散射量子行走搜索算法

量子行走是一种典型的量子计算模型, 近年来开始受到量子计算理论研究者们的广泛关注. 本文首先证明了在星图上硬币量子行走与散射量子行走的酉等价关系, 之后提出了一个在星图上的散射量子行走搜索算法. 该算法的时间复杂度与Grover算法相同, 但是当搜索的目标数目多于总数的1/3时搜索成功概率大于Grover算法.     

一类状态非能控量子系统的开环控制

借用Grover搜索法给出了一类基态能控性(一般不是状态能控性的)的有限维量子系统实现不确定性状态控制的具体方案,并估计了实现状态控制的成功概率上界,讨论了实现该状态能控性的量子仿真.     

基于相位匹配的量子行走搜索算法及电路实现

量子行走是经典随机行走在量子力学框架下的对应, 理论上可以用来解决一类无序数据库的搜索问题. 因为携带信息的量子态的扩散速度与经典相比有二次方式的增长, 所以量子行走优于经典随机行走, 量子行走的特性值得加以利用. 量子行走作为一种新发现的物理现象的数学描述, 引发了一种新的思维方式, 孕育了一种新的理论计算模型. 最新研究表明, 量子行走本身也是一种通用计算模型, 可被视为设计量子算法的高级工具, 因此受到部分计算机理论科学领域学者的关注和研究. 对于多数问题求解方案的量子算法的设计, 理论上可以只在量子行走模型下进行考虑. 基于Grover算法的相位匹配条件, 本文提出了一个新的基于量子行走的搜索算法. 理论演算表明: 一般情况下本算法的时间复杂度与Grover算法相同, 但是当搜索的目标数目多于总数的1/3时, 本算法搜索成功的概率要大于Grover算法. 本文不但利用Grover算法中相位匹配条件构造了一个新的量子行走搜索算法, 而且在本研究室原有的量子电路设计研究成果的基础上给出了该算法的量子电路表述.     

核磁共振量子计算机与并行量子计算(续完)

3　刘维尔量子计算中的指数加快的搜索算法———Bruschweiler算法3 .1　Bruschweiler算法[4 5]与Grover搜索算法一样 ,Bruschweiler算法也是在无序数据库中寻找目标态 .对于搜寻问题可以总结为 :对于输入态x ,除了当x=z时 ,f(z) =1,其余的 f(x) =0 .z是我们要寻找的目标 .在经典计算机中 ,大概要O(N)步 ;用Grover算法大概要O(N )步 ;用Bruschweiler算法大概仅需要O(n)步 .其中 ,N =2 n.Bruschweiler利用NMR是自旋系综的特点 ,将初始态制备成不同自旋态的线性叠加 ,使初始态处于完全混合态 ,当U变换作用其上时 ,不同的自旋态在做不同…     

基于散射量子行走的完全图上结构异常搜索算法

完全图K_N 上某个顶点连接到图G将破坏其对称性. 为加速定位这类结构异常, 基于散射量子行走模型设计搜索算法, 首先给出了算法酉算子的定义, 在此基础上利用完全图的对称性, 将算法的搜索空间限定为一个低维的坍缩图空间. 以G为一个顶点的情况为例, 利用硬币量子行走模型上的研究结论简化了坍缩图空间中酉算子的计算, 并借助矩阵扰动理论分析算法演化过程. 针对星图S_N 上结构异常的研究表明, 以星图中心节点为界将整个图分为左右两个部分, 当且仅当两部分在N→∞时具有相同的特征值, 搜索算法可以获得量子加速. 本文说明星图上的分析方法和结论可以推广至完全图的坍缩图上. 基于此, 本文证明无论完全图连接的图G结构如何, 搜索算法均可在O(√N) 时间内定位到目标顶点, 成功概率为1-O(1√N), 即量子行走搜索该类异常与经典搜索相比有二次加速.     

基于Hardy定理的轨道角动量混合态量子非局域关联检验

由于轨道角动量纠缠态从理论上可构成一个无限维的量子纠缠态,因此基于其进行的量子非局域关联检验研究,对验证量子力学理论的正确性具有重要的意义。然而,在实验制备量子态过程中,受环境噪声等的影响,制备的轨道角动量纠缠态通常为混合态。本文就从阐述基于Hardy定理的、可适用于轨道角动量混合态的量子非局域关联检验逻辑出发,从理论上分别进行了一阶和二阶阶梯数的类Werner轨道角动量混合态的量子非局域关联检验研究。理论分析表明,在一阶和二阶的情况下,当混合程度分别满足Tr(ρ~2) 0.786和Tr(ρ~2) 0.651时,轨道角动量混合态可成功地进行量子非局域关联的检验研究。另外,本文的研究结果也表明,使用二阶梯子的Hardy定理,成功进行量子非局域关联的检验范围较一阶梯子将有显著的增加。     

级联环境中两比特纠缠态的量子非局域关联检验研究

量子纠缠态经级联环境中演化的量子非局域关联检验研究具有重要的现实意义。基于Hardy-type佯谬检验方案，本文分别以两比特量子纯态和混合态为研究对象，研究了其在级联环境中演化后的量子非局域关联检验情况。分析了纠缠态和腔的耦合强度、腔和库的耦合强度比值κ/γ以及马尔科夫环境和非马尔科夫环境对量子非局域关联检验的影响情况。结果表明，在马尔科夫环境中，且κ/γ越小，成功进行量子非局域关联检验的演化时间越长。进一步给出了量子混合态能够成功进行量子非局域关联检验的混合度参数m的范围，并给出了量子混合态经级联环境演化后，可成功进行量子非局域关联检验的演化时间范围。     

含有多目标的量子部分搜索——目标被非平均分配在两块中

Grover搜索是一种量子搜索方法,利用了量子叠加态的性质,通过一些操作的反复作用,而使目标态的几率幅变大,非目标态的几率幅变小,从而以较大的概率找到目标.与经典搜索方法相比,能够较快地从一个数据库中找到目标元.这是一种搜索到目标的全部信息的方法,但是在有些情况下,我们并不需要知道目标的全部信息,而只需要知道目标的部分信息,因而只需要找到含有目标的一部分数据库中的元素,这就是部分搜索.Grover和Radhakrishnan提出了一种部分搜索方法,称为Grover-Radhakrishnan Algorithm of Partial Search(GRK),所考虑的数据库只含有一个目标.在我们的文章中,我们研究了在含有多目标的数据库,且目标被随机分配在两块中时,GRK所需要的查询次数会有怎么样的变化.得到查询次数s和所分块数K、目标数t的关系.并且与平均分配的情况进行比较.     

双模最小关联混合态作为量子信道实现量子隐形传态的保真度

基于Braunstein和Kimble提出的B-K方案以双模最小关联混合态作为量子信道实施对未知量子态的隐形传送，并以传送相干态为例进行了研究.结果表明：双模最小关联混合态作为一种广义的Einstein-Podolsky-Rosen型纠缠态在实现量子隐形传态中能很好地担当量子信道的角色，在纠缠度和压缩度选择适当的条件下被传送未知量子态的保真度可以达到1.这是比双模压缩真空态更优越的量子信道. 关键词： 量子隐形传态 双模最小关联混合态 保真度     

C2(×)Cn量子系统的最大纠缠混合态

讨论了C2(×)Cn量子系统的最大纠缠混合态,得到了Negativity纠缠度下的最大纠缠混合态的解析结果,并计算了该态在非满秩情形下的量子相对熵纠缠度.     

An Exact Quantum Search Algorithm with Arbitrary Database

In standard Grover’s algorithm for quantum searching, the probability of finding a marked state is not exactly 1, and some modified versions of Grover’s algorithm that search a marked state from an evenly distributed database with full successful rate have been presented. In this article, we present a generalized quantum search algorithm that searches M marked states from an arbitrary distributed N-item quantum database with a zero theoretical failure rate, where N is not necessary to be the power of 2. We analyze the general properties of our search algorithm, we find that our algorithm has periodicity with a period of 2J + 1, and it is effective with certainty for J + (2J + 1)m times of iteration, where m is an arbitrary nonnegative number.     

Entropy of a needle in a haystack

In a quantum search algorithm, the initial state which is a linear superposition of all possible basis states is a separable state. At each iteration, the state becomes more and more entangled until eventually it disentangles and reverts to a separable state consisting of the marked state. It is therefore interesting to study how entanglement changes in a Grover search algorithm.     

Adiabatic quantum search scheme with atoms in a cavity driven by lasers

We propose an implementation of the quantum search algorithm of a marked item in an unsorted list of N items by adiabatic passage in a cavity-laser-atom system. We use an ensemble of N identical three-level atoms trapped in a single-mode cavity and driven by two lasers. In each atom, the same level represents a database entry. One of the atoms is marked by having an energy gap between its two ground states. Appropriate time delays between the two laser pulses allow one to populate the marked state starting from an initial entangled state within a decoherence-free adiabatic subspace. The time to achieve such a process is shown to exhibit the square root N Grover speedup.     

Noise effect on Grover algorithm

The decoherence effect on Grover algorithm has been studied numerically through a noise modelled by a depolarizing channel. Two types of error are introduced characterizing the qubit time evolution and gate application, so the noise is directly related to the quantum network construction. The numerical simulation concludes an exponential damping law for the successive probability of the maxima as time increases. We have obtained an allowed-error law for the algorithm: the error threshold for the allowed noise behaves as ε_th(N) ∼1/N^1.1 (N being the size of the data set). As the power of N is almost one, we consider the Grover algorithm as robust to a certain extent against decoherence. This law also provides an absolute threshold: if the free evolution error is greater than 0.043, Grover algorithm does not work for any number of qubits affected by the present error model. The improvement in the probability of success, in the case of two qubits has been illustrated by using a fault-tolerant encoding of the initial state by means of the [[7,1,3]] quantum code.     

加权量子搜索算法及其相位匹配条件研究

目前的Grover算法在无序数据库中搜索多个目标时,得到不同目标的几率是相等的,不考虑各个目标重要程度的差异;并且当目标数超过数据库记录总数的四分之一时,搜索到目标的几率迅速下降,当目标数超过记录总数的一半时,算法失效.针对这两个问题,首先提出一种基于加权目标的搜索算法.根据各子目标的重要程度,为每个子目标赋予一个权系数,应用这些权系数将多个子目标表示成一个量子叠加态,这样可使得到每个子目标的几率等于其自身的权系数;其次,提出自适应相位匹配条件,该条件中两次相位旋转的方向相反,大小根据目标量子叠加态和系统初始状态的内积决定.当该内积大于等于((3-√5)/8)^1/2时,至多只需两步搜索,即可以恒等于1的几率得到搜索目标.实验表明,算法及其相位匹配条件是有效的.     

Implementation of a many-qubit Grover search by cavity QED

We explore the possibility of an N-qubit (N>3) Grover search in cavity QED, based on a fast operation of an N-qubit controlled phase-flip with atoms in resonance with the cavity mode. We demonstrate both analytically and numerically that our scheme can be achieved efficiently to find a marked state with high fidelity and high success probability. As an example, a ten-qubit Grover search is simulated specifically under the discussion of experimental feasibility and challenge. We argue that our scheme is applicable to the case involving an arbitrary number of qubits. As cavity decay is involved in our quantum trajectory treatment, we can analytically understand the implementation of a Grover search subject to dissipation, which will be very helpful for relevant experiments.     

Grover量子搜索算法及改进

简单地介绍了量子搜索算法中的相位匹配条件、 改进的成功率为100%的量子搜索算法和量子搜索算法中的主要误差等. We briefly introduced some of our recent work related to the phase matching condition in quantum searching algorithms and the improved Grover algorithm. When one replaces the two phase inversions in the Grover algorithm with arbitrary phase rotations, the modified algorithm usually fails in searching the marked state unless a phase matching condition is satisfied between the two phases. The Grover algorithm is not 100% in success rate, an improved Grover algorithm with zero failure rate is given by replacing the phase inversions with angles that depends on the size of the database. Other aspects of the Grover algorithm such as the SO(3) picture of quantum searching, the dominant gate imperfections in the Grover algorithm are also mentioned.     

First experimental demonstration of an exact quantum search algorithm in nuclear magnetic resonance system

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.