6 citations · 21 across the 24 of their papers we have counts for
Showing 2022 · quant-phShow all
2 papers · 2 filters
quant-ph2022
Efficient Quantum Agnostic Improper Learning of Decision Trees
Sagnik Chatterjee, Tharrmashastha SAPV, Debajyoti Bera
The agnostic setting is the hardest generalization of the PAC model since it is akin to learning with adversarial noise. In this paper, we give a poly$(n,t,{\frac{1}{\varepsilon}})…
quant-ph2022
Few Quantum Algorithms on Amplitude Distribution
Debajyoti Bera, Tharrmashastha Sapv
Amplitude filtering is concerned with identifying basis-states in a superposition whose amplitudes are greater than a specified threshold; probability filtering is defined analogou…