arXiv Machine Learning By Ayanava Dasgupta, Naqueeb Ahmad Warsi, Masahito Hayashi

Privacy Implies Stability: Information-Theoretic Generalization Bounds for Quantum Learning

Read the original on arXiv Machine Learning →

arXiv:2602. 01177v3 Announce Type: replace-cross Abstract: We develop an information-theoretic framework connecting stability, privacy, and generalization for quantum learning algorithms.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 18

Interactive proofs for verifying (quantum) learning and testing

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.

By Matthias C. Caro, Jens Eisert, Marcel Hinsche, Marios Ioannou, Alexander Nietner, Ryan Sweke
arXiv Machine Learning
Sep 23

Federating Quantum and Classical Computing: A Privacy-Preserving Hybrid Approach

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...

By Carlos Cano, Daniel M. Jimenez-Gutierrez, Diego Sal, Georgios Kellaris, Joaquin del Rio, Oleksii Sliusarenko, Xabi Uribe-Etxebarria
arXiv Statistics ML
3d ago

Advantage of Sample Complexity in Quantum PAC Learning Requires Inverse Access to State-Preparation Unitaries

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.

By Natsuto Isogai, Satoshi Yoshida, Mio Murao