25 research outputs found

    Quaternionic Multilayer Perceptron with Local Analyticity

    No full text
    A multi-layered perceptron type neural network is presented and analyzed in this paper. All neuronal parameters such as input, output, action potential and connection weight are encoded by quaternions, which are a class of hypercomplex number system. Local analytic condition is imposed on the activation function in updating neurons’ states in order to construct learning algorithm for this network. An error back-propagation algorithm is introduced for modifying the connection weights of the network

    Monitoring particle trajectories for wave function parameter aquisition in quantum edge computation

    No full text
    Artificial intelligence(AI) technology expected as a robot brain is advancing day by day. However, computers are insufficient to drive AI without the dramatic development of their processing power. On the other hand, the development of quantum computers is progressing to break the barrier of classical computers. Moreover, there has been an argument that quantum mechanics is one of the leading ideas to explain human mental power and such an argument has become active recently. But unfortunately we cannot mount the quantum processor on the robot brain as its edge computer. This is because large-scale equipments that guarantee ultra-low temperature are required to maintain superposition, which is a key point of quantum computers. In this paper, we show a method of performing quantum computation with a classical mechanical device. We found that wave function parameters can be determined by monitoring particles trajectories under quantum fluctuations. We take up Deutsch's coin authenticity decision problem. We emphasize that it can be developed as hardware, not just an algorithm

    On Fault-Tolerant Fuzzy Controllers Based on Shifting Fuzzy Variables

    No full text

    Algorithm for operating an ordinary engineering system as a quantum bit

    No full text
    We show an algorithm for the previously proposed quantum computer using classical apparatuses. The target system is not limited to mass points but is a general engineering system that has a more manageable form in equipping terminal edge. After we define such system as “ordinary engineering system,” the method of quantum mechanical optimum feedback control of the nonlinear system is applied. The method makes an ordinary engineering system into a quantum one. As an example that is as stale as possible, a temperature control system is taken. Simulation studies show that our system works as a 1- qubit \mathsf {qubit} quantum computer without the special large-scale peripheral equipment required to maintain quantumness. The proposed system is a classic system that is everywhere, so it is easy for anyone to understand. Another advantage is that easy-to-use one-dimensional system can be applied

    Molecular implementations of cellular automata

    No full text
    Cellular Automata (CA) have a long history as computation models, but only in the last few years have serious attempts started to implement them in terms of molecules. Such nano-technological innovations promise very cost-effective fabrication because of the regular structure of CA, which allows assembly through molecular self-organization. The small sizes of molecules combined with their availability in Avogadro-scale numbers promises a huge computational power, in which the massive parallelism inherent in CA can be effectively exploited. This paper discusses critical background aspects of our recent results on the implementation of a CA by a molecular assembly (Bandyopadhyay et al., Nature Physics 2010)

    On molecular implementations of cellular automata

    No full text
    Molecular realizations of Cellular Automata that exhibit computational behavior have been the holy grail of nanocomputer architectures. This paper discusses a recently discovered molecular Cellular Automaton, and compares its features with those of conventional models. We find that the interaction rules in molecular Cellular Automata tend to be of a mixed variety, ranging from those with long-distance interactions to the more conventional direct-neighborhood type of rules. The probabilities according to which rules are applied in the molecular Cellular Automaton tend to be influenced by the patterns on the cellular space, resulting in much more volatile dynamics than in conventional models
    corecore