- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper introduces QuMUSE, a generative pretraining framework for learning shared representations of quantum many-body ground states from local observables. A variational autoencoder compresses variable-sized measurement data into a fixed-size latent representation, while a conditional flow model generates latent representations from Hamiltonian and lattice specifications. The framework is pretrained on five Hamiltonian families with up to 100 qubits and evaluated on observable reconstruction, conditional generation, quantum property prediction, phase-boundary identification, and adaptation to unseen Hamiltonian families.
Critical strengths
- The paper addresses the important problem of learning reusable representations of quantum many-body states from local observables. The unified architecture supports both measurement-based reconstruction and conditional generation across different Hamiltonian families, system sizes, and lattice geometries, providing a meaningful connection to generative representation learning.
- The authors evaluate five Hamiltonian families with up to 100 qubits and demonstrate improvements in observable reconstruction and conditional generation over the evaluated baselines. The additional experiments on few-shot adaptation, nonlinear and nonlocal property prediction, phase-boundary identification, and unseen system sizes provide evidence that the learned representations capture physically relevant information.
Critical weaknesses
- The proposed framework combines established techniques, including query-based attention, variational autoencoders, conditional flow matching, and representation alignment. Although their integration for quantum many-body systems is useful, the methodological contribution beyond adapting these existing techniques appears relatively limited. In particular, it remains unclear whether the conditional flow model offers substantial advantages over simpler supervised models that directly predict observables from Hamiltonian parameters.
- Although a single model is pretrained across five Hamiltonian families, zero-shot performance deteriorates substantially on the three unseen families. Accurate predictions require fine-tuning using six target-system ground states and 2,500 optimization steps. Furthermore, the pretrained model does not consistently outperform training from scratch on every conditional-generation benchmark. These results demonstrate the benefits of pretraining for adaptation but provide weaker evidence for the broadly transferable representations suggested by the foundation-model framing.
- The training data are generated using classical DMRG simulations with a maximum MPS bond dimension of 64, and the main experiments use local expectation values computed from these approximate states. While the authors state that the DMRG calculations are sufficiently converged, quantitative convergence evidence for local observables and nonlocal properties is limited, particularly for larger 2D and frustrated systems. Although finite-shot measurement noise is investigated, the framework is not evaluated using experimental quantum measurement data. It remains unclear whether representations pretrained on classically tractable quantum states can generalize to more strongly entangled states that are difficult to simulate using tensor network methods.
Questions for authors
- What is the main methodological advance beyond combining existing VAE, query-based representation learning, and conditional flow-matching techniques? Could the authors compare against a simpler model that directly predicts local observables from Hamiltonian parameters and lattice specifications, without latent generative modeling?
- The zero-shot errors on unseen Hamiltonian families are much higher than those after fine-tuning. What limits the model's generalization to genuinely unseen Hamiltonians? In particular, how are previously unseen Hamiltonian-family identifiers and their coefficients represented by the pretrained physical-condition encoder?
- How sensitive are the local observables and nonlocal properties to increasing the MPS bond dimension beyond 64?
- How does the number of ground states and local measurement observables required for pretraining scale with system size, the diversity of Hamiltonian families, and the desired prediction accuracy? Can the authors quantify the computational or quantum measurement resources required to obtain these training data?
- The learned representations support linear probing of entanglement entropy and other nonlocal properties despite being trained only on local observables. To what extent does this capability depend on correlations specific to the training Hamiltonian families? How would the framework distinguish states with similar local observables but substantially different global properties?
4 comments
Question 3. How do larger bond dimensions affect local and nonlocal quantities?
For the bond-dimension study, please refer to our reply 1. Are the 10×10 J1–J2 reference states converged? to reviewer 7G3C.
For the nonlocal quantities specifically, we computed the central-cut von Neumann entropy for all twelve saved J1–J2 MPS states and checked the spectra using independent canonicalizations. At , the entropy increases from 1.381108 to 1.720615, 2.128044 and 2.410560 as increases from 64 to 128, 256 and 384. The corresponding results at the other two couplings are included in the same response to reviewer 7G3C. These measurements show why local-observable accuracy and nonlocal-label convergence should be assessed separately: reliable local predictions do not by themselves establish convergence of entanglement entropy. We discuss how the learned entropy predictor depends on the training distribution in our reply to Question 5 below.
For the measurement-noise concern in Weakness 3, please refer to our reply Question 2. Does the reconstruction benefit survive device-specific measurement noise? to reviewer oS7N. It reports the frozen model's performance under IBM Torino and Brisbane calibration-based noise simulations, including comparisons with raw measurements and known-channel inversion.
Question 4. What data and measurement resources does pretraining require?
The current training set contains fixed eighty states for each family–size combination, giving 1200 states across five families and three sizes. We audited the number of distinct nonidentity Pauli observables per state:
| Family | N=9 | N=36 | N=100 |
|---|---|---|---|
| 1D Ising / XXZ | 99 | 423 | 1191 |
| 2D Ising | 135 | 648 | 1920 |
| Cluster-Ising | 351 | 1647 | 4719 |
| J1–J2 | 180 | 990 | 3078 |
For these measurement layouts, the number of distinct observables grows as . For classical acquisition cost, the overall completed DMRG stages took 2.8 hours, with each stage taking approximately 0.6 hours on a 128-core CPU.
Question 5. Does entropy prediction rely on correlations within the training families? How would the framework distinguish states with similar local observables but different global properties?
The frozen QuMUSE representation supports accurate entropy prediction with only 24 target-family labels and no encoder retraining, outperforming the target-mean control in all five families. To examine how this depends on family-specific correlations, we first excluded each target family's entropy labels from both probe training and validation. We then fitted a fresh linear readout using 24 target labels, repeating this experiment with three subsets. Normalization and regularization were chosen using other-family data only. The encoder was pretrained on all five families without entropy labels and remained fixed throughout, so this experiment tests transfer of the entropy readout. The table reports entropy RMSE, with mean and standard deviation across the three subsets for the 24-label readout:
| Target family | No target-family probe labels | 24 target labels | Target-mean control, 24 labels | Random encoder, 24 labels | Pauli sketch, 24 labels |
|---|---|---|---|---|---|
| 1D Ising | 0.558361 | 0.162837 0.021057 | 0.237261 | 0.221658 0.008945 | 0.234257 0.004354 |
| 2D Ising | 0.752803 | 0.201524 0.016229 | 0.277050 | 0.254544 0.008161 | 0.274190 0.002924 |
| XXZ | 1.193769 | 0.111915 0.019345 | 0.440873 | 0.141948 0.007904 | 0.191556 0.009275 |
| Cluster-Ising | 1.273107 | 0.317961 0.065091 | 0.502225 | 0.352886 0.041649 | 0.332537 0.071244 |
| J1–J2 | 2.863499 | 0.093691 0.016165 | 0.293745 | 0.136695 0.004287 | 0.284839 0.008810 |
The errors without target-family labels show that the mapping from the representation to entropy depends on the Hamiltonian family. However, only 24 labels are sufficient to obtain a useful readout. The frozen representation outperforms the target-mean, random-encoder and Pauli-sketch controls in all five families. This supports the value of pretraining: it makes information relevant to entropy accessible through a linear readout, even though entropy was not a pretraining target.
For states with similar local observables, the encoder can exploit informative differences in the measured correlations. Alignment with physical-system representations encourages it to learn such structure, but cannot supply information absent from the inputs. If two states have identical values for every supplied observable and identical measurement metadata, the encoder cannot distinguish them. This is an information constraint shared by any method using those inputs.
We verified this distinction with an exact 12-qubit example. Two states have identical reduced density matrices on every contiguous region of up to three sites, but half-system entropies of 0 and . An additional measurement distinguishes them, with expectation values of 1 and 0. Thus, ambiguous cases require additional informative measurements. Within the tested families, the probing results demonstrate that QuMUSE already captures correlations useful for entropy prediction and makes them accessible with limited property supervision.
I thank authors for additional experiments and responses. The new DMRG results show some convergence issues. Generalization to unseen Hamiltonian families remains limited. The methodological novelty is relatively modest. Thus I keep my score.
Weakness 1 and Question 1. What is the contribution of QuMUSE, and how does it compare with direct prediction?
For the discussion on the novelty, please refer to the reply Weakness 1: What is the methodological contribution beyond combining existing components? to reviewer oS7N.
For the comparison with direct prediction, please refer to the reply Weakness 2: Stronger conditional-prediction baselines. to reviewer oS7N.
Weakness 2 and Question 2. How are unseen Hamiltonians represented, and what limits the zero-shot transfer?
In our implementation, we use a simple design. The condition encoder receives a sixteen-value vector: six family indicators, three coefficient slots, three masks and four lattice descriptors. The vector is normalized and passed through an MLP. This encoding is enough for representing the specified families and coefficients studied in the manuscript, but cannot express an arbitrary Hamiltonian term list. Extending this to arbitrary Hamiltonian is left for future work, which could be handled by a graph neural network.
In the adaptation experiments, triangular Ising reuses the 2D-Ising indicator with coefficients (1,g,0), long-range Ising reuses the 1D-Ising indicator with (1,α,0), and Kitaev reuses XXZ with (1,1,Jz). The same numerical slots therefore acquire different physical meanings in the target systems. This gives a plausible reason why fine-tuning is needed, together with the change in interaction and query geometry.
In addition, in the reply 2. Does pretraining help on unseen families? to reviewer 7G3C, we have shown that the clearest benefit is in reconstruction after adaptation. Since the ground states of different Hamiltonian families differ substantially, as illustrated in the visulization in Appendix E of the manuscript, building a model that has zero-shot transferability to any other system would require substantial amount of training data. We leave this for future work, because the goal of our paper is a first step towards a reusable representation for quantum states, which has never been discussed in previous quantum state characterization literatures.
Weakness 3. Can representations pretrained on DMRG data remain useful for more strongly entangled states, experimental quantum measurement data, and classically intractable states?
For reference accuracy, please see our reply 1. Are the 10×10 J1–J2 reference states converged? to reviewer 7G3C, which includes exact-diagonalization checks, larger-bond calculations and reevaluation of the frozen model against the refined references. For realistic measurement noise, please see Question 2. Does the reconstruction benefit survive device-specific measurement noise? in our reply to reviewer oS7N. Under the IBM Torino and Brisbane hardware with 1024 shots per observable, QuMUSE reduces raw measurement RMSE by 56.1–56.5% without retraining.
The additional question is whether using DMRG for pretraining imposes its entanglement restriction on QuMUSE. The encoder takes observable values and their measurement supports as inputs, rather than MPS tensors. Neither its inputs nor its learned representation carries an MPS bond-dimension constraint. Consequently, observables measured from a more strongly entangled state can be supplied through the same interface. Whether the pretrained model predicts them accurately is an empirical question about transfer to that state distribution.
Our higher-bond study provides a first test of this issue. For the 10×10 J1–J2 system at J2/J1=0.4, increasing the reference bond dimension from 64 to 384 raises the central-cut entropy from 1.336596 to 2.221383, while the unchanged model's generation RMSE improves from 0.095016 to 0.074503. Thus, predictions learned from the lower-bond data can remain useful against a substantially more entangled reference.
A complementary result is that pretraining improves reconstruction after adaptation in all nine target–seed comparisons across three unseen families, as reported in 2. Does pretraining help on unseen families? in our reply to reviewer 7G3C. Together, these experiments support using classically generated data to learn a reusable starting representation, with target measurements providing a route to adaptation.