激光混沌并联同步及其在全光逻辑门中的应用研究

提出多量子阱激光器混沌“主-从-响应”式结构同步系统,研究其并联同步在光学逻辑门中的应用. 利用一个注入多量子阱激光器混沌系统注入驱动实现了两个响应多量子阱激光系统的混沌并联同步,同时还获得了“主-从”式结构的混沌同步. 基于响应子系统的混沌并联同步思想,提出了全光逻辑门的基本理论模型并定义了计算原则与方法. 利用光的外部调制方法对两个驱动光进行调制与控制,让两个响应子系统实现同步与非同步,使系统获得了并具有全光逻辑门函数功能与特点,并成功地进行了数字逻辑计算. 具体提出了全光XNOR、NOR、NOT等逻辑门及逻辑计算方法,数值模拟结果证明了系统方案的可行性. 关键词： 混沌 同步 逻辑门 多量子激光器     

Synchronous implementation of optoelectronic NOR and XNOR logic gates using parallel synchronization of three chaotic lasers

The parallel synchronization of three chaotic lasers is used to emulate optoelectronic logic NOR and XNOR gates via modulating the light and the current. We deduce a logical computational equation that governs the chaotic synchronization, logical input, and logical output. We construct fundamental gates based on the three chaotic lasers and define the computational principle depending on the parallel synchronization. The logic gate can be implemented by appropriately synchronizing two chaotic lasers. The system shows practicability and flexibility because it can emulate synchronously an XNOR gate, two NOR gates, and so on. The synchronization can still be deteceted when mismatches exist with a certain range.     

激光混沌耦合反馈光电及全光逻辑门研究

理论上利用两个混沌半导体激光器的耦合反馈,构建了两种基本的光电及全光门.基本方法是,让外部光注入到两个激光器中而导致激光混沌,通过两激光器激光的相互耦合及反馈实现同步;在这基础上,一是让两激光器分别在电流调制下,控制混沌同步或者非同步,实现光电逻辑门的功能与计算;二是利用光的外部调制方法让两相互耦合激光分别在相位调制下,控制混沌同步或者非同步,并最终实现全光逻辑门的功能与计算.数值结果证明了两方法的可行性. 关键词： 混沌 逻辑门 激光器 同步     

Computing with distributed chaos

We describe and discuss in detail some recent results by Sinha and Ditto [Phys. Rev. Lett. 81, 2156 (1998)] demonstrating the capacity of a lattice of threshold coupled chaotic maps to perform computations. Such systems are shown to emulate logic gates, encode numbers, and perform specific arithmetic operations, such as addition and multiplication, as well as yield more specialized operations such as the calculation of the least common multiplier of a sequence of numbers. Furthermore, we extend the scheme to multidimensional continuous time dynamics, in particular to a system relevant to chaotic lasers.     

基于混沌计算的全加器实现

混沌计算是一种使用混沌单元实现基本逻辑门的新计算模式. 基于混沌计算的思想提出了实现全加器的新方法,通过设定不同的阀值及判断条件,使用一个混沌单元实现全加器. 与传统全加器的实现相比,降低了全加器结构上的复杂性,提供了实现上的灵活性. 最后,以Logistic映射为例给出了使用一个混沌单元实现全加器的方法. 关键词： 混沌 混沌计算 全加器     

Chaotic synchronization of two inverse-injection semiconductor lasers for logic gates

A round-coupling configuration of two inverse-injection semiconductor lasers is presented for logic gate applications. Two laser diodes coupled via injection from the opposite laser became chaotic. Chaotic synchronization is achieved between the two lasers. Two all-optical or two optoelectronic logic gates can be implemented by modulating the injected light or laser diode current, respectively, to synchronize or unsynchronize the two chaotic states. Numerical results show the validity and feasibility of the method.     

基于逻辑器件响应特性的自治布尔网络调控

