Search Results for author:
Found 3 papers, 1 papers with code
Quantum Solutions to the Privacy vs. Utility Tradeoff
In this work, we propose a novel architecture (and several variants thereof) based on quantum cryptographic primitives with provable privacy and security guarantees regarding membership inference attacks on generative models.
Efficient Quantum Agnostic Improper Learning of Decision Trees
Our algorithm is the first algorithm (classical or quantum) for learning decision trees in polynomial time without membership queries.
Quantum Boosting using Domain-Partitioning Hypotheses
Izdebski et al. posed an open question on whether we can boost quantum weak learners that output non-binary hypothesis.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
