20 citations · 53 across the 11 of their papers we have counts for
11 papers
Fanout Complexity of Symmetric Boolean Functions in
Boyan Xu, Lvzhou Li
Whether can compute remains open. Computing is equivalent to implementing under reduct…
On the completeness of transformation rules in reversible logic synthesis
Shiguang Feng, Zongxing Xiong, Lvzhou Li
Transformation rules play a central role in reversible circuit optimization, template-based rewriting, and equivalence checking, and establishing their completeness is a fundamenta…
Agnostic learning of qudit stabilizer states
Wentao Qi, Boyan Xu, Shiguang Feng +1
Learning a classical description of a quantum state is a fundamental task in quantum computation. Among the most important classes of quantum states are stabilizer states, which pl…
A complete set of transformation rules for reversible circuits
Shiguang Feng, Lvzhou Li
Reversible logic synthesis is a crucial component in quantum electronic design automation. While rule-based methodologies have gained prominence in reversible circuit optimization,…
Deterministic quantum search on all Laplacian integral graphs
Guanzhong Li, Jingquan Luo, Shiguang Feng +1
Searching for an unknown marked vertex on a given graph (also known as spatial search) is an extensively discussed topic in the area of quantum algorithms, with a plethora of resul…
Implementation of Continuous-Time Quantum Walk on Sparse Graph
Zhaoyang Chen, Guanzhong Li, Lvzhou Li
Continuous-time quantum walks (CTQWs) play a crucial role in quantum computing, especially for designing quantum algorithms. However, how to efficiently implement CTQWs is a challe…
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…
Succinct quantum testers for closeness and -wise uniformity of probability distributions
Jingquan Luo, Qisheng Wang, Lvzhou Li
We explore potential quantum speedups for the fundamental problem of testing the properties of closeness and -wise uniformity of probability distributions. Closeness testing is…
Variational learning algorithms for quantum query complexity
Zipeng Wu, Shi-Yao Hou, Chao Zhang +2
Quantum query complexity plays an important role in studying quantum algorithms, which captures the most known quantum algorithms, such as search and period finding. A query algori…
Robust Quantum Walk Search Without Knowing the Number of Marked Vertices
Yongzhen Xu, Delong Zhang, Lvzhou Li
There has been a very large body of research on searching a marked vertex on a graph based on quantum walks, and Grover's algorithm can be regarded as a quantum walk-based search a…
Query complexity of unitary operation discrimination
Xiaowei Huang, Lvzhou Li
Discrimination of unitary operations is fundamental in quantum computation and information. A lot of quantum algorithms including the well-known Deutsch-Jozsa algorithm, Simon's al…