Communication complexity meets cellular automata: Necessary conditions for intrinsic universality

2021 ◽  
Author(s):  
Raimundo Briceño ◽  
Ivan Rapaport
Keyword(s):  
Cellular Automata ◽  
Communication Complexity ◽  
Necessary Conditions ◽  
Intrinsic Universality

scholarly journals The structure of communication problems in cellular automata

2011 ◽  
Vol DMTCS Proceedings vol. AP,... (Proceedings) ◽  
Author(s):  
Raimundo Briceño ◽  
Pierre-Etienne Meunier
Keyword(s):  
Cellular Automata ◽  
Communication Complexity ◽  
Intrinsic Universality ◽  
The Past ◽  
Communication Problems ◽  
International Audience ◽  
Simulation Relations

International audience Studying cellular automata with methods from communication complexity appears to be a promising approach. In the past, interesting connections between communication complexity and intrinsic universality in cellular automata were shown. One of the last extensions of this theory was its generalization to various "communication problems'', or "questions'' one might ask about the dynamics of cellular automata. In this article, we aim at structuring these problems, and find what makes them interesting for the study of intrinsic universality and quasi-orders induced by simulation relations.

scholarly journals Communication complexity and intrinsic universality in cellular automata

2011 ◽  
Vol 412 (1-2) ◽  
pp. 2-21 ◽  
Author(s):  
E. Goles ◽  
P.-E. Meunier ◽  
I. Rapaport ◽  
G. Theyssier
Keyword(s):  
Cellular Automata ◽  
Communication Complexity ◽  
Intrinsic Universality

scholarly journals Traced communication complexity of cellular automata

2011 ◽  
Vol 412 (30) ◽  
pp. 3906-3916 ◽  
Author(s):  
Eric Goles ◽  
Pierre Guillon ◽  
Ivan Rapaport
Keyword(s):  
Cellular Automata ◽  
Communication Complexity

scholarly journals Communication complexity in number-conserving and monotone cellular automata

2011 ◽  
Vol 412 (29) ◽  
pp. 3616-3628 ◽  
Author(s):  
E. Goles ◽  
A. Moreira ◽  
I. Rapaport
Keyword(s):  
Cellular Automata ◽  
Communication Complexity

scholarly journals CONSTRUCTION OF REVERSIBLE LATTICE MOLECULAR AUTOMATA

2009 ◽  
Vol 20 (06) ◽  
pp. 901-929
Author(s):  
TAKAYUKI NOZAWA ◽  
TOSHIYUKI KONDO
Keyword(s):  
Cellular Automata ◽  
Conservation Laws ◽  
Molecular Interaction ◽  
Statistical Physics ◽  
Necessary Conditions ◽  
Higher Order ◽  
Self Organization ◽  
Microscopic Reversibility ◽  
Multiple Levels ◽  
Order Structures

Several cellular automata (CA) models have been developed to simulate self-organization of multiple levels of structures. However, they do not obey microscopic reversibility and conservation laws. In this paper, we describe the construction of a reversible lattice molecular automata (RLMA) model, which simulates molecular interaction and self-organization of higher-order structures. The model's strict reversibility entails physically relevant conservation laws, and thus opens a way to precise application and validation of the methods from statistical physics in studying the necessary conditions for such multiple levels of self-organization.

scholarly journals Cellular automata and communication complexity

2004 ◽  
Vol 322 (2) ◽  
pp. 355-368 ◽  
Author(s):  
Christoph Dürr ◽  
Ivan Rapaport ◽  
Guillaume Theyssier
Keyword(s):  
Cellular Automata ◽  
Communication Complexity

scholarly journals A purification postulate for quantum mechanics with indefinite causal order

Quantum ◽  
2017 ◽  
Vol 1 ◽  
pp. 10 ◽  
Author(s):  
Mateus Araújo ◽  
Adrien Feix ◽  
Miguel Navascués ◽  
Časlav Brukner
Keyword(s):  
Quantum Mechanics ◽  
Communication Complexity ◽  
Quantum Communication ◽  
Necessary Conditions ◽  
Causal Order ◽  
Standard Quantum ◽  
Local Quantum ◽  
Causal Structures

To study which are the most general causal structures which are compatible with local quantum mechanics, Oreshkov et al. introduced the notion of a process: a resource shared between some parties that allows for quantum communication between them without a predetermined causal order. These processes can be used to perform several tasks that are impossible in standard quantum mechanics: they allow for the violation of causal inequalities, and provide an advantage for computational and communication complexity. Nonetheless, no process that can be used to violate a causal inequality is known to be physically implementable. There is therefore considerable interest in determining which processes are physical and which are just mathematical artefacts of the framework. Here we make the first step in this direction, by proposing a purification postulate: processes are physical only if they are purifiable. We derive necessary conditions for a process to be purifiable, and show that several known processes do not satisfy them.

Sign in / Sign up

Export Citation Format

Share Document