- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The manuscript considers the problem of quantum federated learning, but its theoretical contribution is not clearly established.
- the convergence analysis in Section 3.2 does not explain which assumptions, proof arguments, or conclusions depend on properties specific to the quantum setting.
- The manuscript also lacks an explicit comparison with relevant convergence results for classical federated learning and stochastic optimization. Thus, it is difficult to determine whether the analysis provides new theoretical insights or follows from established results under an adapted formulation. The relationship to prior work should be more explicit.
Critical strengths
see the summary.
Critical weaknesses
see the summary.
Questions for authors
see the summary.
4 comments
Response to Reviewer A9pD: Questions 1 and 2
Finite-shot uncertainty consequently enters through two channels: directly through current stochastic-oracle fluctuations and indirectly by changing subsequent client iterates and gradient evaluations. We do not claim that the optimization tools used to analyze these effects apply only to quantum stochasticity. QProxFL instantiates the oracle using finite-shot parameter-shift estimation and derives how the resulting uncertainty propagates through the analyzed proximal federated recursion.
The paper also does not claim to characterize every source of quantum-gradient error. Lemma 3.1 treats finite-shot parameter-shift estimation. The primary contribution is the derivation of the proximal-memory factor, exact update-discrepancy decomposition, heterogeneity-dependent drift closure, and endpoint-dispersion participation correction for the federated recursion.
R2. How does this differ from existing classical and quantum optimization results?
The contribution is the joint derivation of proximal memory, stochastic-oracle and trajectory discrepancies, client-drift closure, and endpoint-dependent participation error.
Client drift, nonconvex proximal federated optimization, and partial-participation variance are established classical topics. SCAFFOLD establishes control-variate drift correction; Yuan--Li provide proximal-point-based nonconvex FedProx analysis and a stochastic extension; and FedVARP provides server-side participation-variance reduction. We do not claim novelty for these ingredients individually.
However, replacing a generic stochastic-gradient variance constant by in an existing bound does not by itself produce:
- the schedule-dependent geometric-memory factor ;
- the exact global-update discrepancy;
- the drift-explicit stationarity theorem followed by a post-broadcast heterogeneity closure; or
- the finite-population correction coupled to terminal proximal endpoint dispersion.
These results require first unrolling the stochastic proximal client recursion, then decomposing the resulting server update, and finally bounding the stochastic-oracle, trajectory-deviation, proximal, and client-drift terms before applying descent and telescoping arguments. None of the cited classical results or compared QFL methods jointly derive these four results under finite-shot parameter-shift uncertainty.
The revised manuscript also makes the comparison with quantum work explicit. Sweke et al. establish finite-measurement stochastic-gradient results for hybrid quantum--classical optimization, while Chung et al. study parameter-shift-based quantum federated gradient aggregation. Q-ANCHOR analyzes nonconvex finite-shot quantum FedAvg with ZNE/control-variate hardware-bias correction; Q-ShiftDP studies parameter-shift sensitivity, finite-shot error, and differential privacy; and DUQFL-Prox develops an adaptive deep-unfolded SPSA-based proximal QFL method with empirical drift stabilization.
We do not claim to be the first work on finite-shot QFL or proximal QFL. These methods use different gradient estimators, hardware-bias or privacy mechanisms, optimization objectives, and convergence guarantees. Our distinct result is the analysis of the time-varying stochastic Prox-SGD recursion summarized above. The revised Introduction and Table 1 compare the optimization setting, uncertainty model, local-update dynamics, participation model, and the error and drift terms retained in the convergence guarantees. Our comparisons with these methods are theorem-level; we do not claim empirical superiority based on unmatched implementations.
Estimator and trajectory diagnostics.
The revised manuscript supplements a parameter-shift variance measurement at a fixed circuit checkpoint with a matched experiment that tracks finite-shot and analytic-expectation trajectories. Section 4.1 evaluates the parameter-shift estimator at a fixed circuit checkpoint and obtains a fitted variance exponent , supporting the near- scaling in Lemma 3.1. This diagnostic concerns circuit-expectation derivatives and does not verify complete-gradient unbiasedness.
Section 4.2 and Appendix D.5 examine the distinct trajectory-level question using a four-qubit, one-layer VQC, heterogeneous clients, local proximal-SGD steps, full participation, eight communication rounds, eight paired seeds, and shot budgets . Within each seed, the finite-shot trajectories and their analytic-expectation reference share the initialization, preprocessed features, client partition, scheduled mini-batches, learning-rate sequence, and proximal schedule.
Response to Reviewer A9pD: Questions 2
Increasing from to reduces the mean final squared trajectory discrepancy from to , a % reduction, with a reduction in every paired seed. An exact update-map counterfactual separates the current-round discrepancy from the discrepancy inherited through earlier parameter trajectories while retaining their cross term. The mean squared history component exceeds the current-round component at the final round for all three shot budgets. Because the final-round learning rate is small, the current-round discrepancy is comparatively small in these runs; we therefore do not infer that history-dependent discrepancies generally dominate current-round discrepancies. We also do not claim componentwise monotonicity in .
The manuscript explicitly states that these empirical components are not term-by-term realizations of the analytical components in Lemma 3.9. The complete protocol, decomposition, limitations, and seed-level values appear in Figure 2 and Tables 13--15.
The manuscript also distinguishes the theory-aligned proximal-SGD diagnostics from the practical Adam/AdamW classification experiments. Neither experiment is presented as direct verification of the complete-gradient oracle condition or Theorem 3.11. The experimental stationarity quantity is defined as a finite-shot squared-gradient diagnostic evaluated using shots on a fixed 32-example subset, rather than the full-objective stationarity quantity in the theorem.
The theory-aligned experiments compare Q-FedAvg, constant Q-FedProx, and annealed Q-FedProx using matched initializations, client partitions, mini-batch schedules, shot budgets, and learning-rate sequences. Appendix D.8 also reports centralized and local-only VQC results while stating explicitly that their circuit-evaluation budgets are not matched to those of the federated methods. These results are not presented as evidence of quantum advantage, intrinsic federated superiority, or uniform superiority of either proximal schedule.
To improve accessibility, the revised Introduction presents the measurement-constrained QFL problem before the detailed notation, explains the PL condition at first use, separates circuit-derivative estimation from the complete-gradient oracle condition, and states explicitly that finite-shot uncertainty acts directly through current stochastic-gradient errors and indirectly by changing subsequent client iterates and gradient evaluations. The revision also standardizes the terminology for the MNIST and six-class MedMNIST experiments.
AI-use disclosure.
Following the Program Chairs' clarification regarding AI-use reporting, the revised manuscript includes the requested disclosure:
Generative AI tools were used for language editing, proofreading, manuscript organization, presentation refinement, and feedback on the clarity and positioning of the work. The authors developed the research problem, theoretical models and claims, proofs, algorithms, experimental methodology and implementation, and data analyses. The authors independently verified all mathematical arguments, numerical results, citations, comparisons, and AI-assisted text, and take full responsibility for the final content.
This disclosure distinguishes language and presentation assistance from the scientific contributions and confirms the authors' responsibility for all mathematical, experimental, comparative, and bibliographic content.
Response to Reviewer A9pD: Follow-up
As the discussion period concludes tomorrow, we wanted to follow up on our response and the revised manuscript. We clarified which components are quantum-specific, which proof tools are classical, and what is newly derived for the time-varying stochastic proximal recursion. The revision also states the conditional scope of Theorem 3.11 explicitly, provides detailed comparisons with the closest classical and QFL results, reports matched finite-shot/analytic trajectory experiments, and includes the requested AI-use disclosure.
We would greatly appreciate any feedback on whether these revisions address your concerns and remain happy to clarify any outstanding point before the discussion period ends.
Response to Reviewer A9pD: Question 1
We thank the reviewer for raising important questions about the theoretical contribution, its relationship to classical stochastic federated optimization, and the role of quantum measurements. The revised manuscript makes explicit a three-level structure that was already present in the submitted analysis: circuit-level finite-shot estimation (Lemma 3.1), the complete-gradient oracle condition (Assumption 3.4), and error propagation through proximal federated trajectories (Lemmas 3.8--3.10, Theorem 3.11, Corollary 3.12, and Theorem 3.15). The revised Introduction, Table 1, and Sections 3.1--3.2 now state this structure and its relationship to classical work directly. All results and evidence cited below are contained in the revised manuscript.
R1. Which assumptions, proof steps, and conclusions are quantum-specific?
The manuscript first links the shot budget to circuit-derivative estimation error and then analyzes the federated recursion under a separately stated complete-gradient oracle condition.
Circuit-level finite-shot estimation. For bounded observables and independently measured parameter shifts, Lemma 3.1 establishes that each finite-shot circuit-expectation derivative is unbiased with coordinatewise variance O(1/S) and that the corresponding dq-coordinate derivative vector has mean-squared error O(dq/S). This result connects the physical measurement budget to circuit-derivative estimation error. We do not claim that parameter-shift estimation itself is new; it supplies the finite-shot specialization used in the subsequent federated analysis.
Complete-gradient oracle condition. An unbiased circuit-expectation derivative does not necessarily yield an unbiased complete gradient for an arbitrary nonlinear loss. Assumption 3.4 therefore separately requires conditional unbiasedness and bounded variance for the complete stochastic local-gradient oracle. For example, a nonlinear finite-shot plug-in estimator can have the form gq=Jz⊤h(z,y), for which unbiasedness of the readout and Jacobian estimators does not generally imply E[gq]=Jz⊤h(z,y). Theorem 3.11 is therefore conditional on Assumption 3.4; Lemma 3.1 alone does not establish that condition for every finite-shot cross-entropy implementation. Section 3.1 and Appendix C.6.1 state this limitation and the corresponding biased-oracle model. The manuscript does not claim an unconditional stationarity theorem for arbitrary nonlinear gradient bias.
Proximal federated trajectory analysis. Once a valid complete-gradient oracle has been specified, the smoothness, descent, Young's-inequality, finite-population, and telescoping arguments are classical and are not claimed to be uniquely quantum. The contribution is the derivation and control of the error and drift terms produced when stochastic gradients are evaluated repeatedly along heterogeneous proximal client trajectories: