Clifford Circuits can be Properly PAC Learned if and only if RP=NP.
Daniel LiangPublished in: Quantum (2023)
Keyphrases
- truth table
- pac learnable
- pac learning
- efficient learning
- defeasible logic
- np complete
- boolean functions
- neural network
- dnf formulas
- computational complexity
- sample complexity
- special case
- delay insensitive
- upper bound
- concept class
- clifford algebra
- analog circuits
- statistical queries
- circuit design
- membership queries
- vc dimension
- uniform distribution