- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2(+1)
Read review
Paper summary
This paper studies tabular in-context learning in a setting where the client keeps its data local and hands the prediction step to a remote quantum server. In this work, they propose QICL, which is a privacy-aware split quantum–classical framework. This framework compresses labeled context records into bounded class-wise summaries and class proportions, applies a classical Gaussian mechanism to provide record-level differential privacy (DP), and combines classical query-candidate-rival comparisons with a quantum predictor.
Critical strengths
- The problem framing is clear, addressing privacy, communication costs, and limited quantum resources.
- A formal DP guarantee is included to establish record-level privacy protection for the uploaded context information.
- The experiments are broad, including 200 datasets, multiple baselines, component ablations, and real-hardware execution.
Critical weaknesses
-
My first concern is about the necessity of the quantum component and the limited novelty of the analysis. Specifically, the manuscript does not convincingly establish what this quantum component contributes beyond a suitably trained classical predictor. The theoretical contribution is also limited. The privacy guarantee largely applies bounded-sensitivity analysis and the classical Gaussian mechanism, while prediction stability follows from Gaussian concentration and a Lipschitz margin argument. Neither result uses any property of the quantum circuit. They support the design, but they add little methodological novelty and do not explain why quantum computation is needed.
-
My second concern is about the practical choice of . The theory requires this threshold to be fixed independently of private data. However, overestimating the minimum class size can produce insufficient noise for the stated privacy guarantee, while underestimating it can introduce excessive noise and hurt prediction accuracy. The paper does not report the values used or explain how they are selected under the independence requirement. This makes it difficult to verify whether the experiments satisfy the theoretical assumptions and whether the reported privacy–utility trade-off is justified.
-
My third concern is about whether the experiments show the usefulness of the quantum component. In Figure 6, the quantum predictor offers only a small improvement over classical heads, even in the simulation setting. The hardware evaluation in Appendix even shows a substantial performance drop. Accuracy falls from 75.1% in simulation to 50.0% on hardware for the same nine datasets. These results again leave unclear why a quantum component is needed and what practical benefit it provides.
Questions for authors
See the weaknesses above.
9 comments
Response to Reviewer 8cNL (2/3)
Concern 2. Practical choice of . We thank the reviewer, and we apologize that the submitted manuscript omitted these details. We presented the sensitivity analysis in its simplified minimum-support form, whereas all reported experiments use a threshold computed from privatized quantities that enforces the bound by construction. We now document the detailed procedure in Appendix D.1.
(1) Threshold selection. With , the client first privatizes the class prior and computes
where and is a predefined public lower bound. The threshold is a post-processing of and does not directly use the unperturbed class counts for threshold selection. is invariant under replace-one adjacency, and is fixed by the task schema.
(2) Bound holds by construction. The summary uses a clamped denominator,
Since , we have for every value of and every neighboring pair, including when a class has fewer than records. Because depends on , the client privatizes the prior block first and then, conditionally on , privatizes the summary block with calibrated so that equals the constant in Theorem 1. By adaptive composition of Gaussian mechanisms, this sequential release satisfies the same -DP as Theorem 1, so selecting from incurs no additional privacy cost (Appendix D.1).
(3) Neither failure mode violates the guarantee. If overestimates a class size, that class's summary is divided by instead of and shrunk toward the origin; the sensitivity bound still holds, and the scale-invariant cosine similarities used for rival selection are unaffected. If underestimates the minimum class size, the discrepancy arises only from prior-block noise and is smaller. Our rule is a best-effort estimate from privatized data alone; public, non-sensitive class-size knowledge (e.g., population proportions or domain priors) can sharpen and improve the privacy--utility trade-off without affecting the guarantee.
Response to Reviewer 8cNL (3/3)
Concern 3. Usefulness of the quantum component. We address the simulation results, the hardware results, and the practical benefit separately.
(1) Simulation. The quantum predictor's advantage is small but statistically consistent, and we do not interpret it as a general quantum advantage. Under the identical privatized interface, paired Wilcoxon signed-rank tests across the 200 TALENT datasets with Holm correction give adjusted -values of , , and against the MLP, Fourier, and Transformer heads (Table 4). A few-qubit predictor is therefore at least as effective as classical heads of comparable size, with a small but consistent improvement.
(2) Hardware. We agree that the original drop from to was substantial: the model had been trained in noiseless simulation and executed directly on hardware without adaptation to device noise. We have therefore performed noise-aware training. We obtained the device-calibrated noise model of ibm_kingston, ran additional local noise simulations of hardware imperfections with 64 shots, and re-evaluated QICL on the real ibm_kingston processor with the same nine datasets, shots, and the same privacy budget (, ), retaining the client-side Gaussian mechanism. Average hardware accuracy rose from to , a percentage-point improvement, with the residual gap attributable to finite-shot estimation, gate and readout errors, and mismatch between the noise model and the device at execution time. QICL thus retained performance close to its ideal-simulation counterpart under the same privacy setting. Quantum noise experiments (Figure 8 and Appendix D.4) further show that more shots and lower depolarizing probability improve accuracy, confirming how quantum noise affects prediction.
(3) Practical benefit. These results establish the feasibility of combining a compact differentially private interface with a few-qubit predictor executable on existing hardware: classical comparisons show a modest predictive benefit, and hardware experiments show this performance was largely retained on-device. We do not claim that QPU inference is more efficient end to end than classical inference. The value of QICL is that it addresses a setting in which a remote quantum backend is used and supplies what such deployment requires: a record-level DP guarantee for the uploaded context that holds regardless of server behavior, communication scaling with the number of classes rather than context records, and an input compact enough for few-qubit circuits. QICL is thus a privacy-preserving serving architecture usable now and applicable as hardware matures.
We have updated limitations and future work in Section 5 to state that a residual simulation-to-hardware gap remains after noise-aware training, to be addressed by hardware-informed calibration, error mitigation, and hardware-in-the-loop fine-tuning.
References
[1] Nguyen, H. T., Krishnan, P., Krishnaswamy, D., Usman, M., & Buyya, R. (2024). Quantum cloud computing: A review, open problems, and future directions. arXiv preprint arXiv:2404.11420.
[2] Pérez-Salinas, A., Cervera-Lierta, A., Gil-Fuster, E., & Latorre, J. I. (2020). Data re-uploading for a universal quantum classifier. Quantum, 4, 226.
[3] Schuld, M., Sweke, R., & Meyer, J. J. (2021). Effect of data encoding on the expressive power of variational quantum-machine-learning models. Physical Review A, 103(3), 032430.
[4] Liu, Y., Arunachalam, S., & Temme, K. (2021). A rigorous and robust quantum speed-up in supervised machine learning. Nature physics, 17(9), 1013-1017.
Response to Reviewer 8cNL (1/3)
We thank the reviewer for the careful assessment and for recognizing the breadth of our experiments. We address the three concerns below and all changes are marked in blue in the revised PDF.
Concern 1. Necessity of the quantum component and novelty of the analysis. We thank the reviewer. We first clarify the objective, then address the empirical contribution of the quantum component, the necessity of quantum computation in our setting, and the scope of the theory.
(1) Objective. QICL does not claim a general quantum advantage. It asks a narrower question: what client--server interface makes few-qubit serving of tabular ICL viable under joint privacy, communication, and qubit constraints?
(2) Empirical contribution of the quantum predictor. Under the identical privatized interface (Figure 6), paired Wilcoxon signed-rank tests across 200 TALENT datasets with Holm correction give adjusted p-values of 4.13×10−5, 4.91×10−7, and 4.37×10−7 against MLP, Fourier, and Transformer heads. All are significant. The gains are modest but consistent, so the improvement cannot be attributed to the interface alone.
(3) Why quantum computation is considered. Our motivation is deployment, not advantage. QPUs are accessed through remote cloud services [1], unlike classical models that run on local infrastructure. This creates a client--server boundary across which sensitive task information must pass, making record-level representations undesirable due to privacy leakage, communication overhead, and the limited input capacity of few-qubit circuits. Few-qubit predictors are of interest because data re-uploading circuits realize trigonometric models whose frequency spectrum grows with encoding repetitions [2,3], yielding expressive nonlinear predictors with few parameters; rigorous quantum--classical separations exist for specific structured problems [4]. Whether these extend to tabular prediction is open, and we make no such claim.
(4) Scope of the theory. The upload-level DP guarantee deliberately relies on established Gaussian mechanisms and sensitivity analysis: because the client transmits classical representations to a remote QPU, privacy must be established before transmission and cannot depend on quantum computation that occurs after it. The analysis is nonetheless specific to the QICL interface: its bounded structured representation enables explicit record-level sensitivity calibration, and the stability analysis characterizes how privacy perturbations propagate through candidate-aware inference. The contribution is the integration and formal characterization of privacy within a communication-efficient quantum--classical architecture.
We further extend the theory to the quantum model. Under a binary Pauli-measurement model with depolarization probability p and Nshot independent measurement shots, if the uploaded privatized interface satisfies (ϵ,δ)-DP, the released binary-measurement outputs satisfy (ϵq,δq)-DP, with \begin{equation*} \epsilon_q =\log\left( \frac{ e^\epsilon+ \left(\frac{p}{2-p}\right)^{N_{\mathrm{shot}}} }{ 1+e^\epsilon \left(\frac{p}{2-p}\right)^{N_{\mathrm{shot}}} } \right), \qquad \delta_q
\frac{ 1-\left(\frac{p}{2-p}\right)^{2N_{\mathrm{shot}}} }{ 1+e^\epsilon \left(\frac{p}{2-p}\right)^{N_{\mathrm{shot}}} }\delta. \end{equation*} This bounds the contraction of privacy loss induced by the quantum model. It does not replace upload-level DP: the honest-but-curious server sees the uploaded representations and remains covered by the original guarantee. The tighter bound applies to an output-only adversary observing the specified measurement record or its post-processing. Appendix C.4 extends the bound from a single binary Pauli observable to the full predictor, which measures all nq qubits over multiple candidate circuits. Since the additional amplification may be negligible at large shot counts or low depolarization probabilities, we present this result as a complementary characterization of output-level privacy rather than the primary privacy mechanism.
(5) Privacy–utility trade-off. To quantify the privacy–utility implications of quantum noise, we investigate the privacy--utility trade-off at a fixed output-level privacy budget of ϵq=1. Lower depolarizing probabilities and more measurement shots improve prediction accuracy by reducing channel-induced distortion and measurement estimation variance, respectively. These results also suggest that calibrated client-side interface perturbation provides a more favorable privacy--utility trade-off than relying on quantum execution noise for privacy protection.
The revised manuscript incorporates the statistical tests (Table 4), the deployment motivation (Sections 1 and 2) and scope of the theoretical claims (Section 3.5 and Appendix C.4), and the quantum noise analysis with experiments (Figure 8 and Appendix D. 4).