3 citations · 9 across the 10 of their papers we have counts for
10 papers
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…
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…
Constant-Depth Quantum Circuits for Arbitrary Quantum State Preparation via Measurement and Feedback
Wei Zi, Junhong Nie, Xiaoming Sun
The optimization of quantum circuit depth is crucial for practical quantum computing, as limited coherence times and error-prone operations constrain executable algorithms. Measure…
Efficient Quantum Circuits for Machine Learning Activation Functions including Constant T-depth ReLU
Wei Zi, Siyi Wang, Hyunji Kim +3
In recent years, Quantum Machine Learning (QML) has increasingly captured the interest of researchers. Among the components in this domain, activation functions hold a fundamental…
Shallow Quantum Circuit Implementation of Symmetric Functions with Limited Ancillary Qubits
Wei Zi, Junhong Nie, Xiaoming Sun
In quantum computation, optimizing depth and number of ancillary qubits in quantum circuits is crucial due to constraints imposed by current quantum devices. This paper presents an…