63 citations · 111 across the 8 of their papers we have counts for
4 papers · 1 filter
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,…