arXiv:2602. 01177v3 Announce Type: replace-cross Abstract: We develop an information-theoretic framework connecting stability, privacy, and generalization for quantum learning algorithms.
arXiv:2609.05702v2 Announce Type: cross Abstract: Quantum Machine Learning (QML) has shown rapid advances by utilizing quantum computing for machine learning tasks. Meanwhile, the privacy risks accom...
arXiv:2606. 20344v1 Announce Type: cross Abstract: Machine learning models have scaled to unprecedented sizes, making training across distributed devices the de facto standard in the field.
The paper investigates whether a learner or tester with limited resources can improve performance by interacting with an untrusted, resource‑unconstrained party. It shows that for many scenarios, classical interaction offers no advantage, especially for memory‑constrained quantum algorithms. However, when quantum communication is permitted, interactive proof protocols enable memory‑constrained quantum verifiers to achieve significant gains through delegation.
arXiv:2609.25082v1 Announce Type: new Abstract: Quantum machine learning (QML) is increasingly recognized as one of the most promising near-term applications of quantum computing, viewed as a next-fr...
The paper investigates whether having only forward access to a state-preparation unitary—without its inverse—can reduce the number of queries needed for quantum PAC learning. By analyzing worst-case scenarios over all compatible unitaries and finite dimensions, the authors prove that the optimal forward-only query complexities for realizable and agnostic learning are θ((d+log(1/δ))/ε) and θ((d+log(1/δ))/ε²), respectively, matching classical and quantum-copy bounds. These results demonstrate that forward-only access offers no asymptotic advantage over classical data or quantum copies, highlighting the essential role of inverse access for any improvement in the realizable setting.
arXiv:2607. 05281v1 Announce Type: cross Abstract: Present-day quantum computing is cloud-based, where a user submits a circuit to a service provider's proprietary backend hardware.
arXiv:2608.28198v1 Announce Type: new Abstract: Privacy-preserving learning is often motivated by the idea that protecting users' data can preserve trust and thus participation, improving utility in...
arXiv:2601. 14033v2 Announce Type: replace Abstract: Machine learning models are increasingly served behind APIs.
Given that quantum computers are naturally suited to simulate the behavior of quantum many-body systems, an immediate question arises: can one formulate physically motivated quantum machine learning (QML) tasks that exhibit learning separations? We address this problem by studying the learnability of quantum many-body dynamics from the perspective of probably approximately correct (PAC)-learning.
arXiv:2510. 04902v3 Announce Type: replace Abstract: Tuning hyperparameters in federated machine learning can substantially impact model performance.
arXiv:2602. 14735v2 Announce Type: replace-cross Abstract: The performance of quantum classifiers is typically analyzed through global state distinguishability or the trainability of variational models.
arXiv:2607. 06472v1 Announce Type: cross Abstract: Given that quantum computers are naturally suited to simulate the behavior of quantum many-body systems, an immediate question arises: can one formulate physically motivated quantum machine learning (QML) tasks that exhibit learning separations?