Superiority of one-way and realtime quantum machines
From MaRDI portal
Publication:4649459
DOI10.1051/ita/2012018zbMath1279.68090OpenAlexW2152666452MaRDI QIDQ4649459
Publication date: 22 November 2012
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2012__46_4_615_0/
quantum computationnondeterminismquantum automatabounded errormultihead finite automatablind counter automata
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Classical and Quantum Counter Automata on Promise Problems ⋮ Exact Affine Counter Automata ⋮ Unnamed Item ⋮ Quantum \(\omega\)-automata over infinite words and their relationships ⋮ Quantum Pushdown Automata with Garbage Tape ⋮ New Results on Vector and Homing Vector Automata ⋮ New Results on the Minimum Amount of Useful Space ⋮ Uncountable classical and quantum complexity classes
This page was built for publication: Superiority of one-way and realtime quantum machines
