12 citations · 22 across the 6 of their papers we have counts for
6 papers
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…
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…
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…
From Quantum Query Complexity to State Complexity
Shenggen Zheng, Daowen Qiu
State complexity of quantum finite automata is one of the interesting topics in studying the power of quantum finite automata. It is therefore of importance to develop general meth…
Potential of quantum finite automata with exact acceptance
Jozef Gruska, Daowen Qiu, Shenggen Zheng
The potential of the exact quantum information processing is an interesting, important and intriguing issue. For examples, it has been believed that quantum tools can provide signi…
Exact quantum algorithms have advantage for almost all Boolean functions
Andris Ambainis, Jozef Gruska, Shenggen Zheng
It has been proved that almost all -bit Boolean functions have exact classical query complexity . However, the situation seemed to be very different when we deal with exact q…