Two new sparse quantum state preparation algorithms achieve O(n log d) and O(n) circuit depth with O(d) ancilla qubits and O(dn) size.
This pro- cess is performed in parallel over all i, while the records for each k are generated sequentially in the order of branch node indices
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimizing sparse quantum state preparation with measurement and feedforward
Two new sparse quantum state preparation algorithms achieve O(n log d) and O(n) circuit depth with O(d) ancilla qubits and O(dn) size.