Initiates property testing for k-submodular functions, yielding constant-query testers in l_p distance via hypergrid junta approximation and sub-exponential testers for component properties in Hamming distance, but with a structural barrier preventing combination.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Testing k-submodularity
Initiates property testing for k-submodular functions, yielding constant-query testers in l_p distance via hypergrid junta approximation and sub-exponential testers for component properties in Hamming distance, but with a structural barrier preventing combination.
-
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.