- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes a non-autoregressive method to generate classical shadow samples and predict properties of many-body quantum states. The authors theoretically analyze and find that the spin error is more severe than the basis change error during property prediction, and develop two geometric approaches to design flow matching for learning classical shadows. The first one is Spherical Flow, which embeds local measurement outcomes on the Bloch sphere and uses geodesic transport. The second one is Anisotropic Dirichlet Flow, which modifies the probability path to attract samples toward a target outcome while repelling its opposite outcome. Evaluated on 1D and 2D quantum systems of up to 100 qubits, the proposed method exhibits some improvement on predicting two-site correlations and two-site R'enyi-2 entropy compared to baselines.
Critical strengths
The paper introduces a novel method to integrate flow matching and classical shadow for quantum property prediction. The theoretical analysis is interesting. It connects the geometry of measurement outcomes to their consequences for observable estimation. The experiments are extensive and thorough across multiple 1D and 2D quantum systems and different qubit numbers.
Critical weaknesses
-
Clarification on the spin flip error and comparison with error mitigation for shadow is needed. To my understanding, the motivation for the two proposed methods is to reduce the impact of the spin-flipped error for conditional shadow generation. However, the paper does not clearly state where the error comes from. Is is from the generative model, the hardware noise or the readout of classical shadow? The spin-error analysis considers independent outcome flips, whose bias can be corrected by established robust shadow [1] or readout error mitigation methods when the noise rate is known (which can be estimated by calibration). If the modeling errors can be approximated by a calibratable channel, a comparison with appropriate postprocessing would help establish the benefit of the geometric construction.
-
The empirical evidence for the benefit the proposed method is limited. The paper considers two properties, i.e., the two-site correlation function and the two-site entropy. The results do not establish whether the improvements extend to higher-order correlations or larger-subsystem properties. Moreover, the gains over the DirichletFM baseline are unclear, especially for large system sizes on more complex Hamiltonians like the Heisenberg.
Questions for authors
-
How to interpret the results in Table 2? The marking for the best and second best results are not complete.
-
Consistency of the reported results. Please reconcile the ShadowGPT results in Tables 2 and 7. For TFIM L=10 at B=10k, Table 2 reports correlation/entropy RMSE of (0.021/0.038), whereas Table 7 reports (0.023/0.046). In addition, Section 5.2 states that ADFM performs best at (L=50), but Table 2 shows lower errors for Spherical Flow on both properties and a lower correlation error for ShadowGPT.
-
The gains over DirichletFM are small in several Heisenberg settings. Can the authors clarify when the geometric modification is expected to help?
3 comments
Additional rebuttal experiment — adjacent bonds and three-site subsystems.
| L=10, B=10k | Two-site correlation | Two-site entropy | Three-site Pauli | Three-site entropy |
|---|---|---|---|---|
| LinearFM | 0.098 | 0.148 | 0.065 | 0.167 |
| Antipodal-weighted LinearFM | 0.091 | 0.133 | 0.064 | 0.145 |
| ShadowGPT | 0.073 | 0.114 | 0.079 | 0.099 |
| DirichletFM | 0.058 | 0.090 | 0.068 | 0.079 |
| ADFM | 0.056 | 0.086 | 0.069 | 0.074 |
| Spherical | 0.063 | 0.097 | 0.062 | 0.077 |
| Measured shadows | 0.016 | 0.023 | 0.052 | 0.025 |
| Wang et al. | 0.090 | 0.143 | 0.063 | 0.112 |
About benefit of our method over DirichletFM, please refer to Tab 1, Tab 3 in the revised manuscript. Moreover, we want to emphasize that what we call DirichletFM in our work is our own implementation on this particular shadow generation task. We belive meaningful contribution lies in finding the optimal Hamiltonian conditioning layer, testing DirichletFM framework in quantum property estimation task (original work only shows its usage in language modeling or DNA sequence generation), and showing discrete state modeling of shadows give actually gives benefit. We further push these frameworks by incorporating inherent geometry of shadows amd explore whether that gives benefit in property estimation (prediction) of unseen quantum states.
Q1. Incomplete best/second-best table markings
Thank you for catching the missing markings. We corrected them and applied the same rule throughout: bold and underlining identify the two lowest distinct rounded values within the CFM/Diffusion and CS-DFM rows, including ties. See Table 2 in our revised manuscript.
Q2. Inconsistent TFIM baseline values and rankings
Thank you for pointing out the inconsistency. We reconciled the main and appendix ShadowGPT entries against the same three-run record and corrected the discussion to match the per-property rankings. See Tables 2 and 11 and Section 5.2 in our revised manuscript.
Q3. When should geometric modifications improve over DirichletFM?
We observed a tendency across the tested Heisenberg systems. The smaller systems often favored Spherical Flow, while several of the larger systems favored ADFM.
We understand this pattern in terms of the models’ inductive biases. Spherical Flow gives the learned field freedom to move probability on the sphere. ADFM prescribes how concentration changes at the target and its antipode. That extra structure may help when learning a larger joint distribution. The coverage sweep at fixed size shows why we treat this as an interpretation of the observed trend.
For example, at 10,000 shadows, Spherical Flow leads on both metrics on the 4×4 lattice, and ADFM leads on the 5×5 lattice. At 6×6, ADFM retains a small correlation advantage over DirichletFM and the two tie on entropy at the reported precision. Training coverage also affects the ranking. See Tables 1 and 3 in our revised manuscript for the size sweeps and Appendix H for the Haar coupling comparison.
We also figured out that basis aligning the Haar prior for spherical flow was important recipe to achieve improvement in performance: for the spherical coupling, draw with and permute its largest absolute coordinate onto the sampled basis axis. This uses no target sign and preserves the Haar marginal when averaged over uniformly sampled bases. Holding the Haar prior fixed on 4×4, the independent and aligned recipes give 0.07438/0.11652 and 0.06737/0.10137. Their validation-selected training durations differ, so the comparison measures the two recipes as run. See Appendix H in our revised manuscript.
Table 3 in our revised manuscript — 4×4 lattice, selected rows.
| 4×4 | Corr. 1k | Corr. 10k | Corr. 20k | Entropy 1k | Entropy 10k | Entropy 20k |
|---|---|---|---|---|---|---|
| ShadowGPT | 0.125 | 0.088 | 0.084 | 0.150 | 0.125 | 0.124 |
| LinearFM | 0.143 | 0.110 | 0.111 | 0.218 | 0.197 | 0.198 |
| QuaDiM | 0.118 | 0.076 | 0.071 | 0.157 | 0.139 | 0.138 |
| StatisticalFM | 0.113 | 0.073 | 0.074 | 0.160 | 0.136 | 0.137 |
| DirichletFM | 0.114 | 0.076 | 0.073 | 0.138 | 0.116 | 0.116 |
| ADFM | 0.113 | 0.072 | 0.069 | 0.132 | 0.102 | 0.102 |
| Spherical Flow | 0.109 | 0.067 | 0.068 | 0.130 | 0.101 | 0.102 |
Table 3 in our revised manuscript — 5×5 lattice, selected rows.
| 5×5 | Corr. 1k | Corr. 10k | Corr. 20k | Entropy 1k | Entropy 10k | Entropy 20k |
|---|---|---|---|---|---|---|
| ShadowGPT | 0.135 | 0.100 | 0.098 | 0.174 | 0.154 | 0.152 |
| LinearFM | 0.127 | 0.086 | 0.083 | 0.180 | 0.161 | 0.160 |
| QuaDiM | 0.124 | 0.085 | 0.083 | 0.170 | 0.149 | 0.146 |
| StatisticalFM | 0.121 | 0.090 | 0.087 | 0.162 | 0.146 | 0.144 |
| DirichletFM | 0.122 | 0.080 | 0.076 | 0.137 | 0.110 | 0.106 |
| ADFM | 0.118 | 0.077 | 0.073 | 0.129 | 0.105 | 0.103 |
| Spherical Flow | 0.117 | 0.082 | 0.078 | 0.146 | 0.121 | 0.119 |
Table 3 in our revised manuscript — 6×6 lattice, selected rows.
| 6×6 | Corr. 1k | Corr. 10k | Corr. 20k | Entropy 1k | Entropy 10k | Entropy 20k |
|---|---|---|---|---|---|---|
| ShadowGPT | 0.129 | 0.092 | 0.090 | 0.158 | 0.132 | 0.131 |
| LinearFM | 0.121 | 0.082 | 0.079 | 0.157 | 0.136 | 0.135 |
| QuaDiM | 0.124 | 0.086 | 0.082 | 0.165 | 0.145 | 0.142 |
| StatisticalFM | 0.125 | 0.085 | 0.081 | 0.178 | 0.156 | 0.154 |
| DirichletFM | 0.116 | 0.079 | 0.077 | 0.140 | 0.109 | 0.107 |
| ADFM | 0.115 | 0.077 | 0.074 | 0.137 | 0.109 | 0.106 |
| Spherical Flow | 0.119 | 0.078 | 0.075 | 0.139 | 0.113 | 0.110 |
We hope these changes address your concerns about our manuscript. Thank you for taking your interest and consideration into reviewing our work.
Thank you for your careful review and for pointing out these points.
Your questions helped us clarify where errors enter a generated shadow record and what evidence would demonstrate a benefit beyond two-site observables. We address these points with a clearer account of the error model, a three-site evaluation, and corrected benchmark entries. Please see the passages marked in orange in our revised manuscript for the changes we made in response to the reviews.
Thanks for pointing this out. The shadow error is coming from generation not from a hardware. Since we are using machine learning to optimize generative models, they are inherently imperfect, and some bias and variance resides in their prediction of generative trajectory. Now our idea was to incorporate geometry to more faithfully follow the inrinsic geometry of shadows and relate this to a better observable estimation of quantum states. We agree that a calibrated readout error can be corrected but the spin errors we study arise at a different stage. Even with an ideal measurement apparatus, a generator can assign the wrong probability to a sign given its basis and the outcomes at nearby sites. Our idea is to use geometry to guide the model when learning those probabilities.
Chen et al. address the measurement stage in Robust Shadow Estimation (PRX Quantum 2, 030348). They prepare a known calibration state, apply randomized measurements on the device, and use the calibration data to estimate the effective noisy measurement map. Its calibrated inverse is then used to estimate observables of the unknown state. Their analysis assumes a sufficiently well-prepared calibration state and gate-independent, stationary, Markovian circuit noise.
That correction works because the device channel acts on the measurement and can be characterized separately. Our generator has no device-induced attenuation factor to calibrate in these experiments and we are only dealing with an error coming from our trained generative model, which inherently has some scale of noise due to imperfect optimization of a machine learning model. Our method tried to levarage the geometry of shadows in order to mitigate this scale of error in generation of shadows. See Figure 2 and Appendix E in our revised manuscript.
We agree that predicting observables on a larger subsystem is a more demanding and interesting test. We therefore evaluated three-site Pauli observables and Rényi-2 entropy against exact diagonalization. The generated shadows also predict these more complex properties accurately in the tested setting. Spherical Flow improves on DirichletFM for both three-site metrics, and ADFM gives the lowest entropy error among the learned methods.
Three-site Rényi-2 entropy probes how well the generated records reproduce the purity of the larger subsystem.
On the 10-site chain, three-site entropy RMSE falls from 0.079 for DirichletFM to 0.077 for Spherical Flow and 0.074 for ADFM. On larger lattices the gains are more modest. At 6×6, ADFM improves correlation RMSE and ties DirichletFM on entropy at the reported precision. See Tables 1 and 3 and Appendix E in our revised manuscript for the main benchmarks and estimators. The additional test below uses eight adjacent triplets per Hamiltonian and a common budget of 10,000 shadows.
For each of 100 test Hamiltonians, we evaluate XXX, YYY, ZZZ, and XYZ on eight consecutive triplets Ai=(i,i+1,i+2). A snapshot contributes P=3∣A∣1[bA=P]∏i∈Aσi. For S2(A)=−logTr(ρA2) we estimate purity by averaging Tr(ρ^A(a)ρ^A(b)) over distinct snapshot pairs. The RMSEs average squared deviations from exact diagonalization over 100×8×4 Pauli targets and 100×8 entropy targets, respectively, before taking the square root.
About the benefit of ADFM over DirichletFM, we noticed that specific fix or ingredients further improves our proposal from the initial version of our implementation. For example, we refined one of inference formula for ADFM (Appendix. D) for more accurate roll out of generation trajectory and also added basis alignment technique for the spherical flow's prior. We also added more rigorous validation protocol for choosing best model during training. After that, we were able to see larger gap between our method and some of the strongest existing baselines (refer to tab 1 and 3 in the revised manuscript). Now, we believe the benefit of these geometric flow models are more pronounced based on these recipes. Please refer to the following tables and the ones in our revised manuscript.