Shenggen Zheng (郑盛根)
Shenggen Zheng
Professional info
I am associate professor in Peng Cheng Laboraty, Shenzhen, China.
I am interested in quantum computing, quantum algorithm, quantum query complexity, quantum communication complexity, quantum finite automata.
Work experience
Associate Research (equal to associate prof. in China )
07/2015 03/2018
School of Data and Computer Science, Sun Yat-sen University, Guangzhou, China
Postdoc
10/2012 -06/2015
Faculty of Informatics, Masaryk University, Czech Republic
Advisor: Jozef Gruska
Visiting Researcher
09/2013 - 12/2013, 04/2015
Faculty of Computing, University of Latvia, Latvia
Advisor: Andris Ambainis
Parttime Lecturer
09/2010 - 06/2012
Adult Education of School of Information and Technology Science, Sun Yat-sen University, China.
Teaching Assitant
09/2009 - 06/2010
2+2 Major (study in SYSU for 2 years and study in Hongkong for 2 years, English teaching classes) of School of Information and Technology Science, Sun Yat-sen University, China.
2010 - present
2010 - present
Education
Ph.D
2006 - 2012
Sun Yat-sen University, China
Major: Theoretical Computer Science, especially Quantum Computation
Thesis title: On the power and state complexity of finite automata with quantum and classical states
B.S
2002 - 2006
Guangdong University of Technology, China
Major: Computer Science
Papers
-
S.G. Zheng, L.Z. Li, D.W. Qiu, J. Gruska, Promise problems solved by quantum and classical finite automata,Theoretical Computer Science, to appear (2017), http://dx.doi.org/10.1016/j.tcs.2016.12.025. Alao arXiv:1411.3870.
-
K. Li, D.W. Qiu, , L.Z. Li, S.G Zheng, Z.B Rong, Application of distributed semi-quantum computing model in phase estimation, Information Processing Letters, 120, 23-29 (2017).
-
S.G. Zheng, J. Gruska, D.W. Qiu, Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata, Information & Computation, 241, 197-214 (2015). Also arXiv:1304.3876 (2013).
-
S.G. Zheng, D.W. Qiu, From quantum query complexity to state complexity, Jozef Gruska Festschrift, LNCS 8808, 231-245 (2014). Also arXiv:1407.7342.
-
A. Ambainis, J. Gruska, S.G. Zheng (Corresponding author), Exact quantum algorithms have advantage for almost all Boolean functions, Quantum Information & Computation, 15 (5&6), pp. 0435-0452 (2015). Also arXiv:1404.1684.
-
J. Gruska, D.W. Qiu, S.G. Zheng (Corresponding author), Potential of quantum finite automata with exact acceptance, International Journal of Foundation of Computer Science, 26, 381-398 (2015) . Also arXiv:1404.1689.
-
J. Gruska, D.W. Qiu, S.G. Zheng (Corresponding author), Generalizations of the distributed Deutsch-Jozsa promise problem, Mathematical Structures in Computer Science, DOI: http://dx.doi.org/10.1017/S0960129515000158, 21 pages (2015). Also arXiv:1402.7254 (2014).
-
S.G. Zheng, J. Gruska, D.W. Qiu, On the state complexity of semi-quantum finite automata, RAIRO-Inf. Theor. Appl., 48, 187-207 (2014). Earlier version at LATA'14. Also arXiv:1307.2499.
-
S.G. Zheng, D.W. Qiu, J. Gruska, L.Z. Li, P. Mateus, State succinctness of two-way finite automata with quantum and classical states, Theoretical Computer Science, 499, 98--112 (2013). Also arXiv:1202.2651.
-
S.G. Zheng, D.W. Qiu, L.Z. Li, J. Gruska, One-way finite automata with quantum and classical states, In: H. Bordihn, M. Kutrib, and B. Truthe (Eds.), Dassow Festschrift, LNCS 7300, pp. 273--290 (2012). Also arXiv:1112.2022.
-
S.G. Zheng, D.W. Qiu, L.Z. Li, Some languages recognized by two-way finite automata with quantum and classical states, International Journal of Foundations of Computer Science, 23, 1117-1129 (2012). Also arXiv:1112.2844.
-
S.G. Zheng, L.Z. Li, D.W. Qiu, Two-Tape Finite Automata with Quantum and Classical States, International Journal of Theoretical Physics, 50, 1262-1281 (2011). Also arXiv:1104.3634.
-
S.G. Zheng, L.Z. Li, D.W. Qiu, J. Gruska, Promise problems solved by quantum and classical finite automata,Theoretical Computer Science, to appear (2017), http://dx.doi.org/10.1016/j.tcs.2016.12.025. Alao arXiv:1411.3870.
-
K. Li, D.W. Qiu, , L.Z. Li, S.G Zheng, Z.B Rong, Application of distributed semi-quantum computing model in phase estimation, Information Processing Letters, 120, 23-29 (2017).
-
S.G. Zheng, J. Gruska, D.W. Qiu, Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata, Information & Computation, 241, 197-214 (2015). Also arXiv:1304.3876 (2013).
-
S.G. Zheng, D.W. Qiu, From quantum query complexity to state complexity, Jozef Gruska Festschrift, LNCS 8808, 231-245 (2014). Also arXiv:1407.7342.
-
A. Ambainis, J. Gruska, S.G. Zheng (Corresponding author), Exact quantum algorithms have advantage for almost all Boolean functions, Quantum Information & Computation, 15 (5&6), pp. 0435-0452 (2015). Also arXiv:1404.1684.
-
J. Gruska, D.W. Qiu, S.G. Zheng (Corresponding author), Potential of quantum finite automata with exact acceptance, International Journal of Foundation of Computer Science, 26, 381-398 (2015) . Also arXiv:1404.1689.
-
J. Gruska, D.W. Qiu, S.G. Zheng (Corresponding author), Generalizations of the distributed Deutsch-Jozsa promise problem, Mathematical Structures in Computer Science, DOI: http://dx.doi.org/10.1017/S0960129515000158, 21 pages (2015). Also arXiv:1402.7254 (2014).
-
S.G. Zheng, J. Gruska, D.W. Qiu, On the state complexity of semi-quantum finite automata, RAIRO-Inf. Theor. Appl., 48, 187-207 (2014). Earlier version at LATA'14. Also arXiv:1307.2499.
-
S.G. Zheng, D.W. Qiu, J. Gruska, L.Z. Li, P. Mateus, State succinctness of two-way finite automata with quantum and classical states, Theoretical Computer Science, 499, 98--112 (2013). Also arXiv:1202.2651.
-
S.G. Zheng, D.W. Qiu, L.Z. Li, J. Gruska, One-way finite automata with quantum and classical states, In: H. Bordihn, M. Kutrib, and B. Truthe (Eds.), Dassow Festschrift, LNCS 7300, pp. 273--290 (2012). Also arXiv:1112.2022.
-
S.G. Zheng, D.W. Qiu, L.Z. Li, Some languages recognized by two-way finite automata with quantum and classical states, International Journal of Foundations of Computer Science, 23, 1117-1129 (2012). Also arXiv:1112.2844.
-
S.G. Zheng, L.Z. Li, D.W. Qiu, Two-Tape Finite Automata with Quantum and Classical States, International Journal of Theoretical Physics, 50, 1262-1281 (2011). Also arXiv:1104.3634.
Conferences
-
[1] S.G. Zheng, Advantages of exact quantum query complexity, Workshop of Tensor Networks and Related Topics in Quantum Information Theory, 4-7 January 2017, Zhejiang University, Hangzhou, China. (An invited talk)
-
[2] S.G. Zheng, D.W. Qiu*, Time-space tradeoffs for two-way finite automata, 13th Central European Quantum Information Processing Workshop (CEQIP'2016) 16-19 June 2016, Valtice, Czech Republic. (A poster)
-
[3] A. Ambainis, S.G. Zheng*, Exact quantum algorithms have advantage for almost all Boolean functions, 12th Central European Quantum Information Processing Workshop (CEQIP'2015) 18-21 June 2015, Telc, Czech Republic. (An accepted talk)
-
[4] S.G. Zheng*, Revisit superiority of exact quantum automata for promise problems, 11th Central European Quantum Information Processing Workshop 5-8 June 2014, Znojmo, Czech Republic. (A poster)
-
[5] S.G. Zheng, J. Gruska, D.W. Qiu, On the state complexity of semi-quantum finite automata, 8th International Conference on Language and Automata Theory and Applications (LATA2014), LNCS 8370 (2014) 601-612, Madrid, Spain. (An accepted talk)
-
[6] J. Gruska, D.W. Qiu, S.G. Zheng, Communication complexity of promise problems and their applications to finite automata, XVII Conference on Quantum Information Processing (QIP2014), Barcelona, Spain. (A poster)
-
[7] S.G. Zheng*, J. Gruska, D.W.Qiu, On the state complexity of semi-quantum finite automata, 10th Central European Quantum Information Processing Workshop 5-9 June 2013, Valtice, Czech Republic. (A poster)
-
[8] S.G. Zheng, D.W. Qiu*, L.Z. Li, State succinctness of two-way finite automata with quantum and classical states, Quantitative Logic and Soft Computing (QL&SC2012),CEIS 5 (2012) 378-385, Xi'an, China. (An accepted talk)