共查询到19条相似文献,搜索用时 93 毫秒
1.
基于Hash表的量子可逆逻辑电路综合的快速算法 总被引:4,自引:1,他引:3
量子可逆逻辑电路是构建量子计算机的基本单元,通过量子门的级联与组合构成量子计算机,量子可逆逻辑电路的综合就是根据电路功能,以较小的量子代价自动构造量子可逆逻辑电路.结合可逆逻辑电路综合的多种算法,提出了一种新颖高效的量子电路综合算法,巧妙构造最小完备的Hash函数,可使用多种量子门,采用任意量子代价标准,以极高的效率生成最优的量子可逆逻辑电路.为实现量子电路综合的自动化,首次提出了利用量子线的置换自动构造各种量子门库的通用算法.采用国际同行认可的3变量可逆函数测试标准,该算法不仅能够生成全部最优电路.而且运行速度远远超过其他算法·实验结果表明,该算法按最小长度、最小代价标准综合电路的平均速度分别是目前最好结果的49.15倍、365.13倍. 相似文献
2.
基于位运算的量子可逆逻辑电路快速综合算法 总被引:1,自引:0,他引:1
量子可逆逻辑电路是构建量子计算机的基本单元.本文结合可逆逻辑电路综合的多种算法,根据可逆逻辑电路综合的本质是置换问题,巧妙应用位运算构造高效完备的Hash函数,提出了基于Hash表的新颖高效的量子可逆逻辑电路综合算法,可使用多种量子门,以极高的效率生成最优的量子可逆逻辑电路,从理论上实现制造量子电路的成本最低.按照国际同行认可的3变量可逆函数测试标准,该算法不仅能够生成全部最优电路,而且运行速度远远超过其它算法.实验结果表明,该算法按最小长度标准综合电路的平均速度是目前最好结果的69.8倍. 相似文献
3.
量子可逆逻辑电路综合的快速算法研究 总被引:4,自引:0,他引:4
可逆逻辑有许多应用,尤其在量子计算领域,量子可逆逻辑电路是构建量子计算机的基本单元,量子可逆逻辑电路综合就是根据电路功能,以较小的量子代价自动构造量子可逆逻辑电路.文中结合可逆逻辑电路综合的多种算法,提出了一种新颖高效的算法,自动构造正极性Reed-Muller展开式(RM),在生成量子可逆逻辑电路的解空间树上,采用总体层次遍历,局部深度搜索,借鉴模板优化技术,构造限界函数快速剪去无解或非最优解的分枝,优先探测RM中的因子,以极高的效率生成最优电路.以国际公认的3变量可逆函数测试标准,该算法不仅能够生成全部最优电路,而且运行速度远远超过同类算法. 相似文献
4.
5.
类选择排序的可逆逻辑综合算法 总被引:1,自引:0,他引:1
可逆逻辑综合是指对给定的可逆函数自动构造对应的可逆逻辑电路.由于搜索空间随电路规模增长成指数增长,现有的可逆逻辑综合算法虽然能够得到近似最优的解,但是都存在计算时间过长的问题.文中提出了一种类似选择排序的可逆逻辑综合算法,其实质为基于变换规则的合成法.它采用一个无向无权图表示所有可以进行变换的路径,在综合的过程中,采用选择排序思想每次从小到大的选择需要交换的输出项,然后从路径选择图中找到最优的路径进行变换,最终使得函数的输出序列有序即完成综合.此外,文中还对得到的量子电路进行了优化.实验表明,相比其它综合算法,该算法不仅总能获得最优解或近似最优解,而且效率高、易于实现. 相似文献
6.
7.
随着小波理论研究的深入,以及小波分析在信号分析和图像处理等领域的广泛应用,小波分析在量子计算领域中也越来越受到重视.应用置换矩阵、W-H变换矩阵和量子傅立叶变换矩阵来对Haar小波及D(4)小波变换矩阵进行分解,给出其算法,然后得出其完整的量子逻辑线路图,最后分析其复杂度. 相似文献
8.
研究量子可逆逻辑电路优化设计问题,提出一种量子可逆逻辑电路自动合成的方法.可使用“图”的结构来对量子可逆逻辑电路进行编码,并且专门设计了几种变异操作算子来直接修改“图”的结构,并实现了利用“图”编码的克隆选择,最终完成了量子可逆逻辑电路的自动合成.实验结果表明所提出的量子可逆逻辑电路自动合成的方法是可行的,具有较高的合成效率,能够以较快的收敛速度获取所需合成的量子可逆逻辑电路的的最优解. 相似文献
9.
多值逻辑量子置换门的酉矩阵表示 总被引:1,自引:0,他引:1
理论上量子可逆电路不存在能量耗散问题,因此量子计算系统对环境产生的负面影响可以达到最低.多值逻辑量子置换门是构建多值逻辑量子电路的基本单元.该文从数学的角度研究多值逻辑量子置换门的酉矩阵,提出了一种构造多值逻辑量子置换门酉矩阵的方法,并对其正确性进行了讨论.在此基础之上,又给出了构造混合多值逻辑量子置换门酉矩阵的框架,利用此框架可以方便地构造任何混合逻辑量子置换门的酉矩阵.酉矩阵是量子门的数学模型,可以清晰地反映出量子门的数学性质.研究量子门的酉矩阵对验证量子门的正确性和可靠性,分析量子状态在电路中的演化过程及发展趋势具有一定的意义. 相似文献
10.
11.
介绍了量子计算的最新研究方向,简述了量子计算和量子信息技术在保密通信、量子算法、数据库搜索等重要领域的应用。分析了量子计算机与经典计算机相比所具有的优点和目前制约量子计算机应用发展的主要因素,最后展望了其未来发展趋势。 相似文献
12.
The development of estimation and control theories for quantum systems is a fundamental task for practical quantum technology. This vision article presents a brief introduction to challenging problems and potential opportunities in the emerging areas of quantum estimation, control and learning. The topics cover quantum state estimation, quantum parameter identification, quantum filtering, quantum open-loop control, quantum feedback control, machine learning for estimation and control of quantum systems, and quantum machine learning. 相似文献
13.
The power of quantum computing technologies is based on the fundamentals of quantum mechanics, such as quantum superposition, quantum entanglement, or the no-cloning theorem. Since these phenomena have no classical analogue, similar results cannot be achieved within the framework of traditional computing. The experimental insights of quantum computing technologies have already been demonstrated, and several studies are in progress. Here we review the most recent results of quantum computation technology and address the open problems of the field. 相似文献
14.
Tetsuro Nishino 《New Generation Computing》2002,20(4):317-337
In this paper, we introduce two mathematical models of realistic quantum computation. First, we develop a theory of bulk quantum
computation such as NMR (Nuclear Magnetic Resonance) quantum computation. For this purpose, we define bulk quantum Turing
machine (BQTM for short) as a model of bulk quantum computation. Then, we define complexity classes EBQP, BBQP and ZBQP as
counterparts of the quantum complexity classes EQP, BQP and ZQP, respectively, and show that EBQP=EQP, BBQP=BQP and ZBQP=ZQP.
This implies that BQTMs are polynomially related to ordinary QTMs as long as they are used to solve decision problems. We
also show that these two types of QTMs are also polynomially related when they solve a function problem which has a unique
solution. Furthermore, we show that BQTMs can solve certain instances of NP-complete problems efficiently.
On the other hand, in the theory of quantum computation, only feed-forward quantum circuits are investigated, because a quantum
circuit represents a sequence of applications of time evolution operators. But, if a quantum computer is a physical device
where the gates are interactions controlled by a current computer such as laser pulses on trapped ions, NMR and most implementation
proposals, it is natural to describe quantum circuits as ones that have feedback loops if we want to visualize the total amount
of the necessary hardware. For this purpose, we introduce a quantum recurrent circuit model, which is a quantum circuit with
feedback loops. LetC be a quantum recurrent circuit which solves the satisfiability problem for a blackbox Boolean function includingn variables with probability at least 1/2. And lets be the size ofC (i.e. the number of the gates inC) andt be the number of iterations that is needed forC to solve the satisfiability problem. Then, we show that, for those quantum recurrent circuits, the minimum value ofmax(s, t) isO(n
22
n/3).
Tetsuro Nishino, D.Sc.: He is presently an Associate Professor in the Department of Information and Communication Engineering, The University of
Electro-Communications. He received the B.S., M.S. and D.Sc degrees in mathematics from Waseda University, in 1982, 1984 and
1991 respectively. From 1984 to 1987, he joined Tokyo Research Laboratory, IBM Japan. From 1987 to 1992, he was a Research
Associate of Tokyo Denki University, and from 1992 to 1994, he was an Associate Professor of Japan Advanced Institute of Science
and Technology, Hokuriku. His main interests are circuit complexity theory, computational learning theory and quantum complexity
theory. 相似文献
15.
Only a few classes of quantum algorithms are known which provide a speed-up over classical algorithms. However, these and
any new quantum algorithms provide important motivation for the development of quantum computers. In this article new quantum
algorithms are given which are based on quantum state tomography. These include an algorithm for the calculation of several
quantum mechanical expectation values and an algorithm for the determination of polynomial factors. These quantum algorithms
are important in their own right. However, it is remarkable that these quantum algorithms are immune to a large class of errors.
We describe these algorithms and provide conditions for immunity.
相似文献
16.
In this paper,the relationship between computation and physics and the application of the principle of Quantum mechanics to Quantum Computing and Quantum Computers was reviewed 相似文献
17.
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times, respectively. Non-unitary quantum walks can provide a useful optimisation of these properties, producing a more uniform distribution on the line, and faster mixing times on the cycle. We investigate the interplay between quantum and random dynamics by comparing the resources required, and examining numerically how the level of quantum correlations varies during the walk. We show numerically that the optimal non-unitary quantum walk proceeds such that the quantum correlations are nearly all removed at the point of the final measurement. This requires only O(logT) random bits for a quantum walk of T steps. 相似文献
18.
Wenshan Cui Yun Mao Ying Guo 《通讯和计算机》2006,3(5):46-49
Based on the interleaving technique, a kn-qubit code is constructed in this paper with more error-correcting ability than one n-qubit quantum error-correcting code without introducing the redundant qubits. By converting quantum bursts of errors into quantum random errors with the help of the quantum interleaving of the several states of the same quantum code, the proposed technique becomes an effective means to combat quantum bursts of errors. It is much simple and applicable for the quantum interleaving techniques to be used in the optical-fiber communications. 相似文献
19.
We give a tutorial exposition of the analogue of the filtering equation for quantum systems focusing on the quantum probabilistic framework and developing the ideas from the classical theory. Quantum covariances and conditional expectations on von Neumann algebras play an essential part in the presentation. 相似文献