相关论文: Quantum Finite State Transducers

We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error QFAs are more powerful than PFAs. But, in contrary to the…

We give an elementary introduction to the notion of quantum entanglement between distinguishable parties and review a recent proposal about solid state quantum computation with spin-qubits in quantum dots. The indistinguishable character of…

Motivated by studies of typical properties of quantum states in statistical mechanics, we introduce phase-random states, an ensemble of pure states with fixed amplitudes and uniformly distributed phases in a fixed basis. We first show that…

In recent years, quantum computing has promised a revolution in computing performance, based on massive parallelism enabled by many entangled qubits. Josephson junction integrated circuits have emerged as the key technology to implement…

Quantum finite automata (QFA) are basic computational devices that make binary decisions using quantum operations. They are known to be exponentially memory efficient compared to their classical counterparts. Here, we demonstrate an…

The speed limit of quantum state transfer (QST) in a system of interacting particles is not only important for quantum information processing, but also directly linked to Lieb-Robinson-type bounds that are crucial for understanding various…

Probabilistic cellular automata with deterministic updating are quantum systems. We employ the quantum formalism for an investigation of random probabilistic cellular automata, which start with a probability distribution over initial…

One of the most central and controversial element of quantum mechanics is the use of non zero vectors of a Hilbert space (or, more generally, of one dimension subspaces) for representing the state of a quantum system. In particular, the…

A general formulation of classical relativistic particle mechanics is presented, with an emphasis on the fact that superluminal velocities and nonlocal interactions are compatible with relativity. Then a manifestly relativistic-covariant…

This paper suggests that traditional fermi-bose quantum field theories (QFT) in 3+1-D, like the standard model of physics, may often be exactly equivalent to the limiting case of a family of bosonic QFT (BQFT) which generate soliton…

Based on the {\it nonlinear coherent states} method, a general and simple algebraic formalism for the construction of \textit{`$f$-deformed intelligent states'} has been introduced. The structure has the potentiality to apply to systems…

Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. This is a brief review in which we consider the problem for states in infinite dimensional Hilbert spaces.…

This paper identifies exact probabilistic simulation cost as the natural quantitative measure of quantum advantage for finite automata under strict cutpoints. It gives sharp simulation laws for two representative models. A one-way finite…

Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particular interest is the 2-way model of Ambainis and Watrous that has both quantum and classical states (2QCFA) [A.…

A new approach is demonstrated that QFTs can be UV finite if they are viewed as the low energy effective theories of a fundamental underlying theory (that is complete and well-defined in all respects) according to the nowaday's standard…

Although quantum states nicely express interference effects, outcomes of experimental trials show no states directly; they indicate properties of probability distributions for outcomes. We prove categorically that probability distributions…

Several finite dimensional quasi-probability representations of quantum states have been proposed to study various problems in quantum information theory and quantum foundations. These representations are often defined only on restricted…

Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpoint over the field of real numbers. More general computational models over the same field such as generalized finite automata (GFAs) and…

We model the transport of an unknown quantum state on one dimensional qubit lattices by means of a quantum cellular automata evolution. We do this by first introducing a class of discrete noisy dynamics, in the first excitation sector, in…

States in quantum field theory (QFT) are represented by many-particle wave functions, such that a state describing n particles depends on n spacetime positions. Since a general state is a superposition of states with different numbers of…