共查询到20条相似文献,搜索用时 640 毫秒
1.
量子信息讲座读讲 第一讲 量子计算中的因子分解 总被引:2,自引:0,他引:2
因子分解对所有的现行计算机而言是难解的。这是现在通用的公共加密系统的基础。文章介绍了在量子计算机上的进行的Shor量子算法,即利用量子态的相干叠加和纠缠特性以及量子逻辑门实现量子计算的方法;并着重从理论原理和实验实现忱两方面说明利用余因子函数和离散傅里叶变换使这种量子算法对因子分解是有效的。 相似文献
2.
指向量子计算的约瑟夫森线路 总被引:1,自引:0,他引:1
在量子信息处理所涵盖的各分支领域中 ,尽管量子密钥分发的实验已经发展到了实际保密通信中可以利用的阶段 ,量子计算的真正实现仍是一个 10— 2 0年的远期目标 .已建成的核磁共振量子计算机 ,仅仅包括 7个量子位 (qubit) ,其体积却比真空管计算机还要大 .在这台计算机上 ,已经完成的“复杂”运算是 ,将合数 15分解为 3和 5两因子的乘积 .然而理论已经证明 :要想对一个十进制 6 0位数进行因子分解 ,用现行最快的电子计算机 (10 13 次 /s)需作 10 3 0 次运算 ,耗时10 17s(约等于宇宙年龄 ) .如若采用量子算法 ,在量子计算机(运算速度同样是 1… 相似文献
3.
核磁共振量子计算机与并行量子计算 总被引:1,自引:0,他引:1
在本文,我们首先回顾了量子计算的发展历史,阐述了核磁共振量子计算的原理.在叙述了利用有效纯态方法进行核磁共振量子计算之后,我们阐述了利用混合态进行核磁共振的量子计算的方法.首先是刘维尔量子计算方法,它是由Madi,Brushweiler,Ernst等人1998年提出的,在这一模式中,可以对搜索算法进行加速算法,Brushweilet。提出了一个指数速度的搜索算法.我们在3个比特的量子计算机中实现了这一搜索算法.我们在这一模式中提出了一个只需要一次搜索即可找标记物的直接拿取算法,并且在7个比特的核磁共振的量子计算机中实现了这一直接拿取算法.本文提出了在一个核磁共振量子计算机,或者更一般地一个系统量子计算机中实现多个量子计算机的并行计算.我们着重对量子搜索算法和Shor。的大数分解算法进行了并行实现.在并行量子计算中,一部分量子比特处在纯态,一部分量子比特处在混合态.如果所有的量子比特都处在纯态上,则就是有效纯态量子计算,如果所有的量子比特都处在混合态上,则就是刘维尔量子计算.在这两个极限中间,相当于2个到N/2个量子计算机的并行计算.量子搜索方法可以很有效地进行并行计算,而Shor算法则只能在小的范围内进行并行计算. 相似文献
4.
Shor算法能够借助量子计算机以多项式级别复杂度解决大整数因式分解问题,从而破解一系列安全性基于大整数因式分解的加密算法,例如Rivest-Shamir-Adleman加密算法、Diffie-Hellman密钥交换协议等.由于量子测量结果是概率性的,在运行量子线路时很容易受到噪声的干扰,这将导致无法测量得到预期结果.本文分别研究了不同通道的噪声对Shor算法的影响,分别是去极化通道、状态制备与测量通道以及热退相干通道.本文模拟在噪声环境中运行Shor算法并且给出了数值结果.数值结果表明Shor算法成功分解整数的概率易受到噪声影响,其中去极化通道中的噪声能够以指数形式影响Shor算法成功分解整数的概率,其次是热退相干通道噪声,最后是状态制备与测量通道噪声,能够线性影响到Shor算法成功分解的概率.本文能够为后续纠错、改进Shor算法以及确定工程实现Shor算法所需要的保真度等提供建设性意见. 相似文献
5.
6.
利用腔QED技术,我们在本文提出了两个物理方案用来实现最简单版本的Deutsch-Jozsa(D-J)量子算法.第一个方案是比较理想的方案,这个方案可以推广到多个量子比特输入的Deutsch-Jozsa量子算法.我们只需要通过实现控制-非门和一系列单个量子比特操作,就可以简单的实现该方案.我们在这个方案中详细地讨论了基于腔QED技术最简单版本的Deutsch-Jozsa量子算法的实现过程.另一个方案是不需要控制-非门的更简单的方案,但是这个方案仅仅适用于实现这种最简单版本的Deutsch-Jozsa量子算法,这个方案只需要实现单个量子比特操作即可.显然,该方案比第一个方案更简化.我们的这两个方案可能是实现量子计算机的一个重要环节. 相似文献
7.
8.
9.
绝热量子计算理论引介 总被引:2,自引:0,他引:2
本文引介绝热量子计算理论评述量子绝热定理最新的应用.基于量子绝热方法在最新的前沿领域量子计算中建立量子绝热算法.我们引介"局域量子绝热",并考虑了这一局域绝热概念对量子算法的可能应用. 相似文献
10.
11.
从两量子位核磁共振量子处理器物理模型出发,利用Raedt小组提出的自旋-1/2代数理论,根据量子控制非门的定义及Grover量子算法原理,介绍了量子控制非门的4种不同脉冲序列及两量子位Grover量子算法的两种不同脉冲序列的设计过程,通过数值求解含时薛定谔方程模拟量子控制非门和两量子位Grover量子算法,等价于执行量子控制非门和两量子位Grover量子算法运算,演示和分析量子控制非门及两量子位Grover量子算法核磁共振脉冲序列设计呈现的量子程序问题. 相似文献
12.
基于量子模距离的量子态聚类识别 总被引:5,自引:0,他引:5
针对量子系统的状态识别,定义了一种量子模距离作为量子态之间的相似性度量,提出了一种基于量子模距离的聚类算法,它既适用于对量子叠加态的识别,也适合对量子纠缠态的识别。在算法中,根据待识别的样本量子态求取聚类中心,分别计算各量子态到聚类中心的量子模距离,根据量子模距离对量子态进行聚类识别。算例说明了这种聚类识别方法的合理性和有效性。 相似文献
13.
在清华大学物理系成立60周年之际,我们对近年来清华大学物理系量子信息研究的主要进展情况作一介绍,包括量子搜索算法研究,核磁共振量子计算的实验研究,量子通讯的理论与实验研究.在量子搜索算法研究方面,我们提出了量子搜索算法的相位匹配,纠正了当时的一种错误观点,并且提出了一种成功率为100%的量子搜索算法,改进了Grover算法;在核磁共振量子计算实验方面,我们实现了2到7个量子比特的多种量子算法的实验演示;在量子通讯方面,我们提出了分布式传输的量子通讯的思想,应用于量子密钥分配、量子秘密共享、量子直接安全通讯等方面,构造了多个量子通讯的理论方案.在实验室,我们实现了2米距离的空间量子密码通讯的演示实验. 相似文献
14.
This paper presents a spatial domain quantum watermarking scheme. For a quantum watermarking scheme, a feasible quantum circuit is a key to achieve it. This paper gives a feasible quantum circuit for the presented scheme. In order to give the quantum circuit, a new quantum multi-control rotation gate, which can be achieved with quantum basic gates, is designed. With this quantum circuit, our scheme can arbitrarily control the embedding position of watermark images on carrier images with the aid of auxiliary qubits. Besides reversely acting the given quantum circuit, the paper gives another watermark extracting algorithm based on quantum measurements. Moreover, this paper also gives a new quantum image scrambling method and its quantum circuit. Differ from other quantum watermarking schemes, all given quantum circuits can be implemented with basic quantum gates. Moreover, the scheme is a spatial domain watermarking scheme, and is not based on any transform algorithm on quantum images. Meanwhile, it can make sure the watermark be secure even though the watermark has been found. With the given quantum circuit, this paper implements simulation experiments for the presented scheme. The experimental result shows that the scheme does well in the visual quality and the embedding capacity. 相似文献
15.
16.
We put forward an alternative quantum algorithm for finding Hamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a von Neumann measurement on the final state, one may determine whether there is a Hamiltonian cycle in the graph and pick out a cycle if there is any. Although the proposed algorithm provides a quadratic speedup, it gives an alternative algorithm based on adiabatic quantum computation, which is of interest because of its inherent robustness. 相似文献
17.
A realizable quantum encryption algorithm for qubits is presented by employing bit-wise quantum computation. System extension and bit-swapping are introduced into the encryption process, which makes the ciphertext space expanded greatly. The security of the proposed algorithm is analysed in detail and the schematic physical implementation is also provided. It is shown that the algorithm, which can prevent quantum attack strategy as well as classical attack strategy, is effective to protect qubits. Finally, we extend our algorithm to encrypt classical binary bits and quantum entanglements. 相似文献
18.
Michail Zak 《International Journal of Theoretical Physics》2003,42(9):2061-2068
A fast quantum algorithm for a search and pattern recognition in a Hilbert space memory structure is proposed. All the memory information is mapped onto a unitary operator acting upon a quantum state which represents a piece of information to be retrieved. As a result of only one quantum measurement, the address of the required information encoded in a number of the corresponding row of the unitary matrix is determined. By combining direct and dot products, the dimensionality of the memory space can be made exponentially large, using only linear resources. However, since the preprocessing, i.e., mapping the memory information into a Hilbert space can appear to be exponentially expensive, the proposed algorithm will be effective for NASA applications when the preprocessing is implemented on the ground, while the memory search is performed on remote objects. 相似文献
19.
Despite the rapid development of quantum research in recent years, there is very little research in computational geometry. In this paper, to achieve the convex hull of a point set in a quantum system, a quantum convex hull algorithm based on the quantum maximum or minimum searching algorithm (QUSSMA) is proposed. Firstly, the novel enhanced quantum representation of digital images is employed to represent a group of point set, and then the QUSSMA algorithm and vector operation are used to search the convex hull of the point set. In addition, the algorithm is simulated and compared with the classical algorithm. It is concluded that the quantum algorithm accelerates the classical algorithm when the ${M}_{p}$ value of the convex hull point is under a certain condition. 相似文献
20.
A scheme for implementing discrete quantum Fourier transform isproposed via quantum dots embedded in a microcavity, and then someof its applications are investigated, i.e., Deutsch-Jozsa algorithm and Shor's quantum factoring. In particular, the detailed process of implementing one-qubit Deutsch-Jozsa algorithm and the factorization of N=15 are given. The microcavity mode is only virtually excited in the whole interaction, so the effective decoherent has slight effect on the current scheme. These schemeswould be an important step to fabricate a solid quantum computer. 相似文献