- Rating
- 3
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes FockTrust, a natural-gradient optimizer for photonic circuits that defines the Fisher metric using the observed detector count distribution.
The motivation is to align optimization with the measured outputs used by the objective, including measurement effects.
The method combines count-based Fisher estimation with a KL trust region and is evaluated in photonic simulations.
This paper is well outside my expertise, so my judgment should be taken with a grain of salt. I find the motivation sound, but the novelty seems primarily limited to specific applications in photonics, since, to my understanding, most of the components already exist, including Fisher estimation from count data and natural gradients based on observed distributions. I lack the domain expertise to confidently assess the significance of this application-specific contribution. I therefore lean toward a borderline rating, with low confidence.
Critical strengths
The motivation is sound, and the results support it. When the objective depends on detector outputs, it makes sense to define the Fisher metric using those outputs. The reported comparisons support this approach: the count-based optimizer achieves 25.5% and 34.7% lower final KL-divergence losses than the ideal-state QFIM optimizer in the single-photon and two-photon settings, respectively.
Critical weaknesses
The evaluation uses a controlled task whose broader relevance is unclear to me. The experiments train a circuit to match the detector-count distribution of another circuit with the same architecture. This provides a useful demonstration in a setting closely aligned with the count-based metric, but I remain unsure how well the gains extend to practical photonic applications. A clearer connection to those applications would strengthen the paper.
The practical significance of the experimental scale is also unclear to me. It would help to explain how the simulated settings relate to relevant real photonic systems, and whether estimating and solving with the full Fisher is practical / impratical. It will help defend the experiment methodology and practical usefulness.
The novelty seems mainly specific to the photonics application. To my understanding, most of the ingredients already exist, including Fisher estimation from count data, natural gradients based on observed distributions, and KL trust regions. The main advance therefore seems to be adapting and combining these ideas for photonic detector counts. This is well motivated, but I lack the domain expertise to confidently judge the significance of this application-specific contribution.
My confidence is low because photonic optimization is outside my expertise.
Questions for authors
-
Generality of the evaluation. How representative is the teacher–student task of practical photonic optimization? Could you provide evidence that the gains extend beyond matching targets generated by the same circuit architecture, ideally through a more application-driven task?
-
Practical significance. Which photonic applications would benefit from FockTrust, and why would the reported improvements matter in those settings?
-
Relevant scale. How do the simulated circuit sizes and measurement budgets compare with real photonic systems? At those scales, is estimating and solving with the full Fisher matrix practical?
2 comments
I appreicate the response. I do not think that I can accurately judge these responses still. I maintain the score yet I hope that other reviewers to give this paper the justice.
Thank you for the thoughtful review, and for finding the motivation sound and supported by the results. Your three questions are the ones a reader outside photonics would ask first, and we added experiments and text for each of them.
The in-family target was chosen to isolate the geometry. We added two d=32 tasks without it, on the 12 held-out graphs. In the first, the target comes from a drifted detector, so no circuit parameter reproduces it. FF lowers excess loss by 24% relative to diagonal geometry and exact-QFIM NG, and by 50% relative to Adam. In the second, the target is known only through 2,048 measured samples, which is the setting of learning from experimental data. The reductions are 28%, 24% and 52% (Section 5.4, Appendix C.1).
Any photonic learner whose loss is computed from detector counts, for example
In these settings the detector is lossy and its efficiencies differ across modes. The new Proposition 1 shows that the count metric weights the state metric by these efficiencies, and FockTrust reads it from the gradient histograms at no extra measurement cost. The improvement holds across detection levels. With every method retuned, FF/QQ is 0.597, 0.591, 0.564 and 0.512 at mean efficiency 0.72, 0.60, 0.48 and 0.36. Section 4 now names Born machines and in-situ calibration as the target applications.
A 20-mode universal integrated processor has 380 thermo-optic phase elements that switch at kHz rates (Taballione et al., Quantum 7, 1071, 2023). We added retuned runs at d=64 and d=128, both below this count. On the recursive-tree graphs FF/QFIM-NG is 0.665 [0.601, 0.719] and 0.442 [0.390, 0.488], so the advantage grows with the number of phases.
The full Fisher is practical at these sizes. Every gradient method needs the 1+2d parameter-shift settings per step, which at kHz reconfiguration is about 0.26 s of hardware time at d=128. Forming and solving the dense count system takes 0.3 ms on one CPU thread, about a thousandth of that, and 0.17 s at d=1024. A diagonal-plus-rank-8 metric also keeps the dense gain (Appendix C.2).
We agree that the components are standard. What the paper adds is what they give a photonic learner. The full metric comes from the gradient histograms with no extra circuits and no detector calibration. It is the state QFIM weighted by what the detector resolves (Proposition 1), and under the same controller its same-count estimate lowers final loss by 36% relative to the exact QFIM. Our reply to Reviewer pc1s compares the method with prior work in more detail.
Thank you again, and we would be glad to answer any further questions.