The analogue of P≠NP for randomized polynomial-time algorithms is actually NP≠RP (or equivalently NP⊈BPP), assuming that the intended meaning here is "NP-complete problems cannot be solved in polynomial time, even with randomized algorithms".[1] More information about these classes are available here.
Also, a bit of a nitpick, but it looks like the claim that these widely-believed complexity-theoretic assumptions imply
that there is no way, in polynomial time, to get reliable information about A’s secret circuit C (beyond some s
The analogue of P≠NP for randomized polynomial-time algorithms is actually NP≠RP (or equivalently NP⊈BPP), assuming that the intended meaning here is "NP-complete problems cannot be solved in polynomial time, even with randomized algorithms".[1] More information about these classes are available here.
Also, a bit of a nitpick, but it looks like the claim that these widely-believed complexity-theoretic assumptions imply
... (read more)