A deterministic recursive quantum circuit prepares antisymmetric states for η fermions in N orbitals with O(η²√N) T-gates and O(√N) dirty ancillas, outperforming sorting methods for η ≲ √N.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping
A deterministic recursive quantum circuit prepares antisymmetric states for η fermions in N orbitals with O(η²√N) T-gates and O(√N) dirty ancillas, outperforming sorting methods for η ≲ √N.