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.
Cite
CITATION STYLE
Zheng, S., & Qiu, D. (2014). From quantum query complexity to state complexity. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8808, 231–245. https://doi.org/10.1007/978-3-319-13350-8_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
