Related papers: Quantum Cellular Automata on a Dual-Species Rydber…
Autonomous quantum machines (AQMs) execute tasks without requiring time-dependent external control. Motivations for AQMs include the restrictions imposed by classical control on quantum machines' coherence times and geometries. Most AQM…
Classical Cellular Automata (CCAs) are a powerful computational framework widely used to model complex systems driven by local interactions. Their simplicity lies in the use of a finite set of states and a uniform local rule, yet this…
Arrays of optically trapped atoms excited to Rydberg states have recently emerged as a competitive physical platform for quantum simulation and computing, where high-fidelity state preparation and readout, quantum logic gates and controlled…
Quantum-dot Cellular Automata (QCA) provides a basis for classical computation without transistors. Many simulations of QCA rely upon the so-called Intercellular Hartree Approximation (ICHA), which neglects the possibility of entanglement…
Cellular Automata(CA) is a discrete computing model which provides simple, flexible and efficient platform for simulating complicated systems and performing complex computation based on the neighborhoods information. CA consists of two…
We develop a model for quantum computation with Rydberg atom arrays, which only relies on global driving, without the need of local addressing of the qubits: any circuit is executed by a sequence of global, resonant laser pulses on a static…
Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a quantum computer? Do we believe that a quantum field is ultimately made of a numerable set of quantum systems that are unitarily interacting? A…
Rydberg atom arrays have recently emerged as one of the most promising platforms for quantum simulation and quantum information processing. However, as is the case for other experimental platforms, the longer-term success of the Rydberg…
Quantum kernel methods (QKMs) offer an appealing framework for machine learning on near-term quantum computers. However, QKMs generically suffer from exponential concentration, requiring an exponential number of measurements to resolve the…
The quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range…
Rydberg atom arrays offer flexible geometries of strongly-interacting neutral atoms, which are useful for many quantum applications such as quantum simulation and quantum computation. Here we consider a gate-based quantum computing scheme…
We present a review of quantum computation with neutral atom qubits. After an overview of architectural options and approaches to preparing large qubit arrays we examine Rydberg mediated gate protocols and fidelity for two- and multi-qubit…
Cellular automata (CAs) are fully-discrete dynamical models that have received much attention due to the fact that their relatively simple setup can nonetheless express highly complex phenomena. Despite the model's theoretical maturity and…
Quantum phases of matter are resources for notions of quantum computation. In this work, we establish a new link between concepts of quantum information theory and condensed matter physics by presenting a unified understanding of…
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…
Quantum cellular automata are important tools in understanding quantum dynamics, thanks to their simple and effective list of rules. Here we investigate explicitly how coherence is built and lost in the evolution of one-dimensional automata…
We present evidence that operation of QCA (Quantum Cellular Automaton) cells with four dots is possible with an occupancy of 4N+2 electrons per cell (N being an integer). We show that interaction between cells can be described in terms of a…
Neural Cellular Automata (NCA) represent a powerful framework for modeling biological self-organization, extending classical rule-based systems with trainable, differentiable (or evolvable) update rules that capture the adaptive…
We consider discrete and integer-valued cellular automata (CA). A particular class of which comprises "Hamiltonian CA" with equations of motion that bear similarities to Hamilton's equations, while they present discrete updating rules. The…
We show how "single" quantum dots, each hosting a singlet-triplet qubit, can be placed in arrays to build a spin quantum cellular automaton. A fast ($\sim 10$ ns) deterministic coherent singlet-triplet filtering, as opposed to current…