Login / Signup
Clifford Circuits can be Properly PAC Learned if and only if RP=NP.
Daniel Liang
Published in:
CoRR (2022)
Keyphrases
</>
truth table
efficient learning
pac learnable
pac learning
np complete
boolean functions
computational complexity
high speed
defeasible logic
circuit design
quantum computing
machine learning
upper bound
analog circuits
electronic circuits
logic synthesis