Shenggen Zheng

Prof. Shenggen Zheng

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 May 2015 in Mathematical Structures in Computer Science
Verified
Journal Article
Open access
PDF file
JGJozef Gruska
Jozef Gruska
Daowen QiuDaowen Qiu
Daowen Qiu
SZShenggen Zheng
Shenggen Zheng
In thedistributed Deutsch–Jozsa promise problem, two parties are to determine whether their respective stringsx, y∈ {0,1}nare at theHamming distanceH(x, y) = 0 orH(x, y) = $\frac{n}{2}$ . Buhrmanet al.(STOC' 98) proved that the exactquantum communication complexityof this problem isO(logn) while thedeterministic communication complexityisΩ(n). This was the first impressive (exponential) gap between quantum and classical communication complexity. In this paper, we generalize the above distributed Deutsch–Jozsa promise problem to determine, for any fixed $\frac{n}{2}$ ⩽k⩽n, whetherH(x, y) = 0 orH(x, y) =k, and show that an exponential gap between exact quantum and deterministic communication complexity still holds ifkis an even such that $\frac{1}{2}$ n⩽k< (1 − λ)n, where 0 < λ < $\frac{1}{2}$ is given. We also deal with a promise version of the well-knowndisjointnessproblem and show also that for this promise problem there exists an exponential gap between quantum (and also probabilistic) communication complexity and deterministic communication complexity of the promise version of such a disjointness problem. Finally, some applications to quantum, probabilistic and deterministic finite automata of the results obtained are demonstrated.

1 August 2024 in Physical Review A
Verified
Journal Article
Closed access
PDF file
HSHaozhen Situ
Haozhen Situ
ZHZhimin He
Zhimin He
SZShenggen Zheng
Shenggen Zheng
LLLvzhou Li
Lvzhou Li
Variational quantum algorithms, inspired by neural networks, have become a novel approach in quantum computing. However, designing efficient parameterized quantum circuits remains a challenge. Quantum architecture search tackles this by adjusting circuit structures along with gate parameters to automatically discover high-performance circuit structures. In this study, we propose an end-to-end distributed quantum architecture search framework, where we aim to automatically design distributed quantum circuit structures for interconnected quantum processing units with specific qubit connectivity. We devise a circuit generation algorithm which incorporates TeleGate and TeleData methods to enable nonlocal gate implementation across quantum processing units. While taking into account qubit connectivity, we also incorporate qubit assignment from logical to physical qubits within our quantum architecture search framework. A two-stage progressive training-free strategy is employed to evaluate extensive circuit structures without circuit training costs. Through numerical experiments on three VQE tasks, the efficacy and efficiency of our scheme is demonstrated. Our research into discovering efficient structures for distributed quantum circuits is crucial for near-term quantum computing where a single quantum processing unit has a limited number of qubits. Distributed quantum circuits allow for breaking down complex computations into manageable parts that can be processed across multiple quantum processing units.

17 April 2014 in RAIRO - Theoretical Informatics and Applications
Verified
Journal Article
Closed access
PDF file
SZShenggen Zheng
Shenggen Zheng
JGJozef Gruska
Jozef Gruska
Daowen QiuDaowen Qiu
Daowen Qiu
Some of the most interesting and important results concerning quantum finite automata are those showing that they can recognize certain languages with (much) less resources than corresponding classical finite automata. This paper shows three results of such a type that are stronger in some sense than other ones because (a) they deal with models of quantum finite automata with very little quantumness (so-called semi-quantum one- and two-way finite automata); (b) differences, even comparing with probabilistic classical automata, are bigger than expected; (c) a trade-off between the number of classical and quantum basis states needed is demonstrated in one case and (d) languages (or the promise problem) used to show main results are very simple and often explored ones in automata theory or in communication complexity, with seemingly little structure that could be utilized.

11 June 2019 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
YTYuling Tian
Yuling Tian
TFTianfeng Feng
Tianfeng Feng
MLMaolin Luo
Maolin Luo
SZShenggen Zheng
Shenggen Zheng
XZXiaoqi Zhou
Xiaoqi Zhou
In quantum information science, a major task is to find the quantum models that can outperform their classical counterparts. Automaton is a fundamental computing model that has wide applications in many fields. It has been shown that the quantum version of automaton can solve certain problem using a much smaller state space compared to the classical automaton. Here we report an experimental demonstration of an optical quantum automaton, which is used to solve the promise problems of determining whether the length of an input string can be divided by a prime number P with no remainder or with a remainder of R. Our quantum automaton can solve such problem using a state space with only three orthonormal states, whereas the classical automaton needs no less than P states. Our results demonstrate the quantum benefits of a quantum automaton over its classical counterpart and paves the way for implementing quantum automaton for more complicated and practical applications.

1 May 2022 in Europhysics Letters
Verified
Journal Article
Closed access
MPMinghua Pan
Minghua Pan
HSHaozhen Situ
Haozhen Situ
SZShenggen Zheng
Shenggen Zheng
Coherence plays a very important role in Grover search algorithm (GSA). In this paper, we define the normalization coherence , where C is a coherence measurement. By virtue of the constraint of large N and Shannon's maximum entropy principle, a surprising complementary relationship between the coherence and the success probability of GSA is obtained. Namely, , where C is in terms of the relative entropy of coherence and l 1 norm of coherence, t is the number of the search iterations in GSA. Moreover, the equation holds no matter either in ideal or noisy environments. Considering the number of qubits is limited in the recent noisy intermediate-scale quantum (NISQ) era, some exact numerical calculation experiments are presented for different database sizes N with different types of noises. The results show that the complementarity between the success probability and the coherence almost always holds. This work provides a new perspective to improve the success probability by manipulating its complementary coherence, and vice versa. It has an excellent potential for helping quantum algorithms design in the NISQ era.

1 December 2010 in International Journal of Theoretical Physics
Verified
Journal Article
Closed access
PDF file
SZShenggen Zheng
Shenggen Zheng
LLLvzhou Li
Lvzhou Li
Daowen QiuDaowen Qiu
Daowen Qiu