From the 2 of 4 linked papers with an AI index.
4 papers · 1 filter
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…
Nearly optimal quantum circuits for Boolean oracles
Junhong Nie, Wei Zi
The paper presents nearly optimal trade‑offs among circuit size, depth, and ancilla count for quantum oracles implementing various classes of Boolean functions, providing asymptoti…
From Leaves to Clusters: Depth-Efficient SAT-Oracle Synthesis Based on the HRSE Model
Zhihang Li, Wei Zi, Shuai Yang +7
The paper introduces a depth‑focused framework called the Clustered Synthesis Tree (CST) for building quantum oracles for SAT formulas, grouping clauses into clusters to exploit pa…
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…