arXiv Machine Learning By Athanasios Hadjidimoulas, Tirthak Patel, Anastasios Kyrillidis

Identity-Paired Progressive Depth Training: When Trainability Persists Beyond Expressibility

Read the original on arXiv Machine Learning →

arXiv:2607. 16800v1 Announce Type: cross Abstract: Variational Quantum Algorithms (VQAs) are a leading paradigm for near-term quantum computing, yet their training suffers from sensitivity to circuit depth, initialization, and landscape pathologies such as barren plateaus.

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
5d ago

Encryptability As a Coordinate Choice: Depth-One Homomorphic Federated Learning of Quantum Neural Networks

The paper demonstrates that by choosing unit‑quaternion coordinates, encrypted updates for variational quantum circuits become bilinear, allowing depth‑one homomorphic federated learning without bootstrapping. This coordinate choice reduces encrypted rotation updates to a single multiplicative level and federated averaging to zero levels, eliminating the previously prohibitive cost of one round per gate. Experiments across two cryptographic backends and up to 20 clients show negligible aggregation error and no measurable loss in utility, with hardware validation on a 156‑qubit processor achieving near‑optimal fidelity.

By Marcel Mordarski, Nathan Mani, Arshad Patel, William Knottenbelt, Roberto Bondesan
arXiv Machine Learning
Jul 7

Breaking the One-Dimensional Expressibility-Trainability Tradeoff

arXiv:2607. 04598v1 Announce Type: cross Abstract: Expressive parameterized quantum circuits (PQCs) are often designed under a dilemma: the growth of expressibility and entangling power (EP) that improves Hilbert-space coverage is also expected to randomize an ansatz and activate barren-plateau (BP) conditions.

By Kyoungho Cho, Yu-Seong Jeon, Jinhyoung Lee, Jeongho Bang