Related papers: Quasi-deterministic 5' -> 3' Watson-Crick Automata
Classification of whole-brain functional connectivity MRI data with convolutional neural networks (CNNs) has shown promise, but the complexity of these models impedes understanding of which aspects of brain activity contribute to…
We investigate quantum phase transitions (QPTs) in spin chain systems characterized by local Hamiltonians with matrix product ground states. We show how to theoretically engineer such QPT points between states with predetermined properties.…
We calculate the conductance through a single quantum dot coupled to metallic leads, modeled by the spin 1/2 Anderson model. We adopt the finite-U extension of the noncrossing approximation method. Our results are in good agreement with…
We have calculated the admittance of a two-dimensional quantum point contact (QPC) using a novel variant of the Wigner distribution function (WDF) formalism. In the semiclassical approximation, a Boltzman-like equation is derived for the…
While quantum computers assume existence of state preparation process $|0\rangle$, CPT symmetry of physics says that performing such process in CPT symmetry perspective, e.g. reversing used EM impulses ($V(t)\to V(-t)$), we should get its…
One-Counter Nets (OCNs) are finite-state automata equipped with a counter that is not allowed to become negative, but does not have zero tests. Their simplicity and close connection to various other models (e.g., VASS, Counter Machines and…
We study the properties of the two-point spectral form factor for classically chaotic systems with spin 1/2 in the semiclassical limit, with a suitable semiclassical trace formula as our principal tool. To this end we introduce a…
We study a class of finite state machines, called \defi{$w$-matching machines}, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern $w$. They can be used to compute the asymptotic speed, i.e.…
We explore quantum properties of a which-way detector using three versions of an idealized two slit arrangements. Firstly we derive complementarity relations for the detector; secondly we show how the "experiment" may be altered in such a…
Determining the minimum number of states required by a finite automaton to separate a given pair of different words is an important problem. In this paper, we consider this problem for quantum automata (QFAs). We show that 2-state QFAs can…
Asymmetry in a three-electron double quantum dot (DQD) allows spin blockade, when spin-3/2 (quadruplet) states and spin-1/2 (doublet) states have different charge configurations. We have observed this DQD spin blockade near the (1,2)-(2,1)…
We investigate coherent electron-switching transport in a double quantum waveguide system in a perpendicular static or vanishing magnetic field. The finite symmetric double waveguide is connected to two semi-infinite leads from both ends.…
The scattering problems of a scalar point particle from a finite assembly of n>1 non-overlapping and disconnected hard disks, fixed in the two-dimensional plane, belong to the simplest realizations of classically hyperbolic scattering…
As quantum devices scale to larger and larger sizes, a significant challenge emerges in scaling their coherent controls accordingly. Quantum cellular automata (QCAs) constitute a promising framework that bypasses this control problem:…
We consider a 2D electron system on a square lattice with hopping beyond nearest neighbors. The existence of the quantum critical point associated with an electronic topological transition in the noninteracting system results in density…
In Formal Languages and Automata Theory courses, students find understanding nondeterministic finite-state and pushdown automata difficult. In many cases, this means that it is challenging for them to comprehend the operational semantics of…
Watkins' and Dayan's Q-learning is a model-free reinforcement learning algorithm that iteratively refines an estimate for the optimal action-value function of an MDP by stochastically "visiting" many state-ation pairs [Watkins and Dayan,…
Assemblies of interacting quantum particles often surprise us with properties that are difficult to predict. One of the simplest quantum many-body systems is the spin 1/2 Heisenberg antiferromagnetic chain, a linear array of interacting…
We introduce deterministic suffix-reading automata (DSA), a new automaton model over finite words. Transitions in a DSA are labeled with words. From a state, a DSA triggers an outgoing transition on seeing a word ending with the…
Developmental dynamics of multicellular organism is a process that takes place in a multi-stable system in which each attractor state represents a cell type and attractor transitions correspond to cell differentiation paths. This new…