63 citations · 111 across the 8 of their papers we have counts for
10 papers
Exact Unitary Synthesis: Simultaneously Optimal in Size and Depth-Ancilla Tradeoff
Pei Yuan, Wei Zi, Shengyu Zhang
Unitary synthesis underlies universal quantum computation by translating unitary transformations into circuits of elementary gates. We show that for any budget of ancilla…
Quantum Circuit for General Unitary: Improved T-count via Block Flattening and Dilation
Pei Yuan, Shengyu Zhang, Wei Zi
Synthesizing arbitrary -qubit unitaries using as few non-Clifford gates as possible is a central problem in fault-tolerant quantum compilation. We present a Clifford+ quantum…
Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions
Wei Zi, Pei Yuan, Junhong Nie +1
Hamming weight computation maps an -bit input to the number of ones it contains. It is a basic subroutine in quantum computing, and the core building block for symmetric Boolean…
Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding
Tongyang Li, Fengning Ou, Xinzhao Wang +3
Many quantum algorithms require coherent access to classical data, often modeled by quantum read-only memory (QROM). We initiate the study of the count of sparse QROM,…
Does qubit connectivity impact quantum circuit complexity?
Pei Yuan, Jonathan Allcock, Shengyu Zhang
Some physical implementation schemes of quantum computing can apply two-qubit gates only on certain pairs of qubits. These connectivity constraints are commonly viewed as a signifi…
Optimal (controlled) quantum state preparation and improved unitary synthesis by quantum circuits with any number of ancillary qubits
Pei Yuan, Shengyu Zhang
As a cornerstone for many quantum linear algebraic and quantum machine learning algorithms, controlled quantum state preparation (CQSP) aims to provide the transformation of $|i\ra…
Asymptotically Optimal Circuit Depth for Quantum State Preparation and General Unitary Synthesis
Xiaoming Sun, Guojing Tian, Shuai Yang +2
The Quantum State Preparation problem aims to prepare an -qubit quantum state from the initial state , for a…
Strong Quantum Nonlocality without Entanglement in Multipartite Quantum Systems
Pei Yuan, Guojing Tian, Xiaoming Sun
In this paper, we generalize the concept of strong quantum nonlocality from two aspects. Firstly in quantum system, we present…
A Quantum-inspired Classical Algorithm for Separable Non-negative Matrix Factorization
Zhihuai Chen, Yinan Li, Xiaoming Sun +2
Non-negative Matrix Factorization (NMF) asks to decompose a (entry-wise) non-negative matrix into the product of two smaller-sized nonnegative matrices, which has been shown intrac…
Exact quantum query complexity of weight decision problems via Chebyshev polynomials
Xiaoyu He, Xiaoming Sun, Guang Yang +1
The weight decision problem, which requires to determine the Hamming weight of a given binary string, is a natural and important problem, with applications in cryptanalysis, coding…