Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
We review our models of quantum associative memories that represent the “quantization” of fully coupled neural networks like the Hopfield model. The idea is to replace the classical irreversible attractor dynamics driven by an Ising model with pattern-dependent weights by the reversible rotation of an input quantum state onto an output quantum state consisting of a linear superpo- sition with probability amplitudes peaked on the stored pattern closest to the input in Hamming distance, resulting in a high probability of measuring a memory pattern very similar to the input. The unitary operator implementing this transformation can be formulated as a sequence of one- qubit and two-qubit elementary quantum gates and is thus the exponential of an ordered quantum Ising model with sequential operations and with pattern-dependent interactions, exactly as in the classical case. Probabilistic quantum memories, that make use of postselection of the measurement result of control qubits, overcom...
Information Sciences, 2000
Quantum computation uses microscopic quantum level effects to perform computational tasks and has produced results that in some cases are exponentially faster than their classical counterparts. The unique characteristics of quantum theory may also be used to create a quantum associative memory with a capacity exponential in the number of neurons. This paper combines two quantum computational algorithms to produce a quantum associative memory. The result is an exponential increase in the capacity of the memory when compared to traditional associative memories such as the Hopfield network. The paper covers necessary high-level quantum mechanical ideas and introduces a quantum associative memory, a small version of which should be physically realizable in the near future.
In the neural network theory content-addressable memories are defined by patterns that are attractors of the dynamical rule of the system. This paper develops a quantum neural network starting from a classical neural network Hamiltonian and using a Schr'Odinger-like equation. It then shows that such a system exhibits probabilistic memory storage characteristics analogous to those of the dynamical attractors of classical systems.
We present a quantum neural network with multi-neuron interactions for pattern recognition tasks by a combination of extended classic Hopfield network and adiabatic quantum computation. This scheme can be used as an associative memory to retrieve partial patterns with any number of unknown bits. Also, we propose a preprocessing approach to classifying the pattern space S to suppress spurious patterns. The results of pattern clustering show that for pattern association, the number of weights (η) should equal the numbers of unknown bits in the input pattern (d). It is also remarkable that associative memory function depends on the location of unknown bits apart from the d and load parameter α.
This study concerns with the dynamics of a quantum neural network unit in the context of simple neural computing tasks. More specifically, we examine an interacting spin model chosen as a quantum percerpton and examine its dynamics as closed and open quantum systems. We adopt a collisional model enables examining both Markovian and non-Markovian dynamics of the proposed quantum system. We show that our quantum perceptron model has a stable output quantum state in contact with a dissipative quantum information environment. We perform numerical simulations to the proposed system and compare the dynamics in the presence and absence of quantum memory effects. With our findings we conclude that our quantum perceptron model is suitable for implementing general neural computing tasks when immersed in a Markovian information environment and quantum memory effects are not desirable since they cause complications on the stability of the output state.
Engineering Applications of Artificial Intelligence, 2007
We study a quantum neural network with superposed qubits replacing classical neurons with deterministic states, and also with quantum gate operators in place of the classical action potentials observed in biological contexts. With our choice of logic gates interconnecting the neural lattice, we find that the state of the system behaves in ways reflecting both the strength of coupling between neurons as well as the initial conditions, and depending on whether there is a threshold for emission from excited to ground state, the system shows either chaotic oscillations or coherent ones with periodicity that depends on the strength of coupling in a unique way. The spatial pattern of the initial input affects the subsequent dynamic behavior of the system in an interesting unambiguous way, which indicates that it can serve as a dynamic memory system analogous to biological ones, but with an unlimited lifetime.
Quantum computer science in combination with paradigms from computational neuroscience, specifically those from the field of artificial neural networks, seems to be promising for providing an outlook on a possible future of artificial intelligence. Within this elaboration, a quantum artificial neural network not only apportioning effects from quantum mechanics simulated on a von Neumann computer is proposed, but indeed for being processed on a quantum computer. Sooner or later quantum computers will replace classical von Neumann machines, which has been the motivation for this research. Although the proposed quantum artificial neural network is a classical feed forward one making use of quantum mechanical effects, it has, according to its novelty and otherness, been dedicated an own paper. Training such can only be simulated on von Neumann machines, which is pretty slow and not practically applicable (but nonetheless required for proofing the theorem), although the latter ones may be used to simulate an environment suitable for quantum computation. This is what has been realized during the SHOCID (Neukart, 2010) project for showing and proofing the advantages of quantum computers for processing artificial neural networks.
Information Sciences, 2000
We explore by simulation ways in which an array of quantum dot molecules could serve as a quantum neural computer. First, we show that a single quantum dot molecule evolving in real time can act as a recurrent temporal quantum neural network. Inputs are prepared by ®xing the initial states of a quantum dot molecule, and outputs determined by reading its value at a given time T later. The nodes of the network are the instantaneous states of the molecule at successive time slices. The nodes interact indirectly through their mutual interaction with local and phononic modes of the substrate. These modes can be preferentially excited optically, and, therefore, controlled externally. The number of excitations can thus be used as trainable``weight'' parameters for a neural network. This network is shown to perform classical logic gates. By preparing the input state as a superposition state, multiple inputs can be encoded as a single initial state. Second, we simulate the possibility of a spatial, rather than temporal, design, as a Hop®eld net. The network consists of a regular array of quantum dot molecules on a suitable substrate. The molecules interact indirectly as before, and, now, with each other directly through Coulombic interactions. Both of the quantum networks have none of the``wiring problems'' of traditional neural nets: the necessary connections are supplied by the physical system itself. Computation is performed by the intrinsic physics of the physical system. The long range character of the phononic interactions takes the net beyond traditional local connectionist structures. The hypothesized increase in
ACM Computing Surveys
In recent years, Quantum Computing witnessed massive improvements in terms of available resources and algorithms development. The ability to harness quantum phenomena to solve computational problems is a long-standing dream that has drawn the scientific community’s interest since the late 80s. In such a context, we propose our contribution. First, we introduce basic concepts related to quantum computations, and then we explain the core functionalities of technologies that implement the Gate Model and Adiabatic Quantum Computing paradigms. Finally, we gather, compare and analyze the current state-of-the-art concerning Quantum Perceptrons and Quantum Neural Networks implementations.
1997
Quantum computation uses microscopic quantum level effects to perform computational tasks and has produced results that in some cases are exponentially faster than their classical counterparts. Choosing the best weights for a neural network is a time consuming problem that makes the harnessing of this "quantum parallelism" appealing. This paper briefly covers necessary high-level quantum theory and introduces a model for a quantum neuron.
Fortschritte der Physik, 2016
The model of quantum associative memories proposed here is quietly similar to that of Rigui Zhou et al.
1998
Quantum computation uses microscopic quantum level effects to perform computational tasks and has produced results that in some cases are exponentially faster than their classical counterparts by taking advantage of quantum parallelism. The unique characteristics of quantum theory may also be used to create a quantum associative memory with a capacity exponential in the number of neurons. This paper covers necessary high-level quantum mechanical ideas and introduces a simple quantum associative memory. Further, it provides discussion, empirical results and directions for future work.
Physical Review Letters, 2006
Qubit networks with long-range interactions inspired by the Hebb rule can be used as quantum associative memories. Starting from a uniform superposition, the unitary evolution generated by these interactions drives the network through a quantum phase transition at a critical computation time, after which ferromagnetic order guarantees that a measurement retrieves the stored pattern. The maximum memory capacity of these qubit networks is reached at a memory density alpha=p/n=1.
On this paper, we briefly analyze and compare some models of quantum artificial neural networks. Quantum operators must be linear ones; we verify that no unitary operators are used in two models of quantum perceptron. We also analyze a model of quantum weightless neural network and a quantum complex neural network. These models have quantum architecture and learning, but we show that they use nonlinear operators in the learning process. This study, toward a comparative method, tries to clarify important aspects in models of quantum neural networks as well as understand more its operation.
The 2012 International Joint Conference on Neural Networks (IJCNN), 2012
As computers approach the physical limits of information storable in memory, new methods will be needed to further improve information storage and retrieval. We propose a quantum inspired vector based approach, which offers a contextually dependent mapping from the subsymbolic to the symbolic representations of information. If implemented computationally, this approach would provide exceptionally high density of information storage, without the traditionally required physical increase in storage capacity. The approach is inspired by the structure of human memory and incorporates elements of Gärdenfors' Conceptual Space approach and Humphreys et al.'s matrix model of memory. Kitto, K., Bruza, P., & Gabora, L. (2012). A quantum information retrieval approach to memory. Proc International Joint Conf on Neural Networks, (pp. 932-939). June 10-15, Brisbane, Australia, IEEE Computational Intelligence Soc.
Procedia Engineering, 2014
The advances that have been achieved in quantum computer science to date, slowly but steadily find their way into the field of artificial intelligence. Specifically the computational capacity given by quantum parallelism, resulting from the quantum linear superposition of quantum physical systems, as well as the entanglement of quantum bits seem to be promising for the implementation of quantum artificial neural networks. Within this elaboration, the required information processing from bit-level up to the computational neuroscience-level is explained in detail, based on the combined research in the fields of quantum physics and artificial neural systems.
In this paper we consider a Quantum computational algorithm that can be used to determine (probabilistically) how close a given signal is one of a set of previously observed signals stored in the state of a quantum neurocomputional machine. The realization of a new quantum algorithm for factorization of integers by Shor and its implication to cryptography has created a rapidly growing field of investigation. Although no physical realization of quantum computers is available, a number of softwar systems simulating a quantum computation process exist. In light of the rapidly increasing power of desktop computers and their ability to carry out these simulations, it is worthwhile to investigate possible advantages as well as realizations of quantum algorithms in signal processing applications. The algorithm presented in this paper offers a glimpse of the potentials of this approach. Neural Networks (NN) provide a natural paradigm for parallel and distributed processing of a wide class of signals. Neural Networks within the context of classical computation have been used for approximation and classification tasks with some success. In this paper we propose a model for Quantum Neurocomputation (QN) and explore some of its properties and potential applications to signal processing in an information-theoretic context. A Quantum Computer can evolve a coherent superposition of many possible input states, to an output state through a series of unitary transformations that simultaneously affect each element of the superposition. This construction generates a massively parallel data processing system existing within a single piece of hardware. Our model of QN consists of a set of Quantum Neurons and Quantum interconnections. Quantum neurons represent a normalized element of the n-dimensional Hilbert space -a state of a finite dimensional quantum mechanical system. Quantum connections provide a realization of probability distribution over the set of state that combined with the Quantum Neurons provide a densit matrix representation of the system. A second layer with a similar architecture interrogates the system through a series of random state descriptions to obtain an average state description. We discuss the application of this paradigm to the quantum analog of independent states using the quantum version of the Kullback-Leibler distance.
2012
A quantum learning machine for binary classification of qubit states that does not require quantum memory is introduced and shown to perform with the very same error rate as the optimal (programmable) discrimination machine for any size of the training set. At variance with the latter, this machine can be used an arbitrary number of times without retraining. Its required (classical) memory grows only logarithmically with the number of training qubits, while (asymptotically) its excess risk decreases as the inverse of this number, and twice as fast as the excess risk of an "estimate-and-discriminate" machine, which estimates the states of the training qubits and classifies the data qubit with a discrimination protocol tailored to the obtained estimates.
The emerging research area of a quantum-inspired computing has been applied to various¯eld such as computational intelligence, and showed its superior abilities. However, most existing researches are focused on theoretical simulations, and have not been implemented in systems under practical environment. For human-robot communication, associative memory becomes essential for multi-modal communication. However, it always su®ers from low memory capacity and recall reliability. In this paper, we propose a quantum-inspired bidirectional associative memory with fuzzy inference. We show that fuzzy inference satis¯es basic postulates of quantum mechanics, but also learning algorithm for weight matrix in associative memory. In addition, we construct a communication system with robot partner using proposed model. This is the¯rst successful attempt to overcome conventional problems in associative memory model with a robot application.
2008
This paper studies neural structures with weights that follow the model of the quantum harmonic oscillator. The proposed neural networks have stochastic weights which are calculated from the solution of Schrödinger's equation under the assumption of a parabolic (harmonic) potential. These weights correspond to diffusing particles, which interact with each other as the theory of Brownian motion (Wiener process) predicts. It is shown that conventional neural networks and learning algorithms based on error gradient can be conceived as a subset of the proposed quantum neural structures. The learning of the stochastic weights (convergence of the diffusing particles to an equilibrium) is analyzed. In the case of associative memories the proposed neural model results in an exponential increase of patterns storage capacity (number of attractors).
2021
In recent years, Quantum Computing witnessed massive improvements both in terms of resources availability and algorithms development. The ability to harness quantum phenomena to solve computational problems is a long-standing dream that has drawn the scientific community’s interest since the late ’80s. In such a context, we pose our contribution. First, we introduce basic concepts related to quantum computations, and then we explain the core functionalities of technologies that implement the Gate Model and Adiabatic Quantum Computing paradigms. Finally, we gather, compare and analyze the current state-of-the-art concerning Quantum Perceptrons and Quantum Neural Networks implementations.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.