A quasipolynomial-time algorithm finds the closest Clifford unitary to an unknown unitary, enabling tomography of unitaries and Hamiltonians with bounded Clifford decomposition size.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Learning Clifford-structured quantum unitaries and Hamiltonians
A quasipolynomial-time algorithm finds the closest Clifford unitary to an unknown unitary, enabling tomography of unitaries and Hamiltonians with bounded Clifford decomposition size.