3 citations · 9 across the 10 of their papers we have counts for
Showing 2026 · quant-phShow all
3 papers · 2 filters
quant-ph2026
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…
quant-ph2026
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…
quant-ph2026
From Leaves to Clusters: Depth-Efficient SAT-Oracle Synthesis Based on the HRSE Model
Zhihang Li, Wei Zi, Shuai Yang +7
Quantum oracles are a common building block of many quantum algorithms, where circuit depth is a primary cost that directly affects overall performance. Synthesizing oracles for SA…