165 citations · 531 across the 35 of their papers we have counts for
35 papers
Distributed quantum architecture search
Haozhen Situ, Zhimin He, Shenggen Zheng +1
Variational quantum algorithms, inspired by neural networks, have become a novel approach in quantum computing. However, designing efficient parameterized quantum circuits remains…
Lifting query complexity to time-space complexity for two-way finite automata
Shenggen Zheng, Yaqiao Li, Minghua Pan +2
Time-space tradeoff has been studied in a variety of models, such as Turing machines, branching programs, and finite automata, etc. While communication complexity as a technique ha…
Fast Exact NPN Classification with Influence-aided Canonical Form
Yonghe Zhang, Liwei Ni, Jiaxi Zhang +3
NPN classification has many applications in the synthesis and verification of digital circuits. The canonical-form-based method is the most common approach, designing a canonical f…
Semiquantum key distribution using initial states in only one basis without the classical user measuring
Xueying Liang, Xiangfu Zou, Xin Wang +6
From the perspective of resource theory, it is interesting to achieve the same quantum task using as few quantum resources as possible. Semiquantum key distribution (SQKD), which a…
GSQAS: Graph Self-supervised Quantum Architecture Search
Zhimin He, Maijie Deng, Shenggen Zheng +2
Quantum Architecture Search (QAS) is a promising approach to designing quantum circuits for variational quantum algorithms (VQAs). However, existing QAS algorithms require to evalu…
Rethinking NPN Classification from Face and Point Characteristics of Boolean Functions
Jiaxi Zhang, Shenggen Zheng, Liwei Ni +2
NPN classification is an essential problem in the design and verification of digital circuits. Most existing works explored variable symmetries and cofactor signatures to develop t…
Detection and evaluation of abnormal user behavior based on quantum generation adversarial network
Minghua Pan, Bin Wang, Xiaoling Tao +3
Quantum computing holds tremendous potential for processing high-dimensional data, capitalizing on the unique capabilities of superposition and parallelism within quantum states. A…
The Complexity of Quantum Circuit Mapping with Fixed Parameters
Pengcheng Zhu, Shenggen Zheng, Lihua Wei +3
A quantum circuit must be preprocessed before implementing on NISQ devices due to the connectivity constraint. Quantum circuit mapping (QCM) transforms the circuit into an equivale…
Complementarity between Success Probability and Coherence in Grover Search Algorithm
Minghua Pan, Haozhen Situ, Shenggen Zheng
Coherence plays a very important role in Grover search algorithm (GSA). In this paper, we define the normalization coherence N(C), where C is a coherence measurement. In virtue of…
Fast optimal structures generator for parameterized quantum circuits
Chuangtao Chen, Zhimin He, Shenggen Zheng +2
Current structure optimization algorithms optimize the structure of quantum circuit from scratch for each new task of variational quantum algorithms (VQAs) without using any prior…
Enhanced Fast Boolean Matching based on Sensitivity Signatures Pruning
Jiaxi Zhang, Liwei Ni, Shenggen Zheng +4
Boolean matching is significant to digital integrated circuits design. An exhaustive method for Boolean matching is computationally expensive even for functions with only a few var…
Performance of Grover's search algorithm with diagonalizable collective noises
Minghua Pan, Taiping Xiong, Shenggen Zheng
Grover's search algorithm (GSA) is known to experience a loss of its quadratic speedup when exposed to quantum noise. In this study, we partially agree with this result and present…
Quantum Architecture Search with Meta-learning
Zhimin He, Chuangtao Chen, Lvzhou Li +2
Variational quantum algorithms (VQAs) have been successfully applied to quantum approximate optimization algorithms, variational quantum compiling and quantum machine learning mode…
Variational quantum compiling with double Q-learning
Zhimin He, Lvzhou Li, Shenggen Zheng +2
Quantum compiling aims to construct a quantum circuit V by quantum gates drawn from a native gate alphabet, which is functionally equivalent to the target unitary U. It is a crucia…
RNA-2QCFA: Evolving Two-way Quantum Finite Automata with Classical States for RNA Secondary Structures
Amandeep Singh Bhatia, Shenggen Zheng
Recently, the use of mathematical methods and computer science applications have got significant response among biochemists and biologists to modeling the biological systems. The c…
A Quantum Finite Automata Approach to Modeling the Chemical Reactions
Amandeep Singh Bhatia, Shenggen Zheng
In recent years, the modeling interest has increased significantly from the molecular level to the atomic and quantum scale. The field of computational chemistry plays a significan…
QPSO-CD: Quantum-behaved Particle Swarm Optimization Algorithm with Cauchy Distribution
Amandeep Singh Bhatia, Mandeep Kaur Saggi, Shenggen Zheng +1
Motivated by particle swarm optimization (PSO) and quantum computing theory, we have presented a quantum variant of PSO (QPSO) mutated with Cauchy operator and natural selection me…
Global multipartite entanglement dynamics in Grover's search algorithm
Minghua Pan, Daowen Qiu, Shenggen Zheng
Entanglement is considered to be one of the primary reasons for why quantum algorithms are more efficient than their classical counterparts for certain computational tasks. The glo…
General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
Chu Guo, Yong Liu, Min Xiong +12
Recent advances on quantum computing hardware have pushed quantum computing to the verge of quantum supremacy. Random quantum circuits are outstanding candidates to demonstrate qua…
Quantum generative adversarial network for generating discrete distribution
Haozhen Situ, Zhimin He, Yuyi Wang +2
Quantum machine learning has recently attracted much attention from the community of quantum computing. In this paper, we explore the ability of generative adversarial networks (GA…
Capability of local operations and classical communication for distinguishing bipartite unitary operations
Lvzhou Li, Shenggen Zheng, Haozhen Situ +1
The problem behind this paper is, if the number of queries to unitary operations is fixed, say , then when do local operations and classical communication (LOCC) suffice for opt…
Characterizations of symmetrically partial Boolean functions with exact quantum query complexity
Daowen Qiu, Shenggen Zheng
We give and prove an optimal exact quantum query algorithm with complexity for computing the promise problem (i.e., symmetric and partial Boolean function) defined a…
Time-space tradeoffs for two-way finite automata
Shenggen Zheng, Daowen Qiu, Jozef Gruska
We explore bounds of {\em time-space tradeoffs} in language recognition on {\em two-way finite automata} for some special languages. We prove: (1) a time-space tradeoff upper bound…
Promise problems solved by quantum and classical finite automata
Shenggen Zheng, Lvzhou Li, Daowen Qiu +1
The concept of promise problems was introduced and started to be systematically explored by Even, Selman, Yacobi, Goldreich, and other scholars. It has been argued that promise pro…