ABSTRACT
The key feature in correlations established by multi-party quantum entangled states is nonlocality. A quantity to measure the average nonlocality, distinguishing it from shared randomness and in a direct relation with no-signaling stochastic processes (which provide an operational interpretation of quantum correlations, without involving information transmission between the parties as to sustain causality), is proposed and resolved exhaustively for the quantum correlations established by a Clauser-Horne-Shimony-Holt setup (or CHSH box). The amount of nonlocality that is available in a CHSH box is measured by its proximity to the nearest Popescu-Rohrlich set of causal stochastic processes (aka a PR box) in the no-signaling polytope, related by polyhedral duality to Bell's correlation function. The proposed amount of average nonlocality is an entanglement monotone with a simple relation to concurrence. We provide the optimal setup vectors of a maximally nonlocal CHSH box for any entangled pair. The strongest nonlocality is the fraction [Formula: see text] of a PR box, attained by maximally entangled qubit pairs. The most economical causal stochastic process reproducing any maximally nonlocal CHSH box is developed. Data produced by a computer implementation of the simulator agrees with the quantum mechanical formulas.
ABSTRACT
Derive the quantitative predictions of constraint-based models require of conversion algorithms to enumerate and construct the skeleton graph conformed by the extreme points of the feasible region, where all constraints in the model are fulfilled. The conversion is problematic when the system of linear constraints is degenerate. This paper describes a conversion algorithm that combines the best of two methods: the incremental slicing of cones that defeats degeneracy and pivoting for a swift traversal of the set of extreme points. An extensive computational practice uncovers two complementary classes of conversion problems. The two classes are distinguished by a practical measure of complexity that involves the input and output sizes. Detailed characterizations of the complexity classes and the corresponding performances of the algorithm are presented. For the benefit of implementors, a simple example illustrates the stages of the exposition.
Subject(s)
Computational Biology/methods , Algorithms , Models, TheoreticalABSTRACT
A rigorous proof that linear filters display the inverse limit spaces of chaotic maps is given.
ABSTRACT
It is proved that the multifractal characterizations of diametrically regular measures that are provided by the wavelet and by the Hentschel-Procaccia formalisms are identical. (c) 2001 American Institute of Physics.
ABSTRACT
A polynomial representation of elementary cellular automata (ECA) is used to give a complete characterization of the local internal symmetries of all ECA. It is also shown that the polynomial representation is a natural choice for the study of local internal transformations of all cellular automata with two symbols. This is achieved by proving that local internal transformations are simply expressed in this representation as sums of polynomials. (c) 1998 American Institute of Physics.
ABSTRACT
The phenomenon of synchronization in pairs of cellular automata coupled in a driver-replica mode is studied. Necessary and sufficient conditions for synchronization in linear cellular automaton pairs are given. The couplings that make a pair synchronize are determined for all linear elementary cellular automata. (c) 1998 American Institute of Physics.
ABSTRACT
Cryptosystems for binary information are based on two primitives: an indexed family of permutations of binary words and a generator of pseudorandom sequences of indices. A very efficient implementation of the primitives is constructed using the phenomenon of synchronization in cellular automata. (c) 1998 American Institute of Physics.
ABSTRACT
(Internal) transformations on the space Sigma of automaton configurations are defined as bi-infinite sequences of permutations of the cell symbols. A pair of transformations (gamma,theta) is said to be an internal symmetry of a cellular automaton f:Sigma-->Sigma if f=theta(-1)fgamma. It is shown that the full group of internal symmetries of an automaton f can be encoded as a group homomorphism F such that theta=F(gamma). The domain and image of the homomorphism F have, in general, infinite order and F is presented by a local automaton-like rule. Algorithms to compute the symmetry homomorphism F and to classify automata by their symmetries are presented. Examples on the types of dynamical implications of internal symmetries are discussed in detail. (c) 1997 American Institute of Physics.
ABSTRACT
The property of sensitive dependence on intial conditions is the basis of a rigorous mathematical construction of local maximum Lyapunov exponents for cellular automata. The maximum Lyapunov exponent is given by the fastest average velocity of either the left or right propagating damage fronts. Deviations from the long term behavior of the finite time Lyapunov exponents due to generation of information are quantified and could be used for the characterization of the space time complexity of cellular automata. (c) 1997 American Institute of Physics.
ABSTRACT
A method to identify the invariant subsets of bi-infinite configurations of cellular automata that propagate rigidly with a constant velocity nu is described. Causal traveling configurations, propagating at speeds not greater than the automaton range, mid R:numid R:
