From Quantum Query Complexity to State Complexity
Computational Complexity
2014-11-26 v2 Quantum Physics
Abstract
State complexity of quantum finite automata is one of the interesting topics in studying the power of quantum finite automata. It is therefore of importance to develop general methods how to show state succinctness results for quantum finite automata. One such method is presented and demonstrated in this paper. In particular, we show that state succinctness results can be derived out of query complexity results.
Keywords
Cite
@article{arxiv.1407.7342,
title = {From Quantum Query Complexity to State Complexity},
author = {Shenggen Zheng and Daowen Qiu},
journal= {arXiv preprint arXiv:1407.7342},
year = {2014}
}
Comments
Some typos in references were fixed. To appear in Gruska Festschrift (2014). Comments are welcome. arXiv admin note: substantial text overlap with arXiv:1402.7254, arXiv:1309.7739