Related papers: Quantum cellular automata for word statistics faci…
Emergent cooperation in classical Multi-Agent Reinforcement Learning has gained significant attention, particularly in the context of Sequential Social Dilemmas (SSDs). While classical reinforcement learning approaches have demonstrated…
Quantum computing architectures require an accurate and efficient description in terms of many-electron states. Recent implementations include quantum dot arrays, where the ground state of a multi q-bit system can be altered by voltages…
We present a model of discrete quantum evolution based on quantum correlations between the evolving system and a reference quantum clock system. A quantum circuit for the model is provided, which in the case of a constant Hamiltonian is…
A mutualism is an interaction where the involved species benefit from each other. We study a two-dimensional hexagonal three-state cellular automaton model of a two-species mutualistic system. The simple model is characterized by four…
Quantum sampling, a fundamental subroutine in numerous quantum algorithms, involves encoding a given probability distribution in the amplitudes of a pure state. Given the hefty cost of large-scale quantum storage, we initiate the study of…
Quantum information scrambling has attracted much attention amid the effort to reconcile the conflict between quantum-mechanical unitarity and the thermalizaiton-irreversibility in many-body systems. Here we propose an unconventional…
This paper demonstrates and proves that the coordination of actions in a distributed swarm can be enhanced by using quantum entanglement. In particular, we focus on - Global and local simultaneous random walks, using entangled qubits that…
The aim of this thesis is to advance the theory behind quantum information processing tasks, by deriving fundamental limits on bipartite quantum interactions and dynamics, which corresponds to an underlying Hamiltonian that governs the…
Complexity has been a recurrent research topic in cellular automata because they represent systems where complex behaviors emerge from simple local interactions. A significant amount of previous research has been conducted proposing…
Resetting a system's state plays a fundamental role in physics, engineering, computer science, and many other fields. Here we focus on a method originally proposed in automata theory. The state of an automaton evolves according to a set of…
The goal of this paper is to study the effect of entanglement on the running time of a quantum computation. Adiabatic quantum computation is suited to this kind of study, since it allows us to explicitly calculate the time evolution of the…
Studying the computational complexity and designing fast algorithms for determining winners under voting rules are classical and fundamental questions in computational social choice. In this paper, we accelerate voting by leveraging quantum…
Quantum algorithms require accurate representations of electronic states on a quantum device, yet the approximation of electronic wave functions for strongly correlated systems remains a profound theoretical challenge, with existing methods…
Correlations between different partitions of quantum systems play a central role in a variety of many-body quantum systems, and they have been studied exhaustively in experimental and theoretical research. Here, we investigate dynamical…
The information scrambling in many-body systems is closely related to quantum chaotic dynamics, complexity, and gravity. Here we propose a collision model to simulate the information dynamics in an all-optical system. In our model the…
The dynamical spreading of quantum information through a many-body system, typically called scrambling, is a complex process that has proven to be essential to describe many properties of out-of-equilibrium quantum systems. Scrambling can,…
The model of open quantum systems is adopted to describe the non-local dynamical behaviour of qubits processed by entangling gates. The analysis gets to the conclusion that a distinction between evaluation steps and task-oriented computing…
Universal features of chaotic quantum dynamics underlie our understanding of thermalization in closed quantum systems and the complexity of quantum computations. Reversible automaton circuits, comprised of classical logic gates, have…
Quantum Algorithms have long captured the imagination of computer scientists and physicists primarily because of the speed up achieved by them over their classical counterparts using principles of quantum mechanics. Entanglement is believed…
Random boolean cellular automata are investigated, where each gate has two randomly chosen inputs and is randomly assigned a boolean function of its inputs. The effect of non-uniform distributions on the choice of the boolean functions is…