From Quantum Query Complexity to State Complexity
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F14%3A00079998" target="_blank" >RIV/00216224:14330/14:00079998 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-13350-8_18" target="_blank" >http://dx.doi.org/10.1007/978-3-319-13350-8_18</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-13350-8_18" target="_blank" >10.1007/978-3-319-13350-8_18</a>
Alternative languages
Result language
angličtina
Original language name
From Quantum Query Complexity to State Complexity
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/EE2.3.30.0009" target="_blank" >EE2.3.30.0009: Employment of Newly Graduated Doctors of Science for Scientific Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Computing with New Resources
ISBN
9783319133492
ISSN
0302-9743
e-ISSN
—
Number of pages
15
Pages from-to
231-245
Publisher name
Springer
Place of publication
Switzerland
Event location
Switzerland
Event date
Jan 1, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—