Deterministic quantum circuits prepare Dicke states in depth O(log k log(n/k)+k) with all-to-all connectivity and O(k log(n/k)+n_2) or O(n_2) on an n1 x n2 grid, with lower bounds showing near-optimality in several regimes.
Simulating hamiltonian dynamics with a truncated taylor series
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
-
Depth-Efficient Quantum Circuit Synthesis for Deterministic Dicke State Preparation
Deterministic quantum circuits prepare Dicke states in depth O(log k log(n/k)+k) with all-to-all connectivity and O(k log(n/k)+n_2) or O(n_2) on an n1 x n2 grid, with lower bounds showing near-optimality in several regimes.