In this paper, we present a universal control technique, the non-holonomic control, which allows us to impose any arbitrarily prescribed unitary evolution to any quantum system through the alternate application of two well-chosen perturbations.

(1.1) x(i+ 1) = g(x(i),u(i), i) , with initial condition x(i1) = x at time i1. Here g(x(i),u(i), i) is a random variable with known probability distribution determined by the values of (x(i),u(i), i). Thus we have a set of random variables g(x,u, i) for all possible values of the variables x ∈ R, u ∈ R, i ∈ Z. The process determined by (1.1) is clearly Markovian. For the cost function we take t...

Action calculi have been deened as a broad class of action structures with added structure; they are syntactic in nature. Each action calculus AC(K) is determined essentially by a set K of controls. Diierent concrete models of concurrent computation such as Petri nets, the typed-calculus and the-calculus, are obtained by diierent choices of control set K. The aim of this work is to deene a clas...

where g : R × R × R → R is a C function. Once we specify a parameter path u(t), t ≥ t1, in the parameter space we can solve (1.1) uniquely for x(t), t ≥ t1, with the given initial condition x(t1) = x0. Alternatively if we specify a parameter path u(t), t ≤ t1, in the parameter space we can solve (1.1) uniquely for x(t), t ≤ t1, with the given terminal condition x(t1) = x0. Suppose now that for ...

annotate: A command used for listing the latest version of each program's source code line, along with the date, the file version it was introduced, and the person who committed it. backout: To undo the effects of a commit, often by introducing a new commit that restores things to their previous state. bike shed discussion: A discussion about a simple and trivial issue where everybody can (and ...

Overview • The Object Space Approach: object-oriented essentials and decoupled communication. • Example: a distributed time service. • A distributed protoypical implementation of Object Space. • Employing replication and optimistic asynchrony: a more efficient implementation.