量子遗传算法研究现状

Quantum Genetic Algorithm (QGA)is the combination of quantum computation and genetic algorithm. In this paper, actuality of research on QGA is summarized. QGA and Multi-universe Parallel Quantum Genetic Algorithm (MPQGA)are discussed in detail. Application progenies in respective regions are introduced. The subsequent research on QGA is also prospected.     

Message Authentication Scheme Based on Quantum Error-correction Codes

With the use of the theory of Quantum Error-correction Code （QECC）, a quantum message authentication scheme is proposed to defend several different kinds of attacks in this paper. The scheme can simultaneously distribute the sharing key and verify the identities of the communicators. Security analysis shows that the scheme is unconditional security.     

Editorial

This special issue is to honor professor Tzyh-Jong Tarn for his 80 birthday. Prof. Tarn is a world outstanding expert in Systems and Control Theory, Robotics and Quantum Control, etc. He received the D.Sc. degree in control system engineering from Washington University at St. Louis, Missouri, U.S.A. He is at present a Professor in the Department of Electrical Engineering and the Director of the Center for Robotics and Automation at Washington University. Dr. Tarn served as the President of the IEEE Robotics and Automation Society, the Director of IEEE Division X (Systems and Control), and a member of the IEEE Board of Directors. The Japan Foundation for the Promotion of Advanced Automation Technology presented him with the Best Research Article Award in March 1994. He also is a recipient of the Best Paper Award at the 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Prof. Tarn has also made significant contribution to enhance the academic exchange between Chinese scholars and world systems science and automation society. This special issues contains 10 papers covering 1) Robot Control; 2) Quantum Control; 3) System Identification; 4) Advanced linear/Nonlinear Control Technique; and 5) Multi-agent Systems. These fields are closely related to Prof. Tarn''s research interests. The papers are arranged according to their categories....     

Experimental realization of deterministic joint remote preparation of an arbitrary two-qubit pure state via GHZ states

<正>Quantum teleportation(QT) [1] enables secure transfer of an unknown quantum state between remote locations without physically transmitting the initial state. Unlike QT,with the sender possessing complete knowledge of the initial state, remote state preparation(RSP) [2] exhibits a tradeoff between the amount of the entanglement resource used and the classical communication cost.     

量子算法模拟系统研究现状

The Quantum Computer has immense power,exceeds the capabilities of a classical computer,but the hardware of such machine is still in research. If we want to develop quantum algorithms,wemust simulate them on classical computer. In this paper ,we first introduce the principle and model usedin quantum computing,and compare the simulators in tile world. At last ,based on the problems in simu-lation,we give a new architecture of quantum algorithm simulator.     

Editorial

Quantum technology is recognized as one of the most promising directions for our future technologies. By exploiting the unique features of quantum effects, emerging quantum technology is rapidly progressing around the world including quantum computation, quantum communication, quantum metrology and quantum simulation. The development of quantum control plays a grounding role in enabling the preservation and manipulation of quantum states that are used in various quantum technologies. This special issue will focus on new development in relevant topics of estimation and control methods in quantum systems, and provide a forum for idea exchange in this dynamic research area. Particularly, Ian R. Petersen, a key figure in the development of robust and quantum control theory, just turned 60 in the past year. We propose to celebrate this occasion with this special issue on quantum control, one of his main research focuses in the last fifteen years....     

Stable quantum filters with scattering phenomena

Quantum neural network filters for signal processing have received a lot of interest in the recent past. The implementations of these filters had a number of design parameters that led to numerical inefficiencies. At the same time the solution procedures employed were explicit in that the evolution of the time-varying functions had to be controlled. This often led to numerical instabilities. This paper outlines a procedure for improving the stability, numerical efficiency, and the accuracy of quantum neural network filters. Two examples are used to illustrate the principles employed.     

Some Issues in Quantum Information Theory

Quantum information theory is a new interdisciplinary research field related to quantum mechanics, computer science, information theory, and applied mathematics. It provides completely new paradigms to do information processing tasks by employing the principles of quantum mechanics. In this review, we first survey some of the significant advances in quantum information theory in the last twenty years. We then focus mainly on two special subjects： discrimination of quantum objects and transformations between entanglements. More specifically, we first discuss discrimination of quantum states and quantum apparatus in both global and local settings. Secondly, we present systematical characterizations and equivalence relations of several interesting entanglement transformation phenomena, namely entanglement catalysis, multiple-copy entanglement transformation, and partial entanglement recovery.     

A Novel Quantum - inspired Multi - Objective Evolutionary Algorithm Based on Cloud Theory