自治布尔网络已成功应用于随机数产生、基因调控、储备池计算等领域.为了在应用中合理选择器件使输出更好地满足各应用的需求,本文研究了自治布尔网络中的逻辑器件响应特性变化时,自治布尔网络输出状态随之变化的规律,结果显示逻辑器件响应特性变化可以调控自治布尔网络输出在周期和混沌之间转变,且能改变自治布尔网络输出序列的复杂程度.进一步观察了逻辑器件响应特性和链路延时二维参数空间中输出序列复杂程度的分布,结果显示快的逻辑门响应特性可以增强高复杂序列在链路延时参数空间的分布范围.同时研究了自治布尔网络中任意逻辑器件的响应特性单独变化对网络输出状态的影响,结果显示不同节点的器件响应特性对序列复杂程度的调控能力有差异.研究表明,逻辑器件响应特性可以调控网络输出序列复杂程度,快的响应特性有利于高复杂混沌的稳定产生.     

Quantum corrections to the conductance of a square quantum dot with soft confinement

We study the conductance of a square quantum dot, modeling the potential with a self-consistent Thomas-Fermi approximation. The resulting potential is characterized by level statistics indicative of mixed chaotic and regular electron dynamics within the dot in spite of the regular geometry of the gates defining the dot. We calculate numerically, for the case of a quantum dot with soft confinement, the weak localization (WL) correction. We demonstrate that this confining potential may generate either Lorentzian or linear lineshapes depending on the number of modes in the leads. Finally, we present experimental WL data for a lithographically square dot and compare the results with numerical calculations. We analyze the experimental results and numerical simulations in terms of semiclassical and random matrix theory (RMT) predictions and discuss their limitations as far as real experimental structures are concerned. Our results indicate that direct application of the above predictions to distinguish between chaotic and regular dynamics in a particular cavity can not always lead to reliable conclusions as the shape and magnitude of the WL correction can be strongly sensitive to the geometry-specific, non-universal features of the system. Received 13 May 1998     

Photocurrent, rectification, and magnetic field symmetry of induced current through quantum dots

We report mesoscopic dc current generation in an open chaotic quantum dot with ac excitation applied to one of the shape-defining gates. For excitation frequencies large compared to the inverse dwell time of electrons in the dot (i.e., GHz), we find mesoscopic fluctuations of induced current that are fully asymmetric in the applied perpendicular magnetic field, as predicted by recent theory. Conductance, measured simultaneously, is found to be symmetric in field. In the adiabatic (i.e., MHz) regime, in contrast, the induced current is always symmetric in field, suggesting its origin is mesoscopic rectification.     

Controllable all-optical stochastic logic gates and their delay storages based on the cascaded VCSELs with optical-injection

Using the dynamical properties of the polarization bistability that depends on the detuning of the injected light,we propose a novel approach to implement reliable all-optical stochastic logic gates in the cascaded vertical cavity surface emitting lasers(VCSELs) with optical-injection.Here,two logic inputs are encoded in the detuning of the injected light from a tunable CW laser.The logic outputs are decoded from the two orthogonal polarization lights emitted from the optically injected VCSELs.For the same logic inputs,under electro-optic modulation,we perform various digital signal processing(NOT,AND,NAND,XOR,XNOR,OR,NOR) in the all-optical domain by controlling the logic operation of the applied electric field.Also we explore their delay storages by using the mechanism of the generalized chaotic synchronization.To quantify the reliabilities of these logic gates,we further demonstrate their success probabilities.     

Unconventional geometric quantum computation

We propose a new class of unconventional geometric gates involving nonzero dynamic phases, and elucidate that geometric quantum computation can be implemented by using these gates. Comparing with the conventional geometric gate operation, in which the dynamic phase shift must be removed or avoided, the gates proposed here may be operated more simply. We illustrate in detail that unconventional nontrivial two-qubit geometric gates with built-in fault-tolerant geometric features can be implemented in real physical systems.     

Embedding any desired number of coexisting attractors in memristive system

