Qiu, Daowen; Luo, Le; Xiao, Ligang Distributed Grover’s algorithm. (English) Zbl 07819256 Theor. Comput. Sci. 993, Article ID 114461, 12 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Qiu} et al., Theor. Comput. Sci. 993, Article ID 114461, 12 p. (2024; Zbl 07819256) Full Text: DOI arXiv
Qiu, Daowen Learning quantum Finite automata with queries. (English) Zbl 07813379 Math. Struct. Comput. Sci. 34, No. 2, 128-146 (2024). MSC: 68-XX PDFBibTeX XMLCite \textit{D. Qiu}, Math. Struct. Comput. Sci. 34, No. 2, 128--146 (2024; Zbl 07813379) Full Text: DOI arXiv
Xu, Guoliang; Qiu, Daowen From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm. (English) Zbl 1509.81312 Quantum Inf. Process. 20, No. 1, Paper No. 33, 55 p. (2021). MSC: 81P68 06E30 68Q12 PDFBibTeX XMLCite \textit{G. Xu} and \textit{D. Qiu}, Quantum Inf. Process. 20, No. 1, Paper No. 33, 55 p. (2021; Zbl 1509.81312) Full Text: DOI
Gruska, Jozef; Qiu, Daowen; Zheng, Shenggen Generalizations of the distributed Deutsch-Jozsa promise problem. (English) Zbl 1364.68211 Math. Struct. Comput. Sci. 27, No. 3, 311-331 (2017). MSC: 68Q10 68Q12 68Q45 81P68 PDFBibTeX XMLCite \textit{J. Gruska} et al., Math. Struct. Comput. Sci. 27, No. 3, 311--331 (2017; Zbl 1364.68211) Full Text: DOI arXiv
Zheng, Shenggen; Li, Lvzhou; Qiu, Daowen; Gruska, Jozef Promise problems solved by quantum and classical finite automata. (English) Zbl 1359.68181 Theor. Comput. Sci. 666, 48-64 (2017). MSC: 68Q45 68Q05 68Q12 PDFBibTeX XMLCite \textit{S. Zheng} et al., Theor. Comput. Sci. 666, 48--64 (2017; Zbl 1359.68181) Full Text: DOI arXiv
Li, Kai; Qiu, Daowen; Li, Lvzhou; Zheng, Shenggen; Rong, Zhenbang Application of distributed semi-quantum computing model in phase estimation. (English) Zbl 1401.68082 Inf. Process. Lett. 120, 23-29 (2017). MSC: 68Q05 68Q10 68Q12 68W20 68W25 81P68 PDFBibTeX XMLCite \textit{K. Li} et al., Inf. Process. Lett. 120, 23--29 (2017; Zbl 1401.68082) Full Text: DOI
Gruska, Jozef; Qiu, Daowen; Zheng, Shenggen Potential of quantum finite automata with exact acceptance. (English) Zbl 1327.81128 Int. J. Found. Comput. Sci. 26, No. 3, 381-398 (2015). MSC: 81P68 68Q45 PDFBibTeX XMLCite \textit{J. Gruska} et al., Int. J. Found. Comput. Sci. 26, No. 3, 381--398 (2015; Zbl 1327.81128) Full Text: DOI arXiv
Zheng, Shenggen; Qiu, Daowen; Gruska, Jozef Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata. (English) Zbl 1309.68074 Inf. Comput. 241, 197-214 (2015). MSC: 68Q05 68Q45 81P68 PDFBibTeX XMLCite \textit{S. Zheng} et al., Inf. Comput. 241, 197--214 (2015; Zbl 1309.68074) Full Text: DOI arXiv
Qiu, Daowen; Li, Lvzhou; Mateus, Paulo; Sernadas, Amilcar Exponentially more concise quantum recognition of non-RMM regular languages. (English) Zbl 1401.81039 J. Comput. Syst. Sci. 81, No. 2, 359-375 (2015). MSC: 81P68 68Q12 68Q45 PDFBibTeX XMLCite \textit{D. Qiu} et al., J. Comput. Syst. Sci. 81, No. 2, 359--375 (2015; Zbl 1401.81039) Full Text: DOI
Zheng, Shenggen; Qiu, Daowen From quantum query complexity to state complexity. (English) Zbl 1323.68349 Calude, Cristian S. (ed.) et al., Computing with new resources. Essays dedicated to Jozef Gruska on the occasion of his 80th birthday. Cham: Springer (ISBN 978-3-319-13349-2/pbk; 978-3-319-13350-8/ebook). Lecture Notes in Computer Science 8808, 231-245 (2014). MSC: 68Q45 68Q12 PDFBibTeX XMLCite \textit{S. Zheng} and \textit{D. Qiu}, Lect. Notes Comput. Sci. 8808, 231--245 (2014; Zbl 1323.68349) Full Text: DOI arXiv
Zheng, Shenggen; Qiu, Daowen; Gruska, Jozef; Li, Lvzhou; Mateus, Paulo State succinctness of two-way finite automata with quantum and classical states. (English) Zbl 1296.68098 Theor. Comput. Sci. 499, 98-112 (2013). MSC: 68Q45 68Q05 81P68 PDFBibTeX XMLCite \textit{S. Zheng} et al., Theor. Comput. Sci. 499, 98--112 (2013; Zbl 1296.68098) Full Text: DOI arXiv
Zheng, Shenggen; Qiu, Daowen; Li, Lvzhou Some languages recognized by two-way finite automata with quantum and classical states. (English) Zbl 1259.68117 Int. J. Found. Comput. Sci. 23, No. 5, 1117-1130 (2012). MSC: 68Q45 68Q12 PDFBibTeX XMLCite \textit{S. Zheng} et al., Int. J. Found. Comput. Sci. 23, No. 5, 1117--1130 (2012; Zbl 1259.68117) Full Text: DOI arXiv
Wu, Lihua; Qiu, Daowen; Xing, Hongyan Automata theory based on complete residuated lattice-valued logic: Turing machines. (English) Zbl 1252.03099 Fuzzy Sets Syst. 208, 43-66 (2012). MSC: 03D10 03D05 PDFBibTeX XMLCite \textit{L. Wu} et al., Fuzzy Sets Syst. 208, 43--66 (2012; Zbl 1252.03099) Full Text: DOI
Mateus, Paulo; Qiu, Daowen; Li, Lvzhou On the complexity of minimizing probabilistic and quantum automata. (English) Zbl 1279.68164 Inf. Comput. 218, 36-53 (2012). MSC: 68Q45 68Q25 68Q12 68Q87 PDFBibTeX XMLCite \textit{P. Mateus} et al., Inf. Comput. 218, 36--53 (2012; Zbl 1279.68164) Full Text: DOI
Zheng, Shenggen; Qiu, Daowen; Li, Lvzhou; Gruska, Jozef One-way finite automata with quantum and classical states. (English) Zbl 1330.68183 Bordihn, Henning (ed.) et al., Languages alive. Essays dedicated to Jürgen Dassow on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-31643-2/pbk). Lecture Notes in Computer Science 7300, 273-290 (2012). MSC: 68Q45 68Q05 81P68 PDFBibTeX XMLCite \textit{S. Zheng} et al., Lect. Notes Comput. Sci. 7300, 273--290 (2012; Zbl 1330.68183) Full Text: DOI arXiv
Li, Lvzhou; Qiu, Daowen; Zou, Xiangfu; Li, Lvjun; Wu, Lihua; Mateus, Paulo Characterizations of one-way general quantum finite automata. (English) Zbl 1235.68102 Theor. Comput. Sci. 419, 73-91 (2012). MSC: 68Q45 68Q12 PDFBibTeX XMLCite \textit{L. Li} et al., Theor. Comput. Sci. 419, 73--91 (2012; Zbl 1235.68102) Full Text: DOI arXiv
Qiu, Daowen; Li, Lvzhou; Zou, Xiangfu; Mateus, Paulo; Gruska, Jozef Multi-letter quantum finite automata: decidability of the equivalence and minimization of states. (English) Zbl 1233.68154 Acta Inf. 48, No. 5-6, 271-290 (2011). MSC: 68Q45 68Q12 68Q25 PDFBibTeX XMLCite \textit{D. Qiu} et al., Acta Inf. 48, No. 5--6, 271--290 (2011; Zbl 1233.68154) Full Text: DOI
Li, Lvzhou; Qiu, Daowen A note on quantum sequential machines. (English) Zbl 1172.68019 Theor. Comput. Sci. 410, No. 26, 2529-2535 (2009). MSC: 68Q05 68Q45 81P68 PDFBibTeX XMLCite \textit{L. Li} and \textit{D. Qiu}, Theor. Comput. Sci. 410, No. 26, 2529--2535 (2009; Zbl 1172.68019) Full Text: DOI
Li, Lvzhou; Qiu, Daowen Determining the equivalence for one-way quantum finite automata. (English) Zbl 1175.68250 Theor. Comput. Sci. 403, No. 1, 42-51 (2008). MSC: 68Q45 68Q05 81P68 PDFBibTeX XMLCite \textit{L. Li} and \textit{D. Qiu}, Theor. Comput. Sci. 403, No. 1, 42--51 (2008; Zbl 1175.68250) Full Text: DOI arXiv
Qiu, Daowen Automata theory based on quantum logic: reversibilities and pushdown automata. (English) Zbl 1137.68036 Theor. Comput. Sci. 386, No. 1-2, 38-56 (2007). MSC: 68Q45 81P68 81P10 68Q05 03G12 PDFBibTeX XMLCite \textit{D. Qiu}, Theor. Comput. Sci. 386, No. 1--2, 38--56 (2007; Zbl 1137.68036) Full Text: DOI
Qiu, Daowen Notes on automata theory based on quantum logic. (English) Zbl 1121.68068 Sci. China, Ser. F. 50, No. 2, 154-169 (2007). MSC: 68Q45 68Q10 81P68 03G12 PDFBibTeX XMLCite \textit{D. Qiu}, Sci. China, Ser. F 50, No. 2, 154--169 (2007; Zbl 1121.68068) Full Text: DOI
Li, Lvzhou; Qiu, Daowen Determination of equivalence between quantum sequential machines. (English) Zbl 1097.68040 Theor. Comput. Sci. 358, No. 1, 65-74 (2006). MSC: 68Q05 68Q10 81P68 PDFBibTeX XMLCite \textit{L. Li} and \textit{D. Qiu}, Theor. Comput. Sci. 358, No. 1, 65--74 (2006; Zbl 1097.68040) Full Text: DOI
Qiu, Daowen Automata theory based on quantum logic: Some characterizations. (English) Zbl 1074.68020 Inf. Comput. 190, No. 2, 179-195 (2004). MSC: 68Q05 03G12 81P68 PDFBibTeX XMLCite \textit{D. Qiu}, Inf. Comput. 190, No. 2, 179--195 (2004; Zbl 1074.68020) Full Text: DOI