3 citations · 3 across the 10 of their papers we have counts for
4 papers · 1 filter
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,…
The Dynamical Lie Algebra of QAOA-MaxCut on the Complete Graph
Jonathan Allcock, Pei Yuan, Shengyu Zhang
We give an analytical expression for the dynamical Lie algebra corresponding to the QAOA-MaxCut problem on complete graphs, and show that the variance of the associated loss functi…