Sharif Digital Repository

We consider two ensembles of qubits dissipating into two overlapping environments, that is, with a certain number of qubits in common that dissipate into both environments. We then study the dynamics of bipartite entanglement between the two ensembles by excluding the common qubits. To get analytical solutions for an arbitrary number of qubits we consider initial states with a single excitation and show that the largest amount of entanglement can be created when excitations are initially located among side (noncommon) qubits. Moreover, the stationary entanglement exhibits a monotonic (nonmonotonic) scaling versus the number of common (side) qubits  

We provide an analytical investigation of the entanglement dynamics for a system composed of an arbitrary number of qubits dissipating into a common environment. Specifically, we consider product initial states with a given number of excitations whose evolution remains confined on low-dimensional subspaces of the operators space. We then find for which pairs of qubits entanglement can be generated and can persist at a steady state. Finally, we determine the stationary distribution of entanglement as well as its scaling versus the total number of qubits in the system  

Local noise can produce quantum correlations on an initially classically correlated state, provided that it is not represented by a unital or semiclassical channel. We find the power of any given local channel for producing quantum correlations on an initially classically correlated state. We introduce a computable measure for quantifying the quantum correlations in quantum-classical states, which is based on the noncommutativity of ensemble states in one party of the composite system. Using this measure we show that the amount of quantum correlations produced is proportional to the classical correlations in the initial state. The power of an arbitrary channel for producing quantum... 

A general method for deriving electromagnetic particle in cell (EMPIC) algorithms has been given by Eastwood [Comput. Phys. Commun. 64, 252 (1991)]. This method devises variation of the action-integral to find discrete governing equations. The most important advantage of this method is automatic inclusion of the time coordinate via the action integral into the computational domain. This inclusion is inevitable because electromagnetic algorithms are based on time evolution of the system from its initial state. The drawback of this method is that it is rather abstract. This causes obscurity of particle-mesh interactions and makes it hard to analyze physical treatments of the computational... 

Presented is a novel approach for designing continuous-time update laws to update the parameters of stabilising controllers during continuous phases of bipedal walking such that (i) a general cost function, such as the energy of the control input over single support, can be minimised in an online manner, and (ii) the exponential stability of the corresponding limit cycle for the closed-loop impulsive system is not affected. Formally, a class of update laws with a radial basis step length is developed to minimise a cost function in terms of the stabilising controller parameters and initial states of the mechanical system  

In this research, effective length of one-dimensional combustion in a dilute monopropellant spray, constant area and fixed volume chamber is analytically predicted. A new evaporation rate in the form of d k+1 relation is introduced. In the case of controlling vaporization by radiative heat transfer, k is equal to zero, and when molecular processes control the vaporization, k will be equal to one and in some cases vaporization data need the value of k greater than one to fit properly to related equation. Development of this approach can be used in the design of combustion chambers with optimum length and with using vaporization rate of R = R0〈r〉 0 k/〈r〉k. Spray equation and distribution... 

In reference [1], some weak points in the design of the Shannon stream cipher and a differential distinguisher with complexity of O(214.92) keystream bits (i.e. O(29.92) keystream words) were presented. Another distinguishing attack based on a multidimensional linear transformation was presented in [2] which require 2106.996 keystream words. Both of these attacks need to have access to the initial state that is unlikely. In this paper, a likely attack using fault analysis method is exploited to solve the mentioned problem. Additionally, a new distinguisher is proposed which improves the attack complexity to four times the complexity of running the Shannon stream cipher. Only are two... 

In this paper, the problem of resource allocation at an Ad hoc network with nodes not using any infrastructure to cooperate with each other is considered. By using a simple interference model in wireless links, the convergence and stability of a fair resource allocation scheme in the absence of delay is investigated. Also, the local stability of the scheme in the presence of upper-bounded delay is verified. Simulations results illustrate the convergence and fairness of this scheme considering different initial states for different sources. The performance of the scheme in the presence of different disturbances for each flow in transient and steady state along with its local stability in the... 

This paper derives an estimated function made by simple Neural Network to find initial state of optimization parameters. It changes a system of differential equations with boundary values to a system of equations with initial values. So a lot of time would be saved to solve it. As a result, the system with differential equations will reach the desired final state. Copyright © 2006 by ASME