The Experts below are selected from a list of 315 Experts worldwide ranked by ideXlab platform
Gary H Bernstein - One of the best experts on this subject based on the ideXlab platform.
-
quantum Cellular Automata
Nanotechnology, 1993Co-Authors: Craig S Lent, P D Tougaw, Wolfgang Porod, Gary H BernsteinAbstract:The authors formulate a new paradigm for computing with Cellular Automata (CAS) composed of arrays of quantum devices-quantum Cellular Automata. Computing in such a paradigm is edge driven. Input, output, and power are delivered at the edge of the CA array only; no direct flow of information or energy to internal cells is required. Computing in this paradigm is also computing with the ground state. The architecture is so designed that the ground-state configuration of the array, subject to boundary conditions determined by the input, yields the computational result. The authors propose a specific realization of these ideas using two-electron cells composed of quantum dots. The charge density in the cell is very highly polarized (aligned) along one of the two cell axes, suggestive of a two-state CA. The polarization of one cell induces a polarization in a neighboring cell through the Coulomb interaction in a very non-linear fashion. Quantum Cellular Automata can perform useful computing. The authors show that AND gates, OR gates, and inverters can be constructed and interconnected.
Matthew B. Hastings - One of the best experts on this subject based on the ideXlab platform.
-
Classification of Quantum Cellular Automata
Communications in Mathematical Physics, 2020Co-Authors: Michael Freedman, Matthew B. HastingsAbstract:There exists an index theory to classify strictly local quantum Cellular Automata in one dimension (Fidkowski et al. in Interacting invariants for Floquet phases of fermions in two dimensions, 2017. arXiv:1703.07360 ; Gross et al. in Commun Math Phys 310(2):419–454, 2012; Po et al. in Phys Rev B 96: 245116, 2017). We consider two classification questions. First, we study to what extent this index theory can be applied in higher dimensions via dimensional reduction, finding a classification by the first homology group of the manifold modulo torsion. Second, in two dimensions, we show that an extension of this index theory (including torsion) fully classifies quantum Cellular Automata, at least in the absence of fermionic degrees of freedom. This complete classification in one and two dimensions by index theory is not expected to extend to higher dimensions due to recent evidence of a nontrivial automaton in three dimensions (Haah et al. in Nontrivial quantum Cellular Automata in higher dimensions, 2018. arXiv:1812.01625 ). Finally, we discuss some group theoretical aspects of the classification of quantum Cellular Automata and consider these Automata on higher dimensional real projective spaces.
Andrew Adamatzky - One of the best experts on this subject based on the ideXlab platform.
-
EXPRESSIVENESS OF ELEMENTARY Cellular Automata
International Journal of Modern Physics C, 2013Co-Authors: Markus Redeker, Andrew Adamatzky, Genaro J. MartínezAbstract:We investigate expressiveness, a parameter of one-dimensional Cellular Automata, in the context of simulated biological systems. The development of elementary Cellular Automata is interpreted in terms of biological systems, and biologically inspired parameters for biodiversity are applied to the configurations of Cellular Automata. This paper contains a survey of the Elementary Cellular Automata in terms of their expressiveness and an evaluation whether expressiveness is a meaningful term in the context of simulated biology.
-
Identification Of Cellular Automata
1994Co-Authors: Andrew AdamatzkyAbstract:What are Cellular Automata Classification of Cellular Automata Cellular Automata Simulating Nature What is Identification Deterministic Cellular Automata Probabilistic Cellular Automata Fuzzy Cellular Automata Hierarchical Cellular Automata Exotic Cellular Automata Implantation of Cellular Automata Cyptography Three Examples of Natural Systems Design of Molecular Computers Conclusion.
-
Hierarchy of fuzzy Cellular Automata
Fuzzy Sets and Systems, 1994Co-Authors: Andrew AdamatzkyAbstract:Abstract We elaborate notion of Cellular Automata in the directions of synchroneity/asynchroneity, stationarity/nonstationarity, and fuzzify the principle features of Cellular Automata as cell state transition, delay of transition and choice of a local transitions function. Through analyzing the properties in various combinations we divide a set of fuzzy Cellular Automata into 14 classes. To pelucide the whole structure of the classes and precise relations between them we prove the complexity hierarchy.
Craig S Lent - One of the best experts on this subject based on the ideXlab platform.
-
quantum Cellular Automata
Nanotechnology, 1993Co-Authors: Craig S Lent, P D Tougaw, Wolfgang Porod, Gary H BernsteinAbstract:The authors formulate a new paradigm for computing with Cellular Automata (CAS) composed of arrays of quantum devices-quantum Cellular Automata. Computing in such a paradigm is edge driven. Input, output, and power are delivered at the edge of the CA array only; no direct flow of information or energy to internal cells is required. Computing in this paradigm is also computing with the ground state. The architecture is so designed that the ground-state configuration of the array, subject to boundary conditions determined by the input, yields the computational result. The authors propose a specific realization of these ideas using two-electron cells composed of quantum dots. The charge density in the cell is very highly polarized (aligned) along one of the two cell axes, suggestive of a two-state CA. The polarization of one cell induces a polarization in a neighboring cell through the Coulomb interaction in a very non-linear fashion. Quantum Cellular Automata can perform useful computing. The authors show that AND gates, OR gates, and inverters can be constructed and interconnected.
Vincenzo Ciancia - One of the best experts on this subject based on the ideXlab platform.
-
Exploring nominal Cellular Automata
The Journal of Logic and Algebraic Programming, 2017Co-Authors: Tommaso Bolognesi, Vincenzo CianciaAbstract:The emerging field of Nominal Computation Theory is concerned with the theory of Nominal Sets and its applications to Computer Science. We investigate here the impact of nominal sets on the definition of Cellular Automata and on their computational capabilities, with a special focus on the emergent behavioural properties of this new model and their significance in the context of computation-oriented interpretations of physical phenomena. An investigation of the relations between Nominal Cellular Automata and Wolfram's Elementary Cellular Automata is carried out, together with an analysis of interesting particles, exhibiting “nominal” behaviour, in a particular kind of rules, reminiscent of the class of totalistic Cellular Automata, that we call “bagged”.
-
Nominal Cellular Automata
Electronic Proceedings in Theoretical Computer Science, 2016Co-Authors: Tommaso Bolognesi, Vincenzo CianciaAbstract:The emerging field of Nominal Computation Theory is concerned with the theory of Nominal Sets and its applications to Computer Science. We investigate here the impact of nominal sets on the definition of Cellular Automata and on their computational capabilities, with a special focus on the emergent behavioural properties of this new model and their significance in the context of computation-oriented interpretations of physical phenomena. A preliminary investigation of the relations between Nominal Cellular Automata and Wolfram's Elementary Cellular Automata is also carried out.
