Comment on "General Non-Markovian Dynamics of Open Quantum Systems"

The existence of a "non-Markovian dissipationless" regime, characterized by long lived oscillations, was recently reported for a class of quantum open systems (Zhang et al, PRL, 109, 170402, (2012)). It is claimed this could happen in the strong coupling regime, a surprising result which has attracted some attention. We show that this regime exists if and only if the total Hamiltonian is unbounded from below, casting serious doubts on the usefulness of this result

Geometric phases under the presence of a composite environment

We compute the geometric phase for a spin-1/2 particle under the presence of a composite environment, composed of an external bath (modeled by an infinite set of harmonic oscillators) and another spin-1/2 particle. We consider both cases: an initial entanglement between the spin-1/2 particles and an initial product state in order to see if the initial entanglement has an enhancement effect on the geometric phase of one of the spins. We follow the nonunitary evolution of the reduced density matrix and evaluate the geometric phase for a single two-level system. We also show that the initial entanglement enhances the sturdiness of the geometric phase under the presence of an external composite environment.Comment: 10 pages, 12 figures. Version to appear in Phys. Rev.

Algorithmic and Hardness Results for the Colorful Components Problems

In this paper we investigate the colorful components framework, motivated by applications emerging from comparative genomics. The general goal is to remove a collection of edges from an undirected vertex-colored graph $G$ such that in the resulting graph $G'$ all the connected components are colorful (i.e., any two vertices of the same color belong to different connected components). We want $G'$ to optimize an objective function, the selection of this function being specific to each problem in the framework. We analyze three objective functions, and thus, three different problems, which are believed to be relevant for the biological applications: minimizing the number of singleton vertices, maximizing the number of edges in the transitive closure, and minimizing the number of connected components. Our main result is a polynomial time algorithm for the first problem. This result disproves the conjecture of Zheng et al. that the problem is $NP$-hard (assuming $P \neq NP$). Then, we show that the second problem is $APX$-hard, thus proving and strengthening the conjecture of Zheng et al. that the problem is $NP$-hard. Finally, we show that the third problem does not admit polynomial time approximation within a factor of $|V|^{1/14 - \epsilon}$ for any $\epsilon > 0$, assuming $P \neq NP$ (or within a factor of $|V|^{1/2 - \epsilon}$, assuming $ZPP \neq NP$).Comment: 18 pages, 3 figure

Quantum finite automata and linear context-free languages: a decidable problem

We consider the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We show that given a language recognized by such a device and a linear context-free language, it is recursively decidable whether or not they have a nonempty intersection. This extends a result of Blondel et al. which can be interpreted as solving the problem with the free monoid in place of the family of linear context-free languages. © 2013 Springer-Verlag

An AER-Based Actuator Interface for Controlling an Anthropomorphic Robotic Hand

Bio-Inspired and Neuro-Inspired systems or circuits are a relatively novel approaches to solve real problems by mimicking the biology in its efficient solutions. Robotic also tries to mimic the biology and more particularly the human body structure and efficiency of the muscles, bones, articulations, etc. Address-Event-Representation (AER) is a communication protocol for transferring asynchronous events between VLSI chips, originally developed for neuro-inspired processing systems (for example, image processing). Such systems may consist of a complicated hierarchical structure with many chips that transmit data among them in real time, while performing some processing (for example, convolutions). The information transmitted is a sequence of spikes coded using high speed digital buses. These multi-layer and multi-chip AER systems perform actually not only image processing, but also audio processing, filtering, learning, locomotion, etc. This paper present an AER interface for controlling an anthropomorphic robotic hand with a neuro-inspired system.Unión Europea IST-2001-34124 (CAVIAR)Ministerio de Ciencia y Tecnología TIC-2003-08164-C03-0

Non deterministic polynomial optimization problems and their approximations

AbstractA unified and general framework for the study of nondeterministic polynomial optimization problems (NPOP) is presented and some properties of NPOP's are investigated. A characterization of NPOP's with regard to their approximability properties is given by proving necessary and sufficient conditions for two approximability schemes. Known approximability results are shown to fit within the general frame developed in the paper. Finally NPOP's are classified and studied with regard to the possibility or impossibility of ‘reducing’ certain types of NPOP's to other types in a sense specified in the text

The non-self-adjointness of the radial momentum operator in n dimensions

The non self-adjointness of the radial momentum operator has been noted before by several authors, but the various proofs are incorrect. We give a rigorous proof that the $n$-dimensional radial momentum operator is not self- adjoint and has no self-adjoint extensions. The main idea of the proof is to show that this operator is unitarily equivalent to the momentum operator on $L^{2}[(0,\infty),dr]$ which is not self-adjoint and has no self-adjoint extensions.Comment: Some text and a reference adde