A Quantum Game of Life

This research describes a three dimensional quantum cellular automaton (QCA) which can simulate all other 3D QCA. This intrinsically universal QCA belongs to the simplest subclass of QCA: Partitioned QCA (PQCA). PQCA are QCA of a particular form, where incoming information is scattered by a fixed unitary U before being redistributed and rescattered. Our construction is minimal amongst PQCA, having block size 2 x 2 x 2 and cell dimension 2. Signals, wires and gates emerge in an elegant fashion.Comment: 13 pages, 10 figures. Final version, accepted by Journ\'ees Automates Cellulaires (JAC 2010)

Quantum Artificial Life in an IBM Quantum Computer

We present the first experimental realization of a quantum artificial life algorithm in a quantum computer. The quantum biomimetic protocol encodes tailored quantum behaviors belonging to living systems, namely, self-replication, mutation, interaction between individuals, and death, into the cloud quantum computer IBM ibmqx4. In this experiment, entanglement spreads throughout generations of individuals, where genuine quantum information features are inherited through genealogical networks. As a pioneering proof-of-principle, experimental data fits the ideal model with accuracy. Thereafter, these and other models of quantum artificial life, for which no classical device may predict its quantum supremacy evolution, can be further explored in novel generations of quantum computers. Quantum biomimetics, quantum machine learning, and quantum artificial intelligence will move forward hand in hand through more elaborate levels of quantum complexity

Quantum voting and violation of Arrow's Impossibility Theorem

