Constructs an explicit unitary Q using the quantum Schur transform to coherently map fixed-N first-quantized states to occupation-number form with poly(N,d,log(1/ε)) gate complexity.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Quantum algorithm implements Kravchuk transform via su(2) fast-forwarding with logarithmic scaling in dimension and error.
citing papers explorer
-
Efficient Quantum Circuits for Coherent Conversion Between General First- and Second-Quantized Many-Body Representations
Constructs an explicit unitary Q using the quantum Schur transform to coherently map fixed-N first-quantized states to occupation-number form with poly(N,d,log(1/ε)) gate complexity.
-
Quantum Kravchuk Transform using $\mathfrak{su}(2)$ fast-forwarding
Quantum algorithm implements Kravchuk transform via su(2) fast-forwarding with logarithmic scaling in dimension and error.