GRDM-QMC and Off-Diagonal BRA: A Small Benchmark
This note records a small benchmark comparing off-diagonal bipartite reweight-annealing (BRA) and GRDM-QMC under a common protocol. The point is not to claim that one method universally dominates the other, but to make clear what each method pays for in a direct imaginary-time off-diagonal measurement.
We benchmark the off-diagonal BRA method from our general-measurement work and GRDM-QMC for the same observable, Hamiltonian, and exact-diagonalization reference. The test uses an XXZ chain with , , , , and a fixed SSE cutoff . We measure
for and , at . Each fixed point contains 30 independent bins, with measurement sweeps per bin and independent random seeds. All runs were performed on the same local machine, a Mac mini with an M4 chip and 16 GB memory. Each subtask was timed independently, and both methods are compared with the same ED values.
For the BRA calculation, we do not assume an ED reference point. This is closer to the practical situation where an exact numerical reference may not be available. Instead, BRA first anneals the equal-time off-diagonal correlator from the Heisenberg point to . The -annealing path contains 20 points, and the overlap condition is chosen in the relatively loose range -, following the reweighting strategy of the BRA entanglement-entropy work. Since the -annealing requires two manifolds, we include the total runtime of both manifolds.
Starting from the resulting equal-time value, BRA then anneals the operator separation in imaginary time up to , with timing checkpoints inserted along the path. Thus, the cost at and is counted only up to the corresponding target segment. For GRDM-QMC, we time each independent task directly.
Figure 1: Runtime and statistical-precision comparison for the same benchmark. BRA times are counted as cumulative annealing times up to the target , while GRDM-QMC tasks are timed directly for each point.
Both methods reproduce the ED imaginary-time benchmark within statistical uncertainty. The agreement is characterized by the absolute deviation , which remains comparable to or smaller than the corresponding statistical error bars across the tested points.
For single- measurements, GRDM-QMC shows a clear practical advantage in this benchmark. The BRA runtime includes the cost of obtaining the equal-time reference through -annealing and then reaching the target imaginary-time separation, whereas GRDM-QMC samples each target point directly. Across the six benchmark points, GRDM-QMC reduces the wall time per bin by about 89%-94%. Under the same simulation setting, GRDM-QMC also gives smaller error bars for all tested points, with an error reduction of about 89%-93%.
Thus, for the imaginary-time off-diagonal correlators tested here, GRDM-QMC reaches ED-level accuracy with lower runtime and smaller statistical uncertainty.