Rigorous bounds establish that t = Theta(k^2) non-Clifford gates are necessary and sufficient for frame-potential approximation to unitary k-designs while t = Theta(nk) suffices for relative-error k-designs.
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
-
Non-Clifford Cost of Random Unitaries
Rigorous bounds establish that t = Theta(k^2) non-Clifford gates are necessary and sufficient for frame-potential approximation to unitary k-designs while t = Theta(nk) suffices for relative-error k-designs.