The computing universe

In theoretical physics the concept of “field” is often applied to various phenomena in the space, normally represented by differential equations. In contrast to that, the theory of automata operates with discrete states. In this, the digitalization of procedures is an important aspect. Cellular automata allow the construction of “moving state structures” representing digital particles, which may be compared with the behavior of physical particles. The theory of automata further presupposes certain attitudes towards determination and causality. In close connection is the problem of the reversibility of time direction.     

Holographic quantum computing

We propose to use a single mesoscopic ensemble of trapped polar molecules for quantum computing. A "holographic quantum register" with hundreds of qubits is encoded in collective excitations with definite spatial phase variations. Each phase pattern is uniquely addressed by optical Raman processes with classical optical fields, while one- and two-qubit gates and qubit readout are accomplished by transferring the qubit states to a stripline microwave cavity field and a Cooper pair box where controllable two-level unitary dynamics and detection is governed by classical microwave fields.     

Conservative quantum computing

The Wigner-Araki-Yanase theorem shows that conservation laws limit the accuracy of measurement. Here, we generalize the argument to show that conservation laws limit the accuracy of quantum logic operations. A rigorous lower bound is obtained of the error probability of any physical realization of the controlled-NOT gate under the constraint that the computational basis is represented by a component of spin, and that physical implementations obey the angular momentum conservation law. The lower bound is shown to be inversely proportional to the number of ancilla qubits or the strength of the external control field.     

Complex grid computing

This article investigates the functional properties of complex networks used as grid computing systems. Complex networks following the Erdös-Rényi model and other models with a preferential attachment rule (with and without growth) or priority to the connection of isolated nodes are studied. Regular networks are also considered for comparison. The processing load of the parallel program executed on the grid is assigned to the nodes on demand, and the efficiency of the overall computation is quantified in terms of the parallel speedup. It is found that networks with preferential attachment allow lower computing efficiency than networks with uniform link attachment. At the same time, considering only node clusters of the same size, preferential attachment networks display better efficiencies. The regular networks, on the other hand, display a poor efficiency, due to their implied larger internode distances. A correlation is observed between the topological properties of the network, specially average cluster size, and their respective computing efficiency.     

Digital optical computing

The motivation for a digital optical computer is based on the shortcomings inherent in of electronic computers. Optics has solutions to offer especially in interconnects. Devices based on nonlinear optical effects are still in the early stages of their development. Hence at an intermediate stage hybrid opto-electronic computers might emerge. Their architectures should make use of the special attributes of optics. A specific approach called symbolic substitution logic is outlined.     

Single-electron computing without dissipation

The possibility of performing single-electron computing without dissipation in an array of tunnel-coupled quantum dots is studied theoretically, taking the spin gate NOT (inverter) as an example. It is shown that the logical operation can be implemented at the stage of unitary evolution of the electron subsystem, although complete switching of the inverter cannot be achieved in a reasonable time at realistic values of model parameters. The optimal input magnetic field is found as a function of the interdot tunneling energy and intradot Coulomb repulsion energy. Pis’ma Zh. éksp. Teor. Fiz. 66, No. 4, 275–279 (25 August 1997) Published in English in the original Russian journal. Edited by Steve Torstveit.     

Reversible and endoreversible computing

Reversible combinatorial computers are built from basic cells with a three-bit digital input and a three-bit digital output. Such a computer can calculate both from left to right and from right to left, such that input pins and output pins are indistinguishable. In order to perform a calculation in a specific direction, an electric field should be applied externally. The inevitably frictional losses occur in the lines supplying the computer with the input data and in the lines draining the calculation results to the output registers. Such behavior is analogous to the endoreversible operation of heat engines and other energy converters.     

科学计算应用程序探讨

科学计算应用程序是科学计算研究的成果集成,其研制不同于通常的计算机应用软件.随着科学计算研究的不断深入和高性能计算机的迅猛发展,应用程序越来越依赖于实际应用和高性能计算的交叉融合,迫切需要革新程序的研制思路,发展研制方法.文章简要介绍了科学计算应用程序的主要特征,分析了应用程序面临的主要困难,探讨了研制应用程序的新思路和新方法.     

Challenges in lattice Boltzmann computing

Some of the most urgent challenges facing the lattice Boltzmann equation (LBE) to rival state-of-the-art computer fluid dynamics (CFD) techniques are discussed. A novel LBE scheme fork- turbulence modeling is proposed.     

Algebraic computing in general relativity

The purpose of this paper is to bring to the attention of potential users the existence of algebraic computing systems, and to illustrate their use by reviewing a number of problems for which such a system has been successfully used in General Relativity. In addition, some remarks are included which may be of help in the future design of these systems.     

Discrete analog computing with rotor-routers

Rotor-routing is a procedure for routing tokens through a network that can implement certain kinds of computation. These computations are inherently asynchronous (the order in which tokens are routed makes no difference) and distributed (information is spread throughout the system). It is also possible to efficiently check that a computation has been carried out correctly in less time than the computation itself required, provided one has a certificate that can itself be computed by the rotor-router network. Rotor-router networks can be viewed as both discrete analogs of continuous linear systems and deterministic analogs of stochastic processes.     

Thermodynamic cost of reversible computing

Reversible computing requires preservation of all information throughout the entire computational process; this implies that all errors that appear as a result of the interaction of the information-carrying system with uncontrolled degrees of freedom must be corrected. But this can only be done at the expense of an increase in the entropy of the environment corresponding to the dissipation, in the form of heat, of the "noisy" part of the system's energy. This Letter gives an expression of that energy in terms of the effective noise temperature, and analyzes the relationship between the energy dissipation rate and the rate of computation. Finally, a generalized Clausius principle based on the concept of effective temperature is presented.     

Quantum computing with alkaline-Earth-metal atoms

We present a complete scheme for quantum information processing using the unique features of alkaline-earth-metal atoms. We show how two completely independent lattices can be formed for the 1S0 and 3P0 states, with one used as a storage lattice for qubits encoded on the nuclear spin, and the other as a transport lattice to move qubits and perform gate operations. We discuss how the 3P2 level can be used for addressing of individual qubits, and how collisional losses from metastable states can be used to perform gates via a lossy blockade mechanism.     

Universal resources for quantum computing

Unravelling the source of quantum computing power has been a major goal in the field of quantum information science. In recent years, the quantum resource theory(QRT) has been established to characterize various quantum resources, yet their roles in quantum computing tasks still require investigation. The so-called universal quantum computing model(UQCM),e.g. the circuit model, has been the main framework to guide the design of quantum algorithms,creation of real quantum computers etc. In this w...     

Optoelectronic memristor for neuromorphic computing

With the need of the internet of things,big data,and artificial intelligence,creating new computing architecture is greatly desired for handling data-intensive tasks.Human brain can simultaneously process and store information,which would reduce the power consumption while improve the efficiency of computing.Therefore,the development of brainlike intelligent device and the construction of brain-like computation are important breakthroughs in the field of artificial intelligence.Memristor,as the fourth fundamental circuit element,is an ideal synaptic simulator due to its integration of storage and processing characteristics,and very similar activities and the working mechanism to synapses among neurons which are the most numerous components of the brains.In particular,memristive synaptic devices with optoelectronic responding capability have the benefits of storing and processing transmitted optical signals with wide bandwidth,ultrafast data operation speed,low power consumption,and low cross-talk,which is important for building efficient brain-like computing networks.Herein,we review recent progresses in optoelectronic memristor for neuromorphic computing,including the optoelectronic memristive materials,working principles,applications,as well as the current challenges and the future development of the optoelectronic memristor.