We propose a quantum voting system, in the spirit of quantum games such as the quantum Prisoner's Dilemma. Our scheme enables a constitution to violate a quantum analog of Arrow's Impossibility Theorem. Arrow's Theorem is a claim proved deductively in economics: Every (classical) constitution endowed with three innocuous-seeming properties is a dictatorship. We construct quantum analogs of constitutions, of the properties, and of Arrow's Theorem. A quantum version of majority rule, we show, violates this Quantum Arrow Conjecture. Our voting system allows for tactical-voting strategies reliant on entanglement, interference, and superpositions. This contribution to quantum game theory helps elucidate how quantum phenomena can be harnessed for strategic advantage.Comment: Version accepted by Phys. Rev. A. Added background and references about game theory and about Arrow's Theorem. Added an opportunity for further research. For citation purposes: The second author's family name is "Yunger Halpern" (not "Halpern"

Rule switching mechanisms in the Game of Life with synchronous and asynchronous updating policy

The emergence of complex structures in the systems governed by a simple set of rules is among the most fascinating aspects of Nature. The particularly powerful and versatile model suitable for investigating this phenomenon is provided by cellular automata, with the Game of Life being one of the most prominent examples. However, this simplified model can be too limiting in providing a tool for modelling real systems. To address this, we introduce and study an extended version of the Game of Life, with the dynamical process governing the rule selection at each step. We show that the introduced modification significantly alters the behaviour of the game. We also demonstrate that the choice of the synchronization policy can be used to control the trade-off between the stability and the growth in the system.Comment: 14 pages, 5+1 figures, code available at https://doi.org/10.5281/zenodo.809960

Quantum Artificial Life in an IBM Quantum Computer

We present the first experimental realization of a quantum artificial life algorithm in a quantum computer. The quantum biomimetic protocol encodes tailored quantum behaviors belonging to living systems, namely, self-replication, mutation, interaction between individuals, and death, into the cloud quantum computer IBM ibmqx4. In this experiment, entanglement spreads throughout generations of individuals, where genuine quantum information features are inherited through genealogical networks. As a pioneering proof-of-principle, experimental data fits the ideal model with accuracy. Thereafter, these and other models of quantum artificial life, for which no classical device may predict its quantum supremacy evolution, can be further explored in novel generations of quantum computers. Quantum biomimetics, quantum machine learning, and quantum artificial intelligence will move forward hand in hand through more elaborate levels of quantum complexity. © 2018, The Author(s).We acknowledge support from Spanish MINECO/FEDER FIS2015-69983-P, UPV/EHU new PhD program, Basque Government Programa Posdoctoral de Perfeccionamiento de Personal Investigador Doctor, Basque Government IT986-16, and Ramón y Cajal Grant RYC-2012-11391

Quantum machine learning and quantum biomimetics: A perspective

Quantum machine learning has emerged as an exciting and promising paradigm inside quantum technologies. It may permit, on the one hand, to carry out more efficient machine learning calculations by means of quantum devices, while, on the other hand, to employ machine learning techniques to better control quantum systems. Inside quantum machine learning, quantum reinforcement learning aims at developing "intelligent" quantum agents that may interact with the outer world and adapt to it, with the strategy of achieving some final goal. Another paradigm inside quantum machine learning is that of quantum autoencoders, which may allow one for employing fewer resources in a quantum device via a training process. Moreover, the field of quantum biomimetics aims at establishing analogies between biological and quantum systems, to look for previously inadvertent connections that may enable useful applications. Two recent examples are the concepts of quantum artificial life, as well as of quantum memristors. In this Perspective, we give an overview of these topics, describing the related research carried out by the scientific community.Comment: Invited Perspective article for Machine Learning: Science and Technology, 17 pages, 6 figures, 110 reference

Proceedings of JAC 2010. Journées Automates Cellulaires

The second Symposium on Cellular Automata “Journ´ees Automates Cellulaires” (JAC 2010) took place in Turku, Finland, on December 15-17, 2010. The first two conference days were held in the Educarium building of the University of Turku, while the talks of the third day were given onboard passenger ferry boats in the beautiful Turku archipelago, along the route Turku–Mariehamn–Turku. The conference was organized by FUNDIM, the Fundamentals of Computing and Discrete Mathematics research center at the mathematics department of the University of Turku. The program of the conference included 17 submitted papers that were selected by the international program committee, based on three peer reviews of each paper. These papers form the core of these proceedings. I want to thank the members of the program committee and the external referees for the excellent work that have done in choosing the papers to be presented in the conference. In addition to the submitted papers, the program of JAC 2010 included four distinguished invited speakers: Michel Coornaert (Universit´e de Strasbourg, France), Bruno Durand (Universit´e de Provence, Marseille, France), Dora Giammarresi (Universit` a di Roma Tor Vergata, Italy) and Martin Kutrib (Universit¨at Gie_en, Germany). I sincerely thank the invited speakers for accepting our invitation to come and give a plenary talk in the conference. The invited talk by Bruno Durand was eventually given by his co-author Alexander Shen, and I thank him for accepting to make the presentation with a short notice. Abstracts or extended abstracts of the invited presentations appear in the first part of this volume. The program also included several informal presentations describing very recent developments and ongoing research projects. I wish to thank all the speakers for their contribution to the success of the symposium. I also would like to thank the sponsors and our collaborators: the Finnish Academy of Science and Letters, the French National Research Agency project EMC (ANR-09-BLAN-0164), Turku Centre for Computer Science, the University of Turku, and Centro Hotel. Finally, I sincerely thank the members of the local organizing committee for making the conference possible. These proceedings are published both in an electronic format and in print. The electronic proceedings are available on the electronic repository HAL, managed by several French research agencies. The printed version is published in the general publications series of TUCS, Turku Centre for Computer Science. We thank both HAL and TUCS for accepting to publish the proceedings.Siirretty Doriast

Quantum Biomimetics

136 p.En esta tesis proponemos el concepto de Biomimética Cuántica orientado hacia la reproducción de comportamientos propios de los seres vivos en protocolos de información cuántica. En concreto, las propiedades que aspiramos a imitar emergen como resultado de fenómenos de interacción en diferentes escalas, resultando inaccesibles para un tratamiento matemático acorde al ofrecido por las plataformas de tecnologías cuánticas. Por tanto, el objetivo de la tesis es el de diseñar modelos con cabida para las mencionadas características biológicas pero simplificados de forma que puedan ser adaptados en protocolos experimentales. La tesis se divide en tres partes, una por cada rasgo biológico diferente empleado como inspiración: selección natural, memoria e inteligencia. El estudio presentado en la primera parte culmina con la obtención de un modelo de vida artificial con una identidad exclusivamente cuántica, que no solo permite la escenificación del modelo de selección natural a escala microscópica si no que proporciona un posible marco para la implementación de algoritmos genéticos y problemas de optimización en plataformas cuánticas. En la segunda parte se muestran algoritmos asociados con la simulación de evolución temporal regida por ecuaciones con una dependencia explicita en términos deslocalizados temporalmente. Estos permiten la incorporación de la retroalimentación y posalimentación al conjunto de herramientas en información cuántica. La tercera y última parte versa acerca de la posible simbiosis entre los algoritmos de aprendizaje y los protocolos cuánticos. Mostramos como aplicar técnicas de optimización clásicas para tratar problemas cuánticos así como la codificación y resolución de problemas en dinámicas puramente cuánticas