A randomized algorithm recovers the exact Pauli decomposition of k-sparse n-qubit matrices in poly(n, k, log(1/δ)) time with high probability under sparse query access.
Decomposing dense matrices into dense Pauli tensors
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2years
2026 2roles
background 1polarities
background 1representative citing papers
Efficient algorithms compute stabilizer Rényi entropy and mana for quantum states from vectors at O(N d^{2N}) cost using fast Hadamard transform, with open-source implementation.
citing papers explorer
-
An efficient Pauli decomposition algorithm for structured matrices
A randomized algorithm recovers the exact Pauli decomposition of k-sparse n-qubit matrices in poly(n, k, log(1/δ)) time with high probability under sparse query access.
-
Computing quantum magic of state vectors
Efficient algorithms compute stabilizer Rényi entropy and mana for quantum states from vectors at O(N d^{2N}) cost using fast Hadamard transform, with open-source implementation.