Related papers: Quantum cellular automata for word statistics faci…
Central to the field of quantum machine learning is the design of quantum perceptrons and neural network architectures. A key question in this regard is the impact of quantum effects on the way in which such models process information.…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
We present a dynamic learning paradigm for "programming" a general quantum computer. A learning algorithm is used to find the control parameters for a coupled qubit system, such that the system at an initial time evolves to a state in which…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial…
We propose and analyze a protocol to study quantum information scrambling using statistical correlations between measurements, which are performed after evolving a quantum system from randomized initial states. We prove that the resulting…
A challenging simulation of evolutionary dynamics based on a three-state cellular automaton is used as a test of how cooperation can drive the evolution of complex traits. Building on the approach of Wolfram (2025), the fitness of a…
We define and explore in simulation several rules for the local evolution of generative rules for 1D and 2D cellular automata. Our implementation uses strategies from conceptual blending. We discuss potential applications to modelling…
The donation game is a well-established framework for studying the emergence and evolution of cooperation in multi-agent systems. The cooperative behavior can be influenced by the environmental noise in partially observable settings and by…
We firstly investigate the multipartite entanglement features of the quantum states, including the iteration states achieved by repeated application of Grover iteration and the Oracle ones into which the above iteration states evolve by…
We introduce the correlation-efficient time-evolution (CETE) algorithm for simulating quantum many-body dynamics. CETE recasts each step of time evolution as a time-independent correlation problem: the ansatz begins from a mean-field single…
We explore the role of entanglement in adiabatic quantum optimization by performing approximate simulations of the real-time evolution of a quantum system while limiting the amount of entanglement. To classically simulate the time evolution…
The open-system dynamics of entanglement plays an important role in the assessment of the robustness of quantum information processes and also in the investigation of the classical limit of quantum mechanics. Here we show that, subjacent to…
Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer.…
We develop techniques to probe the dynamics of quantum information, and implement them experimentally on an IBM superconducting quantum processor. Our protocols adapt shadow tomography for the study of time evolution channels rather than of…
Modeling joint probability distributions is an important task in a wide variety of fields. One popular technique for this employs a family of multivariate distributions with uniform marginals called copulas. While the theory of modeling…
We improve a recently proposed dynamically driven renormalization group algorithm for cellular automata systems with one absorbing state, introducing spatial correlations in the expression for the transition probabilities. We implement the…
Here, we leverage recent advances in information theory to develop a novel method to characterise the dominant character of the high-order dependencies of quantum systems. To this end, we introduce the Q-information: an…
In the vicinity of a phase transition ergodicity can be broken. Here, different initial many-body configurations evolve towards one of several fixed points, which are macroscopically distinguishable through an order parameter. This…
Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state…