Exact results for accepting probabilities of quantum automata
✍ Scribed by Andris Ambainis; Arnolds Ķikusts
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 222 KB
- Volume
- 295
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
One of the properties of the Kondacs-Watrous model of quantum ÿnite automata (QFA) is that the probability of the correct answer for a QFA cannot be ampliÿed arbitrarily. In this paper, we determine the maximum probabilities achieved by QFAs for several languages. In particular, we show that any language that is not recognized by an RFA (reversible ÿnite automaton) can be recognized by a QFA with probability at most 0:7726 : : : .
📜 SIMILAR VOLUMES
We study two common types of time-noncontinuous updates for one-dimensional stochastic cellular automata with arbitrary nearest-neighbor interactions and arbitrary open boundary conditions. We first construct the stationary states using the matrix product formalism. This construction then allows to
There has been a great deal of interest over the last two decades on the fractional quantum Hall effect, a novel quantum many-body liquid state of strongly correlated two-dimensional electronic systems in a strong perpendicular magnetic field. The most pronounced fractional quantum Hall states occur
In a previous work [O. Ciftja, Physica B 404 (2009) 227] we reported the exact calculation of energies for the fractional quantum Hall Laughlin state at filling factor n ¼ 1 3 for systems with up to N ¼ 4 electrons in a disk geometry. The purpose of this brief extension of the earlier work is to rep