A simple variable-boostable system is selected as the structure for hosting an arbitrarily defined memristor for chaos producing. The derived three-dimensional (3-D) memristive chaotic system shows its distinct property of offset, amplitude and frequency control. Owing its merits any desired number of coexisting attractors are embedded by means of attractor doubling and self-reproducing based on function-oriented offset boosting. In this circumstance two classes of control gates are found:one determines the number of coexisting attractors resorting to the independent offset controller while the other is the initial condition selecting any one of them. Circuit simulation gives a consistent output with theoretically predicted embedded attractors.     

Distributed quantum computation via optical fibers

We investigate the possibility of realizing effective quantum gates between two atoms in distant cavities coupled by an optical fiber. We show that highly reliable swap and entangling gates are achievable. We exactly study the stability of these gates in the presence of imperfections in coupling strengths and interaction times and prove them to be robust. Moreover, we analyze the effect of spontaneous emission and losses and show that such gates are very promising in view of the high level of coherent control currently achievable in optical cavities.     

Superconducting gates with fluxon logics

We have developed several logic gates (OR, XOR, AND and NAND) made of superconducting Josephson junctions. The gates based of the flux cloning phenomenon and high speed of fluxons moving in Josephson junctions of different shapes. In a contrast with previous design the gates operates extremely fast since fluxons are moving with the speed close to the speed of light. We have demonstrated their operations and indicated several ways to made a more complicated logic elements which have at the same time a compact form.     

Lossy data compression with random gates

We introduce a new protocol for a lossy data compression algorithm which is based on constraint satisfaction gates. We show that the theoretical capacity of algorithms built from standard parity-check gates converges exponentially fast to the Shannon's bound when the number of variables seen by each gate increases. We then generalize this approach by introducing random gates. They have theoretical performances nearly as good as parity checks, but they offer the great advantage that the encoding can be done in linear time using the survey inspired decimation algorithm, a powerful algorithm for constraint satisfaction problems derived from statistical physics.     

Percolation, renormalization, and quantum computing with nondeterministic gates

We apply a notion of static renormalization to the preparation of entangled states for quantum computing, exploiting ideas from percolation theory. Such a strategy yields a novel way to cope with the randomness of nondeterministic quantum gates. This is most relevant in the context of optical architectures, where probabilistic gates are common, and cold atoms in optical lattices, where hole defects occur. We demonstrate how to efficiently construct cluster states without the need for rerouting, thereby avoiding a massive amount of conditional dynamics; we furthermore show that except for a single layer of gates during the preparation, all subsequent operations can be shifted to the final adapted single-qubit measurements. Remarkably, cluster state preparation is achieved using essentially the same scaling in resources as if deterministic gates were available.     

Scaling ion trap quantum computation through fast quantum gates

We propose a method to achieve scalable quantum computation based on fast quantum gates on an array of trapped ions, without the requirement of ion shuttling. Conditional quantum gates are obtained for any neighboring ions through spin-dependent acceleration of the ions from periodic photon kicks. The gates are shown to be robust to influence all the other ions in the array and insensitive to the ions' temperature.     

Efficient decomposition of quantum gates

Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit which is optimal in the sense of fully controlled single-qubit gates and yet is equivalent with the multiqubit gate. In the second step of the optimization, superfluous control bits are eliminated, which eventually results in a smaller total number of the elementary gates. In our scheme the number of controlled NOT gates is O(4(n)) which coincides with the theoretical lower bound.     

Nongeometric conditional phase shift via adiabatic evolution of dark eigenstates: a new approach to quantum computation

We propose a new approach to quantum phase gates via the adiabatic evolution. The conditional phase shift is neither of dynamical nor geometric origin. It arises from the adiabatic evolution of the dark state itself. Taking advantage of the adiabatic passage, this kind of quantum logic gates is robust against moderate fluctuations of experimental parameters. In comparison with the geometric phase gates, it is unnecessary to drive the system to undergo a desired cyclic evolution to obtain a desired solid angle. Thus, the procedure is simplified, and the fidelity may be further improved since the errors in obtaining the required solid angle are avoided. We illustrate such a kind of quantum logic gates in the ion trap system. The idea can also be realized in other systems, opening a new perspective for quantum information processing.     

Practical scheme for quantum computation with any two-qubit entangling gate

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.