{"title":"Quantum Büchi automata","authors":"","doi":"10.1016/j.tcs.2024.114740","DOIUrl":null,"url":null,"abstract":"<div><p>Quantum finite automata (QFAs) have been extensively studied in the literature. In this paper, we define and systematically study quantum Büchi automata (QBAs) over infinite words to model the long-term behavior of quantum systems, which extend QFAs. We introduce the classes of <em>ω</em>-languages recognized by QBAs in probable, almost sure, strict and non-strict threshold semantics. Several pumping lemmas and closure properties for QBAs are proved. Some decision problems for QBAs are investigated. In particular, we show that there are surprisingly only at most four substantially different classes of <em>ω</em>-languages recognized by QBAs (out of uncountably infinite). The relationship between classical <em>ω</em>-languages and QBAs is clarified using our pumping lemmas. We also find an <em>ω</em>-language recognized by QBAs under the almost sure semantics, which is not <em>ω</em>-context-free.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524003578","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Quantum finite automata (QFAs) have been extensively studied in the literature. In this paper, we define and systematically study quantum Büchi automata (QBAs) over infinite words to model the long-term behavior of quantum systems, which extend QFAs. We introduce the classes of ω-languages recognized by QBAs in probable, almost sure, strict and non-strict threshold semantics. Several pumping lemmas and closure properties for QBAs are proved. Some decision problems for QBAs are investigated. In particular, we show that there are surprisingly only at most four substantially different classes of ω-languages recognized by QBAs (out of uncountably infinite). The relationship between classical ω-languages and QBAs is clarified using our pumping lemmas. We also find an ω-language recognized by QBAs under the almost sure semantics, which is not ω-context-free.
期刊介绍:
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.