Related papers: Quasi-deterministic 5' -> 3' Watson-Crick Automata
In quantum materials, charge orders typically stabilize in specific crystallographic orientations, though their formation mechanisms may vary. Here, using low-temperature scanning tunneling microscopy (STM), we discover a lattice-decoupled…
We consider the scenario of deterministic classical information transmission between multiple senders and a single receiver, when they a priori share a multipartite quantum state -- an attempt towards building a deterministic dense coding…
Quantum networks will rely on photons entangled to robust, local quantum registers for computation and error correction. We demonstrate control of and entanglement in a fully connected three-qubit $^{13}\mathrm{C}$ nuclear spin register in…
We present a probabilistic cellular automaton with two absorbing states, which can be considered a natural extension of the Domany-Kinzel model. Despite its simplicity, it shows a very rich phase diagram, with two second-order and one…
Deterministic synchronous systems consisting of two finite automata running in opposite directions on a shared read-only input are studied with respect to their ability to perform reversible computations, which means that the automata are…
In this article, we propose a novel Winner-Take-All (WTA) architecture employing neurons with nonlinear dendrites and an online unsupervised structural plasticity rule for training it. Further, to aid hardware implementations, our network…
We study a class of filters -- discrete finite-state transition systems employed as incremental stream transducers -- that have application to robotics: e.g., to model combinatorial estimators and also as concise encodings of feedback…
One Counter Nets (OCNs) are finite-state automata equipped with a counter that cannot become negative, but cannot be explicitly tested for zero. Their close connection to various other models (e.g., PDAs, Vector Addition Systems, and…
We propose a four-way classification of two-dimensional semi-totalistic cellular automata that is different than Wolfram's, based on two questions with yes-or-no answers: do there exist patterns that eventually escape any finite bounding…
Deep learning on non-Euclidean domains is important for analyzing complex geometric data that lacks common coordinate systems and familiar Euclidean properties. A central challenge in this field is to define convolution on domains, which…
When the kinetic energy of a collection of interacting two-dimensional (2D) electrons is quenched at very high magnetic fields so that the Coulomb repulsion dominates, the electrons are expected to condense into an ordered array, forming a…
Machine learning can be substantially powered by a quantum computer owing to its huge Hilbert space and inherent quantum parallelism. In the pursuit of quantum advantages for machine learning with noisy intermediate-scale quantum devices,…
Recently, quantum neural networks or quantum-classical neural networks (qcNN) have been actively studied, as a possible alternative to the conventional classical neural network (cNN), but their practical and theoretically-guaranteed…
We prove that two-way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one-way versions (1PFA's and 1QFA's), and two-way nondeterministic finite automata (2NFA's). For this…
The states in the three-qubit GHZ SLOCC class can exhibit diverse entanglement patterns, as they may have no entanglement in any reduced subsystems, or show entanglement across one, two, or all three bipartite cuts. Significant research has…
Any two-way finite state automaton is equivalent to some one-way finite state automaton. This well-known result, shown by Rabin and Scott and independently by Shepherdson, states that two-way finite state automata (even non-deterministic)…
We introduce Primal-Dual Wasserstein GAN, a new learning algorithm for building latent variable models of the data distribution based on the primal and the dual formulations of the optimal transport (OT) problem. We utilize the primal…
We study three levels in a hierarchy of nondeterminism: A nondeterministic automaton $\mathcal{A}$ is determinizable by pruning (DBP) if we can obtain a deterministic automaton equivalent to $\mathcal{A}$ by removing some of its…
Much evidence seems to suggest cortex operates near a critical point, yet a single set of exponents defining its universality class has not been found. In fact, when critical exponents are estimated from data, they widely differ across…
Wasserstein distributionally robust control (WDRC) is an effective method for addressing inaccurate distribution information about disturbances in stochastic systems. It provides various salient features, such as an out-of-sample…