New quantum circuits for Hamming weight and symmetric Boolean functions: O(log n) depth with sublinear ancillas (all-to-all), optimal Θ(√n) depth with O(log^2 n) ancillas (2D), and constant depth with O(n^{1+ε}) ancillas (dynamic).
Efficient quantum implementation of majority-based full adder circuit using clifford+t-group
1 Pith paper cite this work, alongside 6 external citations. Polarity classification is still indexing.
1
Pith paper citing it
6
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions
New quantum circuits for Hamming weight and symmetric Boolean functions: O(log n) depth with sublinear ancillas (all-to-all), optimal Θ(√n) depth with O(log^2 n) ancillas (2D), and constant depth with O(n^{1+ε}) ancillas (dynamic).