default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShenggen Zheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Shenggen Zheng
, Yaqiao Li, Minghua Pan, Jozef Gruska, Lvzhou Li:
Lifting query complexity to time-space complexity for two-way finite automata. J. Comput. Syst. Sci. 141: 103494 (2024)- [j23]Xiangfu Zou, Xin Wang, Shenggen Zheng, Zhenbang Rong, Zhiming Huang, Ying Chen, Jianfeng Liu, Xueying Liang, Jianxiong Wu:
Problems of a quantum secure direct communication scheme based on intermediate-basis. Quantum Inf. Process. 23(6): 218 (2024) - [c10]Zhimin He, Maijie Deng, Shenggen Zheng, Lvzhou Li, Haozhen Situ:
Training-Free Quantum Architecture Search. AAAI 2024: 12430-12438 - 2023
- [j22]Yang Qian, Zhijin Guan, Shenggen Zheng, Shiguang Feng:
A Method Based on Timing Weight Priority and Distance Optimization for Quantum Circuit Transformation. Entropy 25(3): 465 (2023) - [j21]Minghua Pan, Taiping Xiong, Shenggen Zheng:
Performance of Grover's search algorithm with diagonalizable collective noises. Quantum Inf. Process. 22(6): 238 (2023) - [j20]Ying Chen, Xiangfu Zou, Xin Wang, Jianfeng Liu, Zhenbang Rong, Zhiming Huang, Shenggen Zheng, Xueying Liang, Jianxiong Wu:
Two intercept-and-resend attacks on a bidirectional quantum secure direct communication and its improvement. Quantum Inf. Process. 22(9): 346 (2023) - [j19]Jianfeng Liu, Xiangfu Zou, Xin Wang, Ying Chen, Zhenbang Rong, Zhiming Huang, Shenggen Zheng, Xueying Liang, Jianxiong Wu:
Discussion on the initial states of controlled bidirectional quantum secure direct communication. Quantum Inf. Process. 22(12): 426 (2023) - [c9]Jiaxi Zhang, Shenggen Zheng, Liwei Ni, Huawei Li, Guojie Luo:
Rethinking NPN Classification from Face and Point Characteristics of Boolean Functions. DATE 2023: 1-6 - [c8]Yonghe Zhang, Liwei Ni, Jiaxi Zhang, Guojie Luo, Huawei Li, Shenggen Zheng:
Fast Exact NPN Classification with Influence-Aided Canonical Form. ICCAD 2023: 1-9 - [i19]Jiaxi Zhang, Shenggen Zheng, Liwei Ni, Huawei Li, Guojie Luo:
Rethinking NPN Classification from Face and Point Characteristics of Boolean Functions. CoRR abs/2301.12122 (2023) - [i18]Yonghe Zhang, Liwei Ni, Jiaxi Zhang, Guojie Luo, Huawei Li, Shenggen Zheng:
Fast Exact NPN Classification with Influence-aided Canonical Form. CoRR abs/2308.12311 (2023) - [i17]Shenggen Zheng, Yaqiao Li, Minghua Pan, Jozef Gruska, Lvzhou Li:
Lifting query complexity to time-space complexity for two-way finite automata. CoRR abs/2311.18220 (2023) - 2022
- [j18]Pengcheng Zhu, Shenggen Zheng, Lihua Wei, Xueyun Cheng, Zhijin Guan, Shiguang Feng:
The complexity of quantum circuit mapping with fixed parameters. Quantum Inf. Process. 21(1) (2022) - [i16]Pengcheng Zhu, Shenggen Zheng, Lihua Wei, Xueyun Cheng, Zhijin Guan, Shiguang Feng:
The Complexity of Quantum Circuit Mapping with Fixed Parameters. CoRR abs/2207.08438 (2022) - 2021
- [c7]Jiaxi Zhang, Liwei Ni, Shenggen Zheng, Hao Liu, Xiangfu Zou, Feng Wang, Guojie Luo:
Enhanced Fast Boolean Matching based on Sensitivity Signatures Pruning. ICCAD 2021: 1-9 - [i15]Zhimin He, Lvzhou Li, Shenggen Zheng, Yongyao Li, Haozhen Situ:
Variational quantum compiling with double Q-learning. CoRR abs/2103.11611 (2021) - [i14]Jiaxi Zhang, Liwei Ni, Shenggen Zheng, Hao Liu, Xiangfu Zou, Feng Wang, Guojie Luo:
Enhanced Fast Boolean Matching based on Sensitivity Signatures Pruning. CoRR abs/2111.06213 (2021) - 2020
- [j17]Daowen Qiu, Shenggen Zheng:
Revisiting Deutsch-Jozsa algorithm. Inf. Comput. 275: 104605 (2020) - [j16]Haozhen Situ, Zhimin He, Yuyi Wang, Lvzhou Li, Shenggen Zheng:
Quantum generative adversarial network for generating discrete distribution. Inf. Sci. 538: 193-208 (2020) - [j15]Haozhen Situ, Zhiming Huang, Xiangfu Zou, Shenggen Zheng:
The influence of correlated noise on the SDC protocol. Quantum Inf. Process. 19(2): 48 (2020) - [j14]Amandeep Singh Bhatia, Mandeep Kaur Saggi, Shenggen Zheng:
QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution. Quantum Inf. Process. 19(9): 345 (2020) - [c6]Maolin Wang, Zeyong Su, Xu Luo, Yu Pan, Shenggen Zheng, Zenglin Xu:
Concatenated Tensor Networks for Deep Multi-Task Learning. ICONIP (5) 2020: 517-525 - [i13]Amandeep Singh Bhatia, Mandeep Kaur Saggi, Shenggen Zheng, Soumya Ranjan Nayak:
QPSO-CD: Quantum-behaved Particle Swarm Optimization Algorithm with Cauchy Distribution. CoRR abs/2006.16989 (2020) - [i12]Amandeep Singh Bhatia, Shenggen Zheng:
A Quantum Finite Automata Approach to Modeling the Chemical Reactions. CoRR abs/2007.03976 (2020) - [i11]Amandeep Singh Bhatia, Shenggen Zheng:
RNA-2QCFA: Evolving Two-way Quantum Finite Automata with Classical States for RNA Secondary Structures. CoRR abs/2007.06273 (2020)
2010 – 2019
- 2019
- [j13]Zhiwei Sun, Chunhui Wu, Shenggen Zheng, Cai Zhang:
Efficient Multiparty Quantum Key Agreement With a Single $d$ -Level Quantum System Secure Against Collusive Attack. IEEE Access 7: 102377-102385 (2019) - [j12]Haozhen Situ, Zhiming Huang, Xiangfu Zou, Shenggen Zheng:
Variational learning the SDC quantum protocol with gradient-based optimization. Quantum Inf. Process. 18(7): 230 (2019) - [j11]Zhimin He, Lvzhou Li, Shenggen Zheng, Xiangfu Zou, Haozhen Situ:
Quantum speedup for pool-based active learning. Quantum Inf. Process. 18(11): 345 (2019) - 2017
- [j10]Kai Li, Daowen Qiu, Lvzhou Li, Shenggen Zheng, Zhenbang Rong:
Application of distributed semi-quantum computing model in phase estimation. Inf. Process. Lett. 120: 23-29 (2017) - [j9]Jozef Gruska, Daowen Qiu, Shenggen Zheng:
Generalizations of the distributed Deutsch-Jozsa promise problem. Math. Struct. Comput. Sci. 27(3): 311-331 (2017) - [j8]Minghua Pan, Daowen Qiu, Shenggen Zheng:
Global multipartite entanglement dynamics in Grover's search algorithm. Quantum Inf. Process. 16(9): 211 (2017) - [j7]Shenggen Zheng, Lvzhou Li, Daowen Qiu, Jozef Gruska:
Promise problems solved by quantum and classical finite automata. Theor. Comput. Sci. 666: 48-64 (2017) - [c5]Shenggen Zheng, Daowen Qiu, Jozef Gruska:
Time-Space Complexity Advantages for Quantum Computing. TPNC 2017: 305-317 - 2016
- [i10]Daowen Qiu, Shenggen Zheng:
Characterizations of symmetrically partial Boolean functions with exact quantum query complexity. CoRR abs/1603.06505 (2016) - 2015
- [j6]Shenggen Zheng, Daowen Qiu, Jozef Gruska:
Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata. Inf. Comput. 241: 197-214 (2015) - [j5]Jozef Gruska, Daowen Qiu, Shenggen Zheng:
Potential of Quantum Finite Automata with Exact Acceptance. Int. J. Found. Comput. Sci. 26(3): 381-398 (2015) - [j4]Andris Ambainis, Jozef Gruska, Shenggen Zheng:
Exact quantum algorithms have advantage for almost all Boolean functions. Quantum Inf. Comput. 15(5&6): 435-452 (2015) - 2014
- [j3]Shenggen Zheng, Jozef Gruska, Daowen Qiu:
On the state complexity of semi-quantum finite automata. RAIRO Theor. Informatics Appl. 48(2): 187-207 (2014) - [c4]Shenggen Zheng, Daowen Qiu:
From Quantum Query Complexity to State Complexity. Computing with New Resources 2014: 231-245 - [c3]Shenggen Zheng, Jozef Gruska, Daowen Qiu:
On the State Complexity of Semi-quantum Finite Automata. LATA 2014: 601-612 - [i9]Jozef Gruska, Daowen Qiu, Shenggen Zheng:
Generalizations of the distributed Deutsch-Jozsa promise problem. CoRR abs/1402.7254 (2014) - [i8]Andris Ambainis, Jozef Gruska, Shenggen Zheng:
Exact query complexity of some special classes of Boolean functions. CoRR abs/1404.1684 (2014) - [i7]Jozef Gruska, Daowen Qiu, Shenggen Zheng:
Potential of quantum finite automata with exact acceptance. CoRR abs/1404.1689 (2014) - [i6]Shenggen Zheng, Daowen Qiu:
From Quantum Query Complexity to State Complexity. CoRR abs/1407.7342 (2014) - [i5]Jozef Gruska, Lvzhou Li, Shenggen Zheng:
Recognizability versus solvability of promise problems in finite, classical and quantum automata, framework. CoRR abs/1411.3870 (2014) - 2013
- [j2]Shenggen Zheng, Daowen Qiu, Jozef Gruska, Lvzhou Li, Paulo Mateus:
State succinctness of two-way finite automata with quantum and classical states. Theor. Comput. Sci. 499: 98-112 (2013) - [i4]Shenggen Zheng, Jozef Gruska, Daowen Qiu:
Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata. CoRR abs/1304.3876 (2013) - [i3]Shenggen Zheng, Jozef Gruska, Daowen Qiu:
On the state complexity of semi-quantum finite automata. CoRR abs/1307.2499 (2013) - [i2]Jozef Gruska, Daowen Qiu, Shenggen Zheng:
Communication complexity of promise problems and their applications to finite automata. CoRR abs/1309.7739 (2013) - 2012
- [j1]Shenggen Zheng, Daowen Qiu, Lvzhou Li:
Some Languages Recognized by Two-Way Finite Automata with Quantum and Classical States. Int. J. Found. Comput. Sci. 23(5): 1117-1130 (2012) - [c2]Shenggen Zheng, Daowen Qiu, Lvzhou Li, Jozef Gruska:
One-Way Finite Automata with Quantum and Classical States. Languages Alive 2012: 273-290 - [c1]Shenggen Zheng, Daowen Qiu, Lvzhou Li:
State Succinctness of two-Way finite Automata with quantum and Classical States. QLSC 2012 - [i1]Shenggen Zheng, Daowen Qiu, Lvzhou Li:
State succinctness of two-way finite automata with quantum and classical states. CoRR abs/1202.2651 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
