From transistor to trapped-ion computers for quantum chemistry

Over the last few decades, quantum chemistry has progressed through the development of computational methods based on modern digital computers. However, these methods can hardly fulfill the exponentially-growing resource requirements when applied to large quantum systems. As pointed out by Feynman, this restriction is intrinsic to all computational models based on classical physics. Recently, the rapid advancement of trapped-ion technologies has opened new possibilities for quantum control and quantum simulations. Here, we present an efficient toolkit that exploits both the internal and motional degrees of freedom of trapped ions for solving problems in quantum chemistry, including molecular electronic structure, molecular dynamics, and vibronic coupling. We focus on applications that go beyond the capacity of classical computers, but may be realizable on state-of-the-art trapped-ion systems. These results allow us to envision a new paradigm of quantum chemistry that shifts from the current transistor to a near-future trapped-ion-based technology.

Embedding quantum simulators

79 p.

Energy demands of diverse spiking cells from the neocortex, hippocampus, and thalamus

It has long been known that neurons in the brain are not physiologically homogeneous. In response to current stimulus, they can fire several distinct patterns of action potentials that are associated with different physiological classes ranging from regular-spiking cells, fast-spiking cells, intrinsically bursting cells, and low-threshold cells. In this work we show that the high degree of variability in firing characteristics of action potentials among these cells is accompanied with a significant variability in the energy demands required to restore the concentration gradients after an action potential. The values of the metabolic energy were calculated for a wide range of cell temperatures and stimulus intensities following two different approaches. The first one is based on the amount of Na+ load crossing the membrane during a single action potential, while the second one focuses on the electrochemical energy functions deduced from the dynamics of the computational neuron models. The results show that the thalamocortical relay neuron is the most energy-efficient cell consuming between 7 and 18 nJ/cm(2) for each spike generated, while both the regular and fast spiking cells from somatosensory cortex and the intrinsically-bursting cell from a cat visual cortex are the least energy-efficient, and can consume up to 100 nJ/cm(2) per spike. The lowest values of these energy demands were achieved at higher temperatures and high external stimuli.

Algorithms for colour image processing based on neurological models

373 p. : il., gráf., fot., tablas

Efficient learning of decomposable models with a bounded clique size

The learning of probability distributions from data is a ubiquitous problem in the fields of Statistics and Artificial Intelligence. During the last decades several learning algorithms have been proposed to learn probability distributions based on decomposable models due to their advantageous theoretical properties. Some of these algorithms can be used to search for a maximum likelihood decomposable model with a given maximum clique size, k, which controls the complexity of the model. Unfortunately, the problem of learning a maximum likelihood decomposable model given a maximum clique size is NP-hard for k > 2. In this work, we propose a family of algorithms which approximates this problem with a computational complexity of O(k · n^2 log n) in the worst case, where n is the number of implied random variables. The structures of the decomposable models that solve the maximum likelihood problem are called maximal k-order decomposable graphs. Our proposals, called fractal trees, construct a sequence of maximal i-order decomposable graphs, for i = 2, ..., k, in k − 1 steps. At each step, the algorithms follow a divide-and-conquer strategy based on the particular features of this type of structures. Additionally, we propose a prune-and-graft procedure which transforms a maximal k-order decomposable graph into another one, increasing its likelihood. We have implemented two particular fractal tree algorithms called parallel fractal tree and sequential fractal tree. These algorithms can be considered a natural extension of Chow and Liu’s algorithm, from k = 2 to arbitrary values of k. Both algorithms have been compared against other efficient approaches in artificial and real domains, and they have shown a competitive behavior to deal with the maximum likelihood problem. Due to their low computational complexity they are especially recommended to deal with high dimensional domains.