From Quantum Query Complexity to State Complexity
| Autoři | |
|---|---|
| Rok publikování | 2014 |
| Druh | Článek ve sborníku |
| Konference | Computing with New Resources |
| Fakulta / Pracoviště MU | |
| Citace | |
| Doi | http://dx.doi.org/10.1007/978-3-319-13350-8_18 |
| Obor | Informatika |
| Klíčová slova | General method; Quantum finite automata; Quantum query complexity; Query complexity; State complexity |
| Popis | 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. |
| Související projekty: |