Improved constructions of mixed state quantum automata

Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A. Ambainis and R. Freivalds that quantum finite automata with pure states can have an exponentially smaller number of states tha...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2009-05, Vol.410 (20), p.1923-1931
Hauptverfasser:	Freivalds, Rūsiņš, Ozols, Māris, Mančinska, Laura
Format:	Artikel
Sprache:	eng
Schlagworte:	Finite automata Permutation groups Quantum algorithms
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!