Shenggen Zheng

Orcid: 0000-0001-7325-2506

According to our database1, Shenggen Zheng authored at least 41 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Problems of a quantum secure direct communication scheme based on intermediate-basis.
Quantum Inf. Process., June, 2024

Lifting query complexity to time-space complexity for two-way finite automata.
J. Comput. Syst. Sci., May, 2024

Training-Free Quantum Architecture Search.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Discussion on the initial states of controlled bidirectional quantum secure direct communication.
Quantum Inf. Process., December, 2023

Two intercept-and-resend attacks on a bidirectional quantum secure direct communication and its improvement.
Quantum Inf. Process., September, 2023

A Method Based on Timing Weight Priority and Distance Optimization for Quantum Circuit Transformation.
Entropy, March, 2023

Performance of Grover's search algorithm with diagonalizable collective noises.
Quantum Inf. Process., 2023

Fast Exact NPN Classification with Influence-Aided Canonical Form.
Proceedings of the IEEE/ACM International Conference on Computer Aided Design, 2023

Rethinking NPN Classification from Face and Point Characteristics of Boolean Functions.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2023

2022
The complexity of quantum circuit mapping with fixed parameters.
Quantum Inf. Process., 2022

2021
Variational quantum compiling with double Q-learning.
CoRR, 2021

Enhanced Fast Boolean Matching based on Sensitivity Signatures Pruning.
Proceedings of the IEEE/ACM International Conference On Computer Aided Design, 2021

2020
The influence of correlated noise on the SDC protocol.
Quantum Inf. Process., 2020

QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution.
Quantum Inf. Process., 2020

Quantum generative adversarial network for generating discrete distribution.
Inf. Sci., 2020

Revisiting Deutsch-Jozsa algorithm.
Inf. Comput., 2020

RNA-2QCFA: Evolving Two-way Quantum Finite Automata with Classical States for RNA Secondary Structures.
CoRR, 2020

A Quantum Finite Automata Approach to Modeling the Chemical Reactions.
CoRR, 2020

QPSO-CD: Quantum-behaved Particle Swarm Optimization Algorithm with Cauchy Distribution.
CoRR, 2020

Concatenated Tensor Networks for Deep Multi-Task Learning.
Proceedings of the Neural Information Processing - 27th International Conference, 2020

2019
Variational learning the SDC quantum protocol with gradient-based optimization.
Quantum Inf. Process., 2019

Quantum speedup for pool-based active learning.
Quantum Inf. Process., 2019

Efficient Multiparty Quantum Key Agreement With a Single $d$ -Level Quantum System Secure Against Collusive Attack.
IEEE Access, 2019

2017
Promise problems solved by quantum and classical finite automata.
Theor. Comput. Sci., 2017

Global multipartite entanglement dynamics in Grover's search algorithm.
Quantum Inf. Process., 2017

Generalizations of the distributed Deutsch-Jozsa promise problem.
Math. Struct. Comput. Sci., 2017

Application of distributed semi-quantum computing model in phase estimation.
Inf. Process. Lett., 2017

Time-Space Complexity Advantages for Quantum Computing.
Proceedings of the Theory and Practice of Natural Computing - 6th International Conference, 2017

2016
Characterizations of symmetrically partial Boolean functions with exact quantum query complexity.
CoRR, 2016

2015
Exact quantum algorithms have advantage for almost all Boolean functions.
Quantum Inf. Comput., 2015

Potential of Quantum Finite Automata with Exact Acceptance.
Int. J. Found. Comput. Sci., 2015

Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata.
Inf. Comput., 2015

2014
On the state complexity of semi-quantum finite automata.
RAIRO Theor. Informatics Appl., 2014

Recognizability versus solvability of promise problems in finite, classical and quantum automata, framework.
CoRR, 2014

Exact query complexity of some special classes of Boolean functions.
CoRR, 2014

From Quantum Query Complexity to State Complexity.
Proceedings of the Computing with New Resources, 2014

2013
State succinctness of two-way finite automata with quantum and classical states.
Theor. Comput. Sci., 2013

Communication complexity of promise problems and their applications to finite automata.
CoRR, 2013

2012
Some Languages Recognized by Two-Way Finite Automata with Quantum and Classical States.
Int. J. Found. Comput. Sci., 2012

State Succinctness of two-Way finite Automata with quantum and Classical States.
Proceedings of the Quantitative Logic and Soft Computing, 2012

One-Way Finite Automata with Quantum and Classical States.
Proceedings of the Languages Alive, 2012


  Loading...