- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This manuscript introduces a NQS net called Abel-tNQS. The model is a time-conditioned autoregressive network for representing a quantum-state trajectory over a finite time interval. The initial state is encoded in the complex conditional amplitudes, and the residual loss weights earlier times more heavily. The authors also derive bounds on the time-averaged infidelity. They test the numerical bound estimates on four- to six-spin chains, compare observables on chains up to 20 spins and a lattice, and run a ten-seed ablation on the weighting and initial-state constraint.
Critical strengths
In theory, the bounds are explained clearly, including the assumptions needed for them to hold. The ten-spin weighting ablation, using ten seeds per setting, keeps the architecture fixed and matches the equal temporal averages for the linear and uniform weights. Under this setup, the improvement is substantial. Besides, the implementation details make the results easier to assess. For example, the authors specify the gradient convention and state that the larger benchmarks use single realizations.
Critical weaknesses
1. Many ingredients are already in the closest work
Van de Walle et al. already use time conditioning, shared parameters over a time interval, an autoregressive representation, architectural initialization, and segmented continuation. Sinibaldi et al. already derive residual-based bounds on state and observable errors. Both are cited. That leaves the particular conditional-amplitude gate, the weight, and the fidelity formulation as the main additions. The cumulative bound uses unitary propagation and a standard state-distance argument. The factor-of-two improvement in Appendix A.1 is also relative to the specific linear state-distance derivation given there. I would not read it as a general improvement over earlier residual bounds. Table 2 mostly tells me how the designs differ. It does not show whether those differences lead to better training or a more useful error estimate, which is what I would need to judge their significance.
2. No direct comparison with an existing method
The 85% and 94% reductions in observable errors are a good result for the weighting ablation. Both are measured against the authors' own uniform-weight variant, though. I still cannot tell whether someone already using t-NQS would gain much by switching. The soft-penalty runs do not answer this either, since t-NQS already has an architectural initialization layer.
The benchmarks leave the same question open. The nearest-neighbor one-dimensional TFIM remains quadratic in fermions when the transverse field depends on time. For the product- initial state, efficient Gaussian reference evolution is available. The two-dimensional example has 16 spins and a Krylov reference. These are useful checks, but the earlier t-NQS paper already reports an TFIM and a driven Heisenberg example. The protocols differ, so I would not infer an accuracy ranking from this. Still, the present tests do not demonstrate greater computational reach.
3. The training loss and update rule need a closer check
The bounds use the Hilbert residual norm, while Eq. 13 trains a configuration-mean absolute finite-difference residual. The two can rank nonzero residuals differently. So the derivation gives a reason for the time weight, but it does not tell us how well the actual loss tracks the bound. I would like to know how much it matters in practice.
4. The diagnostic is only validated on four- to six-spin systems
The appeal of the fidelity diagnostic is that it could tell us about state accuracy without the exact trajectory. But the validation uses full-basis sums on four-, five-, and six-spin chains. For the larger systems, the paper reports selected observables. Agreement there does not establish state fidelity, so I still do not know how useful the diagnostic is at those sizes.
Questions for authors
- What does the conditional-amplitude gate improve over the t-NQS initialization layer? Can the two be compared under the same compute budget?
- Does linear weighting still help with semi-gradient updates? How sensitive is the gain to the residual surrogate, and does it carry through to the Hilbert residual and fidelity-bound estimates?
- Can the diagnostic be tested beyond six spins, with an available reference and measurements of sampling variability, cost, and tightness?
4 comments
Response to RjFR (2/2): training objective and state assessment beyond six spins
This second comment addresses the remaining questions raised in your review.
Objective, gradients and weighting (W3, Q2). The Hilbert norm in the bound and the mean-absolute training surrogate are related by for the same D-component residual, where a is its complete-basis mean absolute component and rho its Hilbert norm. This population relation does not bound the norm using a finite minibatch. The dimension-dependent factors allow different objective rankings, so we evaluate the physical residual alongside state fidelity. Finite-difference training additionally introduces derivative error; semi-gradients omit differentiation through .
We tested MAE/full, MAE/semi and Hilbert-norm/full under uniform and linear weighting, with three paired seeds per setting: 18 runs. These controls use automatic time derivatives, all 1024 configurations, paired initialization/time draws and 3000 updates. Weights 0.5 and 1-t have equal integrals. Hilbert-norm training uses ; assessment uses the unsmoothed physical residual. The common 401-point evaluation gives:
| Objective / update | Averaged fidelity, uniform → linear | Numerical cumulative lower estimate, uniform → linear |
|---|---|---|
| MAE / full | 0.97715 → 0.98868 | 0.93142 → 0.95612 |
| MAE / semi | 0.95106 → 0.98358 | 0.89785 → 0.95804 |
| Hilbert norm / full | 0.98301 → 0.99071 | 0.95374 → 0.96724 |
Linear weighting improves averaged fidelity and the cumulative numerical lower estimate in all nine pairs, including semi-gradient and Hilbert-norm training. Mean terminal fidelity decreases slightly in both full-gradient settings. At intermediate checkpoints, some surrogate decreases coincide with worse assessed bounds; this explains why the post-training diagnostic is evaluated separately from training loss.
State diagnostic beyond six spins (W4, Q3). We calibrated the sampled diagnostic on a frozen N=10 control and the submitted N=20 checkpoint. Each assessment uses 201 times, 4096 configurations/time and 32 independent evaluation repetitions. The full-support proposal chooses a Born or uniform branch independently for each configuration. Importance weighting estimates the second moment of the physical residual before the square root and cumulative integration.
The cumulative numerical lower estimates are 0.930741 ± 0.000130 at N=10 and 0.881494 ± 0.000347 at N=20 (mean ± evaluation SD). Reference averaged fidelities on the same grid are 0.978066 and 0.954838; N=20 terminal fidelity is 0.726214. The N=10 full-basis diagnostic is 0.930757. At N=20, complete-state reference propagation is cross-checked against an independent propagator and Gaussian-reference observables. Reference states enter the fidelity calibration; the residual diagnostic is computed from the learned trajectory and Hamiltonian.
The 32 repetitions take 2.15/4.54 shared-GPU hours at N=10/N=20. Increasing nested sample prefixes from 256 to 4096 reduces evaluation SD from 0.000586 to 0.000130 and from 0.001124 to 0.000347, respectively. These prefixes reuse the 4096-sample caches. The N=10 grid-refinement change exceeds its sampling SD, identifying time resolution as an additional source of error.
For numerical certification, independent assessment samples and proved bounds on importance-weighted values would give concentration bounds on residual second moments. Upper enclosures would then propagate through the square root and cumulative functional, together with validated differentiation, normalization, initial-state, quadrature and roundoff errors. The present results are numerical estimates: evaluation SD quantifies sampling variability of a fixed checkpoint and excludes these other errors and nonlinear plug-in bias.
We also assessed the three default-budget native trajectories through the physical residual of their normalized, phase-retaining reconstructed wavefunctions. The common 401-point evaluation gives:
| Native seed | Numerical lower estimate | Reference averaged fidelity |
|---|---|---|
| 101 | 0.99964565 | 0.99989051 |
| 102 | 0.99961732 | 0.99987835 |
| 103 | 0.99980962 | 0.99995023 |
Analytic derivatives, finite differences and two coefficient propagators agree numerically, and 201-to-401 grid refinement changes the lower estimates by less than 5e-8. The native overlap matrices are ill-conditioned, so validated linear algebra is an additional requirement for certifying these trajectories.
N20 state-level calibration and objective controls
The revised manuscript incorporates the objective and gradient controls from our first response in Section 7.1 and Appendix A.16. All nine N=10 pairs improve averaged fidelity and the cumulative numerical lower estimate under linear weighting, including the semi-gradient and Hilbert-norm settings. Mean terminal fidelity decreases slightly in both full-gradient settings, and some checkpoint comparisons show that a lower surrogate does not improve the numerical lower estimate.
For W4 and Q3, Appendix A.20 now calibrates the sampled diagnostic on two frozen N=20 checkpoints with different state accuracies. The second is the first completed fresh-control endpoint, added after observing energy drift. Both use the same 201 times, 4096 configurations/time, equal Born/uniform proposal, and 32 independent evaluation repetitions:
| Fixed N=20 checkpoint | Cumulative numerical lower estimate | Reference averaged fidelity |
|---|---|---|
| Submitted model | 0.881494 +/- 0.000347 | 0.954838 |
| Fresh fixed-3000 control | 0.110748 +/- 0.000160 | 0.153132 |
The diagnostic itself needs the learned trajectory and Hamiltonian, while complete-state evolution supplies the independent fidelity calibration. The reported SD is evaluation sampling variation; differentiation, quadrature, normalization and roundoff require separate error control. The supplement reconstructs the complete reference and both 201-point model evaluations, extending the original four-to-six-spin validation to state-level assessment at twenty spins.
Appendix A.21 adds the completed three-pair N=20 weighting study. Linear weighting lowers correlation errors in every pair but increases mean full-window magnetization error, showing an observable-dependent effect at this budget.
For W1-W2 and Q1, the prior-work discussion is in Section 2 and Appendix A.6; the native tNQG comparison is in Section 7.2 and Appendix A.17; and the conditional-interpolation experiment is a same-MADE component control in Appendix A.18.
Follow-up on our responses and revised manuscript
Dear Reviewer RJFR,
We would like to draw your attention to our November 16 follow-up, “N20 state-level calibration and objective controls,” and the revised manuscript. Together with our first response, these cover the tNQG comparison, initialization-component control, objective and gradient controls, and state-level calibration at N=20.
We would appreciate your feedback on whether this evidence addresses your concerns, and we would be glad to clarify any remaining questions.
Thank you for your time and consideration.
The Authors
Response to RjFR (1/2): contribution, initialization and native-method comparison
Thank you for the detailed review. We performed quantitative comparisons, objective/gradient controls and reference-state calibration at N=20. This first comment addresses W1-W2 and Q1; the second addresses W3-W4 and Q2-Q3.
Contribution relative to prior work (W1). Abel combines normalized complex-conditional initialization with time-averaged fidelity analysis and the resulting training weight and post-training assessment. Wang et al. use an imaginary-time temporal network to generate parameters of a spatial autoregressive Transformer; our MADE uses additive time conditioning with shared weights. The cumulative bound follows a Duhamel/unitarity argument, building on accumulated-residual control in Sinibaldi et al. The coefficient comparison in the appendix is between our direct fidelity derivation and the stated linear state-distance derivation under exact initialization.
Initialization control (Q1). Van de Walle et al. enforce initialization by blending amplitude and phase outputs in Eq. (7). Abel instead interpolates normalized complex conditional vectors before local normalization. Its path is invariant under integer 2π relabelings of component phases. For equal-amplitude endpoints with relative phases 0 and π, choosing π or −π gives orthogonal amplitude/phase midpoints; complex-vector interpolation gives the same midpoint. It still requires a nonzero mixed vector. We will add this example to the appendix.
The experiment isolates this interpolation choice on a common MADE: both arms use fresh shared polar heads, paired initialization/time draws, linear gates, the same objective and 3000 updates. The baseline adapts amplitude/phase interpolation to normalized autoregressive conditionals; this replaces the submitted real/imaginary head in both arms. Complex interpolation increases mean averaged fidelity by 0.002677 and terminal fidelity by 0.009151; all three averaged-fidelity pairs improve. The logit/angle arm gives lower mean observable errors. Optimizer steps take 31.5–33.6 minutes for complex and 30.7–33.8 minutes for logit/angle interpolation on shared GPUs, excluding startup and I/O; the largest within-seed timing difference is 4.94%. The native-code experiment below compares the full tNQG method.
Native-method comparison (W2). We compared native-code tNQG and Abel on the N=10 open chain with J=1, h=0.5, +x initial state and Jt in [0,1]. Each native run includes five windows and all window/global refinements. We evaluated its default 20,000 updates/window and a 1000-updates/window configuration with a compressed cosine schedule. For the latter, independent timing calibrations fixed Abel allowances at 2300/3800/2500 updates before inspecting native accuracies. Abel uses AD, full-gradient MAE, 32 uniform times × all 1024 configurations/update, linear weighting, and LR 1e-4 to 1e-5 halfway through each allowance. Common 101-point normalized full-basis evaluation gives mean ± sample SD over three training seeds:
At the reduced-budget work point, Abel improves averaged fidelity and Mx/nearest-neighbor accuracy; tNQG has slightly lower distance-averaged correlation error. Native process times are 1.93/3.54/2.09 hours versus Abel 1.90/3.39/1.92 hours, including refinements, checkpointing and final evaluation. The two timing calibrations add 0.356 hours. The default native budget reaches averaged fidelity 0.999906 at approximately 24 hours/run (one run includes an interrupted-session cost reconstruction). Runs used shared A100 80GB GPUs: native tNQG uses an RBM/time-basis ansatz in FP64/complex128, whereas Abel uses an FP32 MADE.
The integrable chain gives a controlled reference problem for these comparisons. A reach comparison with the previous 8×8 result calls for matched lattice and evolution-window benchmarks.