A lifted Solovay-Kitaev argument proves that density of QSP ansätze in function spaces implies the existence of short approximating circuits, with examples for several QSP variants.
On the length of the shortest non-trivial element in the derived and the lower central series
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We provide upper and lower bounds on the length of the shortest non-trivial element in the derived series and lower central series in the free group on two generators. The techniques are used to provide new estimates on the nilpotent residual finiteness growth and on almost laws for compact groups.
fields
quant-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A Solovay-Kitaev theorem for quantum signal processing
A lifted Solovay-Kitaev argument proves that density of QSP ansätze in function spaces implies the existence of short approximating circuits, with examples for several QSP variants.