Related papers: Quasi-deterministic 5' -> 3' Watson-Crick Automata
A two-state, three-dimensional, deterministic, reversible cellular automaton is shown to be capable of approximately circular orbits, wavelike undulations, and particle-like configurations that decay in accordance with a half-life law.
We investigate the renormalization of a class of gauge-invariant nonlocal quark bilinear operators, including a finite-length Wilson-line (called Wilson-line operators). The matrix elements of these operators are involved in the recent…
Suppose that three kinds of quantum systems are given in some unknown states $\ket f^{\otimes N}$, $\ket{g_1}^{\otimes K}$, and $\ket{g_2}^{\otimes K}$, and we want to decide which \textit{template} state $\ket{g_1}$ or $\ket{g_2}$, each…
We construct a quantum Wajnflasz-Pick model that is a generalized quantum Ising model, and investigate a nature of quantum phase transitions of the model with infinite-range interactions. Quantum phase transition phenomena have drawn…
We develop an optimized continuous-field quantum Monte Carlo (QMC) algorithm to investigate the SO(5) nonlinear sigma model with a Wess-Zumino-Witten term, which describes half-filled Dirac fermions in 2+1 space-time dimensions akin to…
A finite automaton is called bideterministic if it is both deterministic and codeterministic -- that is, if it is deterministic and its transpose is deterministic as well. The study of such automata in a weighted setting is initiated. All…
We construct the {\it quasi-stationary} (QS) probability distribution for the Domany-Kinzel stochastic cellular automaton (DKCA), a discrete-time Markov process with an absorbing state. QS distributions are derived at both the one- and…
Searching for simple models that possess non-trivial controlling properties is one of the central tasks in the field of quantum technologies. In this work, we construct a quantum spin-$1/2$ chain of finite size, termed as controllable spin…
The quantum dynamics of a periodically driven system, the delta-kicked accelerator, is investigated in the semiclassical and pseudo-classical regimes, where quantum accelerator modes are observed. We construct the evolution operator of this…
We introduce and study input-driven deterministic and nondeterministic double-head pushdown automata. A double-head pushdown automaton is a slight generalization of an ordinary pushdown automaton working with two input heads that move in…
Nonlinearity and entanglement are two important properties by which physical systems can be identified as non-classical. We study the dynamics of the resonant interaction of up to N=3 two-level systems and a single mode of the…
We present a new class of quantum neural networks (QNNs) whose states are solutions of $p$-adic Schr\"{o}dinger equations with a non-local potential that controls the interaction between the neurons. These equations are obtained as Wick…
We study the Heisenberg spin-1/2 model on a semi-infinite chain - or, equivalently, a trotterized unitary SU(2) symmetric six-vertex quantum circuit - with a boundary defect where the interaction between the two spins nearest the edge…
Multipartite entangled states possess a number of non-intuitive properties, making them a useful resource for various quantum information-processing tasks. The three-qubit W-state is one such example where every state is robust to…
State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately, or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the…
We design a physical wave-pulse neural network (WPNN) for both wave and pulse propagation, which gives more degrees of freedom for neural coding than spike neural networks (SNN). We define the rules and the information entropy of this kind…
We introduce and study the repetitive variants of the deterministic and the nondeterministic finite automaton with translucent words (DFAwtw and NFAwtw). On seeing the right sentinel, a repetitive NFAwtw need not halt immediately, accepting…
Here we propose an extension of the (deterministic and the nondeterministic) finite automaton with translucent letters (DFAwtl and NFAwtl), which lies between these automata and their non-returning variants (that is, the nr-DFAwtl and the…
Motivated by a compelling need for time-efficient and robust schemes for quantum-state engineering in systems of neutral atoms in optical tweezers, we consider a ring-shaped array of qubits with nearest-neighbor Ising-type ($zz$) coupling…
A word $w$ is called a reaching word of a subset $S$ of states in a deterministic finite automaton (DFA) if $S$ is the image of $Q$ under the action of $w$. A DFA is called completely reachable if every non-empty subset of the state set has…