Related papers: Quasi-deterministic 5' -> 3' Watson-Crick Automata
We present the fully differential production and decay of a W' boson, with arbitrary vector and axial-vector couplings, to any final state at next-to-leading order in QCD. We demonstrate a complete factorization of couplings at…
Driven by analogies with state vectors of quantum informatics and noise-based logic, we propose a general scheme and elements of neural circuitry for processing and addressing information in the brain. Specifically, we consider random…
We realize constant-space quantum computation by measure-many two-way quantum finite automata and evaluate their language recognition power by analyzing patterns of their exotic behaviors and by exploring their structural properties. In…
A complete deterministic finite (semi)automaton (DFA) with a set of states $Q$ is \emph{completely reachable} if every nonempty subset of $Q$ is the image of the action of some word applied to $Q$. The concept of completely reachable…
We study the properties of {\bf exact} (all level $k$) quantum coherent states in the context of string theory on a group manifold (WZWN models). Coherent states of WZWN models may help to solve the unitarity problem: Having positive norm,…
We simulate an actin filament as an automaton network. Every atom takes two or three states and updates its state, in discrete time, depending on a ratio of its neighbours in some selected state. All atoms/automata simultaneously update…
We present a new algorithm for computing the quasi-stationary distribution of subcritical Galton--Watson branching processes. This algorithm is based on a particular discretization of a well-known functional equation that characterizes the…
Higher-order WKB methods are used to investigate the border between the solvable and insolvable portions of the spectrum of quasi-exactly solvable quantum-mechanical potentials. The analysis reveals scaling and factorization properties that…
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…
We introduce a model of one-way language acceptors (a variant of a checking stack automaton) and show the following decidability properties: (1) The deterministic version has a decidable membership problem but has an undecidable emptiness…
We construct a nontrivial three-dimensional subshift of finite type whose projective $\Z$-subdynamics, or $\Z$-trace, is 2-sparse, meaning that there are at most two nonzero symbols in any vertical column. The subshift is deterministic in…
Spin systems such as silicon or nitrogen vacancy centers in diamond, quantum dots and quantum dot molecules coupled to optical cavities appear as key elements for creating quantum networks as not only constituting the nodes of the network,…
In a controlled quantum secure direct communication (Controlled QSDC) protocol between three parties, the sender sends the encoded secured message to one of the two receivers, which can be decoded only when the other receiver agrees to…
The study of quantum generative models is well-motivated, not only because of its importance in quantum machine learning and quantum chemistry but also because of the perspective of its implementation on near-term quantum machines. Inspired…
Matrix-product states and their continuous analogues are variational classes of states that capture quantum many-body systems or quantum fields with low entanglement; they are at the basis of the density-matrix renormalization group method…
Semiautomata form a rich class of sequence-processing algorithms with applications in natural language processing, robotics, computational biology, and data mining. We establish the first Statistical Query hardness result for semiautomata…
In this paper, we propose two novel and practical deep-learning-based algorithms to solve the wireless channel type (WCT) recognition problem. Specifically, the WCT recognition problem is recast as a classification problem in deep learning…
We report on numerically exact determinantal quantum Monte Carlo simulations of the onset of spin-density wave (SDW) order in itinerant electron systems captured by a sign-problem-free two-dimensional lattice model. Extensive measurements…
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…
In recent years, significant progress has been made in the field of state transfer in spin chains, with the aim of achieving perfect state transfer for quantum information processing applications. Previous research has mainly focused on…