In the previous papers,Quantum-inspired multi-objective evolutionary algorithm(QMEA) was proved to be better than conventional genetic algorithms for multi-objective optimization problem.To improve the quality of the non-dominated set as well as the diversity of population in multi-objective problems,in this paper,a Novel Cloud -based quantum -inspired multi-objective evolutionary Algorithm(CQMEA) is proposed.CQMEA is proposed by employing the concept and principles of Cloud theory.The algorithm utilizes the random orientation and stability of the cloud model,uses a self-adaptive mechanism with cloud model of Quantum gates updating strategy to implement global search efficient.By using the self-adaptive mechanism and the better solution which is determined by the membership function uncertainly,Compared with several well-known algorithms such as NSGA-Ⅱ,QMEA.Experimental results show that(CQMEA) is more effective than QMEA and NSGA -Ⅱ.     

Combating Quantum Burst-errors with Quantum Interleaving Technique

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.     

量子纠缠和量子计算

量子纠缠是量子力学中的一种非经典现象。本文从介绍纠缠和纠缠态出发，着重讨论纠缠的本质和非定域性概念。文末还讨论了纠缠在量子计算中的作用：它是量子计算优于经典计算的重要原因之一。     

Quantum covariance and filtering

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.     

Classically-controlled Quantum Computation

It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-controlled Quantum Turing Machine (CQTM) which is a Turing machine with a quantum tape for acting on quantum data, and a classical transition function for a formalized classical control. In CQTM, unitary transformations and quantum measurements are allowed. We show that any classical Turing machine is simulated by a CQTM without loss of efficiency. Furthermore, we show that any k-tape CQTM is simulated by a 2-tape CQTM with a quadratic loss of efficiency. The gap between classical and quantum computations which was already pointed out in the framework of measurement-based quantum computation (see [S. Perdrix, Ph. Jorrand, Measurement-Based Quantum Turing Machines and their Universality, arXiv, quant-ph/0404146, 2004]) is confirmed in the general case of classically-controlled quantum computation. In order to appreciate the similarity between programming classical Turing machines and programming CQTM, some examples of CQTM will be given in the full version of the paper. Proofs of lemmas and theorems are omitted in this extended abstract.     

量子计算机的研究与应用

介绍了量子计算的最新研究方向,简述了量子计算和量子信息技术在保密通信、量子算法、数据库搜索等重要领域的应用。分析了量子计算机与经典计算机相比所具有的优点和目前制约量子计算机应用发展的主要因素,最后展望了其未来发展趋势。     

基于一维三态量子游走的量子聚类算法

量子游走具有与经典随机游走不同的特性,因此它已经被用来解决包括元素区分、组合优化、图同构等问题。考虑量子游走和聚类两个领域,提出了一个基于一维三态离散量子游走的聚类算法。在该算法中,将数据点看作游走粒子;然后,这些粒子执行三态量子游走,接着根据粒子的测量结果更新数据点的属性值;最后,属于同一簇的数据点将会聚集,而属于不同簇的数据点将会分离。仿真实验结果表明了所提算法的有效性。     

量子计算机进入实验阶段

首先简要介绍分层计算的制约;其次介绍最近量子信息的开发,在理论和实践两方面的通信和计算,诸如量子逻辑门、量子密码学、量子交缠性、超距传输的实验性实现、量子算法的首次实验性实现、量子因子分解、量子纪错码以及基于硅片的原子自旋量子计算机;最后讨论克服非相干性困难的方法。     

量子进程

由量子力学原理，酉变换和测量算子可以完成量子计算中的所有操作，但仅用酉变换和测量算子的序列并不能清楚地描述量子世界的并发与通信，因此本文提出了量子进程的概念，讨论量子进程通信的几种可能方式，并基于CCS建立了两个量子进程的一种互模拟关系，用以刻画传送量子进程的并发与通信。     

量子查找算法的发展与前瞻

量子查找算法是一种利用波的特性进行查找的新方法，它以量子位作为描述问题 的基本信息单位，为 NP-完全问题的解决提供了一种有效的途径。量子查找算法的主要特 点 是查找的高度并行性、非结构化查找和巨大的信息存储容量。该文介绍了量子查找的基 本思 想；综述了量子查找的典型实例及其广泛应用；分析了量子查找算法的特点及其与传 统算法 的关系；指出了量子计算目前存在的问题；最后对量子计算的发展前景进行展望。     

一种改进的混合量子遗传算法

提出了一种改进的混合量子遗传算法(IHQGA),该算法首先在量子个体上实施量子交叉,这一操作有利于保留相对较好的基因段;其次,采用量子比特相位法更新量子门和自适应调整搜索网格的策略;最后,引入拟Newton算法进行局部搜索操作,使得种群的多样性强,解得的收敛精度高,收敛速度快;通过复杂函数测试标明此算法的优化质量和效率都强于传统遗传算法和量子遗传算法;另外,从理论上也证明了该算法以概率l收敛于全局最优解.