Random unitary dynamics of quantum networks

We investigate the asymptotic dynamics of quantum networks under repeated applications of random unitary operations. It is shown that in the asymptotic limit of large numbers of iterations this dynamics is generally governed by a typically low dimensional attractor space. This space is determined completely by the unitary operations involved and it is independent of the probabilities with which these unitary operations are applied. Based on this general feature analytical results are presented for the asymptotic dynamics of arbitrarily large cyclic qubit networks whose nodes are coupled by randomly applied controlled-NOT operations.Comment: 4 pages, 2 figure

Complex geometric asymptotics for nonlinear systems on complex varieties

N/

Resonant Geometric Phases for Soliton Equations

The goal of the present paper is to introduce a multidimensional generalization of asymptotic reduction given in a paper by Alber and Marsden [1992], to use this to obtain a new class of solutions that we call resonant solitons, and to study the corresponding geometric phases. The term "resonant solitons" is used because those solutions correspond to a spectrum with multiple points, and they also represent a dividing solution between two different types of solitons. In this sense, these new solutions are degenerate and, as such, will be considered as singular points in the moduli space of solitons

Characterization of distillability of entanglement in terms of positive maps

A necessary and sufficient condition for 1-distillability is formulated in terms of decomposable positive maps. As an application we provide insight into why all states violating the reduction criterion map are distillable and demonstrate how to construct such maps in a systematic way. We establish a connection between a number of existing results, which leads to an elementary proof for the characterisation of distillability in terms of 2-positive maps.Comment: 4 pages, revtex4. Published revised version, title changed, expanded discussion, main result unchange

Geometric analysis of optical frequency conversion and its control in quadratic nonlinear media

We analyze frequency conversion and its control among three light waves using a geometric approach that enables the dynamics of the waves to be visualized on a closed surface in three dimensions. It extends the analysis based on the undepleted-pump linearization and provides a simple way to understand the fully nonlinear dynamics. The Poincaré sphere has been used in the same way to visualize polarization dynamics. A geometric understanding of control strategies that enhance energy transfer among interacting waves is introduced, and the quasi-phase-matching strategy that uses microstructured quadratic materials is illustrated in this setting for both type I and II second-harmonic generation and for parametric three-wave interactions

Completely positive covariant two-qubit quantum processes and optimal quantum NOT operations for entangled qubit pairs

The structure of all completely positive quantum operations is investigated which transform pure two-qubit input states of a given degree of entanglement in a covariant way. Special cases thereof are quantum NOT operations which transform entangled pure two-qubit input states of a given degree of entanglement into orthogonal states in an optimal way. Based on our general analysis all covariant optimal two-qubit quantum NOT operations are determined. In particular, it is demonstrated that only in the case of maximally entangled input states these quantum NOT operations can be performed perfectly.Comment: 14 pages, 2 figure

Continuous macroscopic limit of a discrete stochastic model for interaction of living cells

In the development of multiscale biological models it is crucial to establish a connection between discrete microscopic or mesoscopic stochastic models and macroscopic continuous descriptions based on cellular density. In this paper a continuous limit of a two-dimensional Cellular Potts Model (CPM) with excluded volume is derived, describing cells moving in a medium and reacting to each other through both direct contact and long range chemotaxis. The continuous macroscopic model is obtained as a Fokker-Planck equation describing evolution of the cell probability density function. All coefficients of the general macroscopic model are derived from parameters of the CPM and a very good agreement is demonstrated between CPM Monte Carlo simulations and numerical solution of the macroscopic model. It is also shown that in the absence of contact cell-cell interactions, the obtained model reduces to the classical macroscopic Keller-Segel model. General multiscale approach is demonstrated by simulating spongy bone formation from loosely packed mesenchyme via the intramembranous route suggesting that self-organizing physical mechanisms can account for this developmental process.Comment: 4 pages, 3 figure

Approximation Algorithms for the Capacitated Domination Problem

We consider the {\em Capacitated Domination} problem, which models a service-requirement assignment scenario and is also a generalization of the well-known {\em Dominating Set} problem. In this problem, given a graph with three parameters defined on each vertex, namely cost, capacity, and demand, we want to find an assignment of demands to vertices of least cost such that the demand of each vertex is satisfied subject to the capacity constraint of each vertex providing the service. In terms of polynomial time approximations, we present logarithmic approximation algorithms with respect to different demand assignment models for this problem on general graphs, which also establishes the corresponding approximation results to the well-known approximations of the traditional {\em Dominating Set} problem. Together with our previous work, this closes the problem of generally approximating the optimal solution. On the other hand, from the perspective of parameterization, we prove that this problem is {\it W[1]}-hard when parameterized by a structure of the graph called treewidth. Based on this hardness result, we present exact fixed-parameter tractable algorithms when parameterized by treewidth and maximum capacity of the vertices. This algorithm is further extended to obtain pseudo-polynomial time approximation schemes for planar graphs