arXiv Machine Learning By Mar\'ia Gragera Garc\'es, Lirand\"e Pira

Quantum ring all-reduce: communication and privacy advantages for distributed learning

Read the original on arXiv Machine Learning →

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.

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 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 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 AI
Jun 2

Quantum Algorithm for Distributed Reduction of Entanglements (QADR): A Trainable and Simulation-Efficient QML Framework

arXiv:2606. 01291v1 Announce Type: cross Abstract: Training Variational Quantum Circuits (VQCs) under Noisy Intermediate-Scale Quantum (NISQ) constraints introduces severe computational limitations: classical statevector simulation memory scales exponentially ($\mathcal{O}(2^n)$), and global cost functions suffer from barren plateaus where gradient variance decays exponentially ($\mathcal{O}(1/2^n)$).

By Syed Farhan Ahmad, Gregory T. Byrd