- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies parametrized quantum circuits whose trainable angles are restricted to a finite set A_K of K values spaced by 2 pi over K, motivated by finite control resolution. Two components are proposed. The first is resolution-aware angular re-uploading, which writes each input as B bit-level angular contributions and uploads them coarse to fine, with trainable CZ-conjugated mixing layers between levels, recovering ordinary finite-resolution angular encoding when the mixers are set to zero. The second is SISCO, a discrete optimizer. Because each circuit output is a first-order trigonometric polynomial in one angle, the 2P parameter-shift evaluations that a gradient would need also reconstruct the full coordinate-wise loss profile over all K admissible values. SISCO takes the per-coordinate loss-optimal move as a first search direction, selects M minus one further directions by a Fourier-descriptor criterion with a projection residual, and then runs a discrete line search along each. Evaluation covers 500 random circuit-matching instances under matched evaluation budgets, a two-spiral task, and Imagenette, CIFAR-10 and STL-10 with a frozen ResNet-18 front end at 4 qubits and 6 layers across three ansatzes, plus execution on IBM Kingston.
Critical strengths
-
The profile reconstruction is the strongest idea in the paper. Since a Pauli-generated rotation makes the output a first-order trigonometric polynomial in that angle, two shifted evaluations give the whole K-point profile for free, and the same two shifts are what a gradient would have cost anyway. Turning that into a discrete line search is a clean use of an existing budget, and the budget-matched study in Figure 4 is the right way to show it.
-
The empirical coverage is unusual for this literature. Three ansatzes, three image datasets, four qubit counts, three resolutions, and a QPU run, with the losing cells left visible. At K = 8 on Imagenette the method falls to 83.96 against 92.44 for the continuous reference, and the paper reports it.
Critical weaknesses
-
The premise is not tied to any device. No measurement, calibration report, or citation fixes 2 pi over 32 as a real limit on gate angle, and a single-qubit rotation on superconducting hardware is typically calibrated far below that. Koczor et al. 2024 already study PQCs under finite angle resolution, so the first-study framing in Section 1 also needs qualifying. If the constraint is hypothetical, the paper is a study of discrete optimization and not a response to a hardware barrier. And at the one resolution where the constraint bites, K = 8, the discrete model loses about 8.5 points on Imagenette, so the parity claim lives at the least constrained setting.
-
The headline comparison is not matched on circuit evaluations, and the encoding comparison is not matched on capacity. Tables 2 and 4 use the same number of parameter updates, while Appendix J allows 2P+1+M(K-1) evaluations per SISCO update against 2P+1 for a shifted gradient, which at K = 32 and M = 3 is 93 extra evaluations per update. Separately, the resolution-aware encoder adds B-1 mixing layers with n trainable angles each plus entangling layers, so the encoding gain in Tables 1 and 2 may be a parameter-count gain.
Questions for authors
-
Is there a device, present or near-term, for which 2 pi over 32 is the practical limit on a rotation angle? If not, what physical controller does the DPQC abstraction correspond to?
-
At K = 8 on Imagenette the discrete model reaches 83.96 and the continuous reference 92.44. Is that not the regime the paper is motivated by, and does a parity claim at K = 32 carry the intended message?
-
Tables 2 and 4 hold parameter updates fixed. What happens to the comparison when circuit evaluations are held fixed instead, as in Figure 4, given the 93 extra evaluations per update at K = 32?
-
The resolution-aware encoder has more trainable angles and more entangling layers than the conventional one by construction. What happens if the conventional encoder receives the same number of extra parameters and layers, without the bit-level structure?
-
The descriptor in Eq. (2) depends only on the step indices and the spacing, not on the circuit or the loss. So the complementarity term in Eq. (3) is the same for every circuit. Which part of the selection is actually informed by the circuit's Fourier spectrum, and does the ablation in Appendix F separate the geometric diversity from the predicted-utility term?
-
Table 3 gives 74.50 for CIFAR-10 and 85.17 for STL-10 under the ideal simulator, while Tables 2, 4 and 5 give 77.14 to 77.27 and 86.56 to 86.81 for the same datasets. Which configuration produced the ideal column in Table 3, and which number should the hardware gap be measured against?
-
Table 1 reports a task loss from 0.32 down to 0.14 without naming the task, the resolution, or the metric. Which experiment does that table summarize?
-
The six hundred test images per dataset give roughly sixty per class on CIFAR-10. Is the reported hardware gap, 73.83 against 74.50, resolved at that sample size?
4 comments
Part 2/2
Q5. Circuit dependence of the Fourier descriptor
We thank the reviewer for raising this distinction. The descriptor depends on the candidate direction components, the control resolution, and the known Fourier structure of Pauli-generated rotations. It does not depend on the measured or estimated Fourier coefficients of the current circuit. It characterizes which admissible pairwise Fourier interaction patterns a candidate search line can probe.
Circuit- and loss-dependent information enters through the profile-derived utility in Eq. (3). Direction selection therefore combines two sources of information:
- Profile-based utility, which depends on the current circuit and objective and predicts the benefit of a candidate displacement.
- Fourier-structured complementarity, which measures how a candidate differs from previously selected directions in the interaction patterns it probes.
The ablation in Appendix F isolates complementarity relative to greedy utility-only selection. For more comparisons, please refer to the randomized multi-line search baseline in our response to Reviewer WnN2, Point 3, where SISCO achieves lower mean loss at every tested . We will describe the descriptor as a Fourier-structured diversity criterion rather than an estimate of the learned spectrum of the circuit.
Q6. Table 3 ideal-simulator results and hardware reference
Table 3 compares hardware execution with an ideal-simulator evaluation of the same trained circuits, using the same class-balanced subset of 600 test images per dataset. Tables 2, 4, and 5 report averages over independent training seeds under their respective ansatz configurations and are therefore not the reference for the hardware comparison. The corresponding comparisons are:
| Dataset | Ideal simulator (%) | IBM Kingston (%) |
|---|---|---|
| Imagenette | 93.67 | 86.00 |
| CIFAR-10 | 74.50 | 73.83 |
| STL-10 | 85.17 | 84.50 |
We will report this configuration and the evaluation-subset protocol in the Table 3 caption and in the description of the hardware experiment.
Q7. Experimental setting of Table 1
Table 1 reports the final test cross-entropy on the two-spiral classification task. It compares conventional angular encoding with RA under identical training protocols for Nearest STE, Stochastic STE, and SISCO. We will revise the caption to state the task, metric, control resolution, encoding depth, and ansatz.
Q8. Statistical interpretation of the hardware accuracy gap
The 600-image subset was chosen to fit the available QPU budget while keeping the classes balanced. We agree that the difference between the simulator accuracy (74.50%) and the hardware accuracy (73.83%) on CIFAR-10 does not establish equivalent performance: the subset size limits statistical precision, and finite-shot measurement adds further uncertainty. Our conclusion is that the trained DPQC retains substantial predictive performance after compilation and execution on IBM Kingston, not that hardware execution is statistically equivalent to ideal simulation. We will state this interpretation in the revised manuscript.
Dear Reviewer apSA,
Thank you again for your reviews and for highlighting aspects of our presentation and experimental evaluation that required clarification. With one day remaining in the discussion period, we would greatly appreciate your feedback on our responses. We hope our responses have clarified your questions and concerns. If any points remain unresolved, we would welcome the opportunity to address them before the discussion closes.
Thank you for your time and consideration. Best regards, The Authors.
The authors conceded two points outright, that finite resolution is an abstract constraint rather than a device limit, and that the Fourier descriptor carries no circuit-specific spectrum. I accept both.
I also withdraw my K=8 comparison. 83.96 is STL-10 and 92.44 is Imagenette, and the dataset-matched gaps are 0.05, 3.31 and 2.66 points.
The evaluation-matched comparison on image classification is not resolved. The response offers one qualitative sentence and matched-budget curves on 500 synthetic instances, but no numbers for Tables 2 and 4 under matched circuit evaluations, which is where the 93 extra evaluations per update actually land.
The capacity-matched control is not resolved either. RA gives 95.92 plus or minus 2.54 against 94.40 plus or minus 2.50 for conventional RU. That 1.52 point gap is smaller than either standard deviation, and by the authors' own test in W2, where 0.38 under standard deviations of 0.45 was read as no difference, this cell cannot carry the encoding claim.
One number from their new hardware table also goes unremarked. Imagenette drops from 93.67 on the simulator to 86.00 on Kingston, a 7.67 point gap, while the text discusses only the 0.67 point CIFAR gap. I keep my rating.
Part 1/2
We thank the reviewer for the questions. We address each point below.
Q1. Physical interpretation of the finite-resolution constraint
We model a controller that can implement rotations only from a prescribed finite set of angles. This is an abstract hardware design constraint, not the measured native precision of a particular device. The setting follows prior work, including Koczor et al. (Probabilistic interpolation of quantum rotation angles, PRL, 2024), who study uniformly restricted rotation-angle sets and discuss control considerations such as DAC precision, waveform memory, control bandwidth, and power requirements.
K is the number of executable angles, and K∈8,16,32 corresponds to three-, four-, and five-bit angular control. We do not claim that 2π/32 is a measured limit of IBM Kingston or of any current processor; it is the finest resolution in our main image-classification experiments. We will revise the introduction to separate the hardware motivation from the abstract setting studied in this work.
Q2. Performance at coarse control resolution
The two numbers refer to different datasets: 83.96% is the STL-10 accuracy at K=8, whereas 92.44% is the continuous reference on Imagenette. The dataset-matched comparisons at K=8 are:
The effect of coarse control is therefore dataset-dependent: Imagenette stays close to its continuous reference at K=8, whereas CIFAR-10 and STL-10 degrade more. At K=32, RA + SISCO reaches 93.56%, 77.27%, and 86.56%, respectively.
We do not claim that discretization is lossless at every resolution. Our conclusion is that jointly designed encoding and optimization mitigate finite-resolution degradation, and that moderately fine discrete parameter sets retain competitive accuracy on the evaluated tasks. Note also that K=32 still restricts every trainable angle to 32 values; it is a finite-resolution model, not the continuous limit.
Q3. Evaluation-matched optimization
The reviewer's count is correct: at K=32 and M=3, the SISCO line search adds at most M(K−1)=3×31=93 evaluations per update. For classification under matched circuit-evaluation budgets and per-update wall-clock costs, please refer to our response to Reviewer WnN2, Points 1 and 7. We will state the distinction between the two evaluation protocols explicitly in the revised manuscript.
Q4. Capacity-matched conventional encoding
Please refer to our response to Reviewer WnN2, Point 2.