Author

Pei Yuan

h-index 7 View on Semantic Scholar

We have 4 of 11 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Exact Unitary Synthesis: Simultaneously Optimal in Size and Depth-Ancilla Tradeoff

Unitary synthesis underlies universal quantum computation by translating unitary transformations into circuits of elementary gates. We show that for any budget $m\geq 0$ of ancilla, every $n$-qubit unitary can be exactly implemented using a quantum circuit consisting of $O(4^n)$ CNOT and single-qubit gates in $O(n+4^n/...

Pei Yuan, Wei Zi, Sheng-Yu Zhang · 0 citations

Jul 2026

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding

It is proved that the optimal $\mathrm{T}$ count is $\Theta\left(n+\min\left\{s, m+\log(2^{n+1}/s)}\right\}\right)$.

Tongyang Li, Fengning Ou, Xin-Zhao Wang et al. · arXiv.org · 4 citations

Preprint Aug 2026

Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions

This work studies the depth-ancilla tradeoffs of Hamming weight computation under two qubit connectivity models, all-to-all and two-dimensional nearest-neighbor square grid (2D), in both the standard and dynamic circuit models.

Wei Zi, Pei Yuan, Jun-Hong Nie et al. · 0 citations

Preprint Aug 2026

Quantum Circuit for General Unitary: Improved T-count via Block Flattening and Dilation

A Clifford+T quantum circuit construction that approximately implements any classically specified unitary to within error $\epsilon$ and achieves a worst-case $T$-count with leading exponential scaling of $2^{5n/4}$ whenever $\log(1/\epsilon)=\operatorname{poly}(n)$.

Pei Yuan, Sheng-Yu Zhang, Wei Zi · 1 citation