Related papers: Quantum Finite State Transducers
Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory for a fingerprinting operator which returns the length-weighted…
We introduce a quantum-like classical computational model, called affine computation, as a generalization of probabilistic computation. After giving the basics of affine computation, we define affine finite automata (AfA) and compare it…
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
Quantum state tomography (QST) is the process of reconstructing the state of a quantum system (mathematically described as a density matrix) through a series of different measurements, which can be solved by learning a parameterized…
We prove the following facts about the language recognition power of quantum Turing machines (QTMs) in the unbounded error setting: QTMs are strictly more powerful than probabilistic Turing machines for any common space bound $ s $…
In the paper is discussed complete probabilistic description of quantum systems with application to multiqubit quantum computations. In simplest case it is a set of probabilities of transitions to some fixed set of states. The probabilities…
The quantum state transmission (QST) through the medium of high-dimensional many-particle system is studied with a symmetry analysis. We discover that, if the spectrum matches the symmetry of a fermion or boson system in a certain fashion,…
The use of d-state systems, or qudits, in quantum information processing is discussed. Three-state and higher dimensional quantum systems are known to have very different properties from two-state systems, i.e., qubits. In particular there…
We present new results on realtime alternating, private alternating, and quantum alternating automaton models. Firstly, we show that the emptiness problem for alternating one-counter automata on unary alphabets is undecidable. Then, we…
We construct a probabilistic finite automaton (PFA) with 7 states and an input alphabet of 5 symbols for which the PFA Emptiness Problem is undecidable. The only input for the decision problem is the starting distribution. For the proof, we…
From a physicist's standpoint, the most interesting part of quantum computing research may well be the possibility to probe the boundary between the quantum and the classical worlds. The more macroscopic are the structures involved, the…
A fundamental task in quantum information science is to transfer an unknown state from particle $A$ to particle $B$ (often in remote space locations) by using a bipartite quantum operation $\mathcal{E}^{AB}$. We suggest the power of…
Does the notion of a quantum randomized or nondeterministic algorithm make sense, and if so, does quantum randomness or nondeterminism add power? Although reasonable quantum random sources do not add computational power, the discussion of…
We investigate permutation-invariant continuous variable quantum states and their covariance matrices. We provide a complete characterization of the latter with respect to permutation-invariance, exchangeability and representing convex…
An iterated uniform finite-state transducer (IUFST) runs the same length-preserving transduction, starting with a sweep on the input string and then iteratively sweeping on the output of the previous sweep. The IUFST accepts the input…
We examine the complexity of learning the distributions produced by finite-state quantum sources. We show how prior techniques for learning hidden Markov models can be adapted to the quantum generator model to find that the analogous state…
We study the stabilities of quantum states of macroscopic systems, against noises, against perturbations from environments, and against local measurements. We show that the stabilities are closely related to the cluster property, which…
We study the quantum state transfer (QST) of a class of tight-bonding Bloch electron systems with mirror symmetry by considering the mode entanglement. Some rigorous results are obtained to reveal the intrinsic relationship between the…
In this thesis, we introduce a new quantum Turing machine (QTM) model that supports general quantum operators, together with its pushdown, counter, and finite automaton variants, and examine the computational power of classical and quantum…
A quantum finite-state automaton (QFA) is a theoretical model designed to simulate the evolution of a quantum system with finite memory in response to sequential input strings. We define the language of a QFA as the set of strings that lead…