Paper Info
Title
Quantum Alternation.
Abstract
We introduce quantum alternation as a generalization of quantum nondeterminism. We define q-alternating Turing machine (qATM) by augmenting alternating Turing machine with constant-size quantum memory. We show that one-way constant-space qATMs (1AQFAs) are Turing equivalent. Then, we introduce strong version of qATM by requiring to halt in every computation path and we show that strong qATMs can simulate deterministic spacewith exponentially less space. This leads to shifting the deterministic space hierarchy exactly by one level. We also focus on realtime versions of 1AQFAs (rtAQFAs) and obtain many results: rtAQFAs can recognize a PSPACE-complete problem; they cannot be simulated by sublinear deterministic Turing machines; for any level of polynomial hierarchy, say k, there exists a complete language that can be recognized by rtAFAs with only (k +1) alternations; and polynomial hierarchy lies in its log-space q-alternation counterpart.
Year
DOI
Venue
2013
10.1134/S1995080216060196
CSR
Keywords
DocType
Volume
Alternation, quantum computation, quantum automata, PSPACE, logspace, polynomial hierarchy, subset-sum problems
Conference
37
Issue
ISSN
Citations 
6
1818-9962
0
PageRank 
References 
Authors
0.34
1
1
Name
Order
Citations
PageRank
Abuzer Yakaryilmaz116825.31