- Rating
- 2
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes a one-step quantum state generative model based on classical noise re-uploading. Unlike existing quantum diffusion and transport-based approaches, the proposed method maps low-dimensional classical noise directly to quantum states through a parameterized quantum circuit, without requiring iterative denoising, ancillary-qubit post-selection, or a trainable classical neural network. The generator repeatedly encodes the same classical noise vector into a quantum circuit, interleaved with trainable rotation and entangling gates. The model is optimized using a Wasserstein distribution-matching objective based on quantum-state fidelity. The authors also introduce a conditional generation mechanism using disjoint latent intervals and establish a local distributional universality result under specific circuit controllability assumptions.
The method is evaluated on several quantum-state generation tasks, including single-qubit state distributions, entanglement-entropy fitting, correlated quantum noise estimation, ten-qubit transverse-field Ising model (TFIM) ground states, and conditional generation. Experimental comparisons with QuDDPM, QDT, QGAN, QFM, and LPQC suggest improvements in distribution fitting, parameter efficiency, and ideal generation success probability.
Critical strengths
- A simple and potentially efficient quantum state generation architecture.
The proposed framework eliminates iterative quantum denoising and measurement-based post-selection by generating quantum states directly from classical noise. This is an appealing architectural simplification, particularly because post-selection can substantially reduce the success probability of multi-step quantum generation. The ability to generate samples using a single complete circuit execution is a meaningful advantage.
- Nontrivial theoretical analysis of distributional expressivity.
A significant strength is the theoretical investigation of distribution-level universality rather than only pointwise function approximation. The authors establish a local Wasserstein universality result for pure-state distributions under explicit circuit controllability assumptions. This provides a stronger theoretical foundation for the proposed framework than purely empirical demonstrations of generative expressivity.
- Encouraging parameter efficiency compared with existing methods.
The experiments demonstrate promising parameter efficiency, particularly in comparison with LPQC. For correlated-noise estimation, the proposed method uses 143 trainable parameters compared with 5,164 for LPQC while achieving lower mean absolute estimation errors. Similar advantages are observed in the ten-qubit TFIM experiment, suggesting that classical noise re-uploading can provide a compact representation for certain quantum-state generation tasks.
- Evaluation across several quantum-state generation scenarios.
The paper considers multiple tasks, including distribution fitting, entanglement-entropy estimation, correlated-noise parameter recovery, TFIM ground-state learning, and conditional generation. The inclusion of recent baselines such as QuDDPM, QFM, and LPQC strengthens the empirical relevance of the study.
- A straightforward conditional generation mechanism.
The proposed use of disjoint classical latent intervals provides a simple way to control the generated quantum-state distribution without introducing additional conditional quantum operations or post-selection. The experiments on multiple circles and state clusters demonstrate the feasibility of this mechanism.
Critical weaknesses
- Insufficiently controlled comparisons make it difficult to attribute performance improvements to the proposed architecture.
The paper compares different methods under different training objectives and experimental configurations. For example, the proposed method uses a Wasserstein distribution-matching loss, whereas the QDT baseline uses a fidelity-kernel MMD objective and QGAN uses adversarial training. Importantly, the fidelity kernel used for QDT, (k(\rho,\sigma)=\mathrm{Tr}(\rho\sigma)), yields an MMD that depends only on the difference between the mean density operators. Consequently, distinct quantum-state distributions with identical mean density operators cannot be distinguished by this objective. This may partially explain QDT's poor recovery of the target circle in Figure 4. Without controlling the training loss, it is difficult to determine whether the reported improvements primarily arise from the generator architecture or from a more suitable optimization objective. This is a central concern because the paper makes strong claims about superior generative performance.
- The experiments provide limited quantitative evidence for learning complete quantum-state distributions in more complex systems.
Although the paper evaluates several tasks, most direct distribution-level comparisons are conducted on relatively simple single-qubit datasets. For the ten-qubit TFIM task, the evaluation primarily reports the distribution of transverse magnetization, which captures only one physical observable and does not fully characterize the generated quantum-state distribution. Similarly, accurate entanglement-entropy fitting does not necessarily imply accurate recovery of complete quantum states. The conditional generation results are mainly qualitative. Consequently, the experimental evidence is not yet sufficient to establish the claimed superiority in general quantum-state distribution learning, especially for larger or more complex quantum systems.
- The claimed computational efficiency is not comprehensively evaluated.
The paper emphasizes one-step generation, reduced training costs, and unit ideal success probability. However, one-step generation refers to a single complete circuit execution rather than a shallow quantum circuit. The proposed architecture can still require a substantial number of re-uploading layers, such as (P=100) in the ten-qubit experiment. The reported efficiency comparisons mainly focus on trainable parameter counts, post-selection probabilities, and numbers of pairwise overlap estimates. They do not provide comprehensive measurements of circuit depth, quantum gate counts, measurement shots, gradient-estimation costs, or actual training and generation time. Furthermore, the experiments rely on idealized simulation without a systematic evaluation of hardware noise and finite-shot measurement errors. These omissions make it difficult to assess the practical computational advantages of the proposed approach.
- The ablation studies are largely qualitative and do not sufficiently isolate the contributions of individual components.
The paper investigates noise width, latent dimension, re-uploading depth, and the number of parameter layers. However, the results are presented primarily through Bloch-sphere visualizations without quantitative Wasserstein distances, standard deviations, or convergence comparisons. Moreover, the latent-dimension experiment changes both input dimension and the number of re-uploadings under a fixed parameter budget, making it difficult to isolate the effect of dimensionality. The ablation studies also disable learnable noise scales, although these scales are used in several main experiments. A more systematic evaluation is needed to establish which components are essential and how they affect performance.
- The scope of the theoretical guarantees and several implementation details require clarification.
The main universality theorem relies on a sufficiently small noise domain and strong controllability assumptions on the parameter layers. It establishes the existence of suitable circuit parameters but does not provide quantitative bounds on the required re-uploading depth or guarantee that gradient-based training can discover such parameters. The relationship between these assumptions and the experimental configurations should be explained more explicitly. There are also minor reproducibility concerns: the main text reports five independent runs for the entanglement-entropy experiment, whereas Appendix D.1.3 states three runs. Additionally, the exact circuit configuration underlying the reported parameter counts, particularly the 5,703 parameters in the TFIM experiment, would benefit from clarification.
Questions for authors
- How much of the reported performance improvement comes from the generator architecture rather than the training objective?
The proposed method uses Wasserstein distribution matching, whereas several baselines employ different objectives. In particular, the fidelity-kernel MMD used by QDT does not distinguish all quantum-state distributions. Could the authors provide controlled comparisons in which alternative generator architectures are trained using the same Wasserstein objective, under comparable parameter or circuit-resource budgets? Such an experiment would materially strengthen the evidence for the proposed architectural contribution.
- Can the authors provide more comprehensive quantitative evaluations of complete quantum-state distribution matching?
The ten-qubit TFIM experiment mainly evaluates transverse magnetization, while the conditional generation experiments rely largely on qualitative visualization. Could the authors report quantitative distribution distances, such as empirical Wasserstein distances or other appropriate distribution-level metrics, for these experiments? It would also be useful to clarify whether the generated TFIM states accurately reproduce physical properties beyond magnetization. These results would help determine whether the model learns the full target distribution rather than only selected observables.
- How do the methods compare in terms of actual quantum computational resources?
Although the proposed method avoids post-selection, it can still involve deep quantum circuits due to repeated noise encoding. Could the authors report total circuit depth, single- and two-qubit gate counts, training time, generation time, and measurement-shot requirements under matched experimental settings? In particular, how do the advantages change when finite-shot estimation and realistic quantum noise are considered? This information is important for evaluating the practical significance of the claimed efficiency improvements.
- How restrictive are the assumptions required for the distributional universality theorem in practical implementations?
Theorem 1 requires a sufficiently small latent-noise domain and specific controllability properties of the parameter layers. Could the authors explain how these assumptions are verified for the precise circuit architectures used in the experiments? Additionally, is there any quantitative relationship between the approximation accuracy, the number of qubits, and the required re-uploading depth? Clarifying these points would help assess the practical implications of the theoretical contribution.
- Can the authors provide quantitative ablations and reconcile the implementation details?
The current ablation studies are primarily qualitative. Could the authors report quantitative distribution-matching performance across multiple random seeds and investigate the contributions of learnable noise scales and repeated encoding under matched parameter budgets? It would also be helpful to provide explicit circuit configurations and parameter-count calculations for the main experiments, and to resolve the discrepancy between the reported three and five independent runs in the entanglement-entropy experiment. These clarifications would improve confidence in the robustness and reproducibility of the results.
6 comments
Author Response (Part 2)
W3 & Q3 Its claimed efficiency is unconvincing without full circuit-cost evaluation and noise-aware experiments.
- Fairness of circuit configurations. We emphasize that, wherever possible, all other experimental settings are held fixed to ensure a fair comparison. Specifically, all methods evaluated in this work employ the circuit architecture shown in Fig. 2(b), with the same number of circuit layers used for our method and the baselines. The comparisons therefore use identical circuit depths, quantum gate counts, measurement-shot budgets, and gradient-estimation costs.
- Training and generation time. Our method uses a single-step formulation for both training and generation, avoiding the computational overhead associated with repeated steps in iterative approaches. Under otherwise comparable conditions, this provides a computational advantage over methods requiring multiple steps. Compared with LPQC under the same circuit configuration, our method also eliminates the additional classical neural-network computations required by LPQC during both training and generation, thereby reducing the associated computational overhead.
- Effects of noise and finite-shot measurements. Our objective is to learn distributions over quantum states, a task that can be formulated within the framework of fault-tolerant quantum computation. The primary contribution of this work is algorithmic; we do not claim to have established an advantage on noisy quantum hardware. Moreover, noise and finite-shot errors affect all methods considered and should therefore be assessed under matched experimental conditions. We expect our method’s advantages to persist in sufficiently weak noise regimes where the relevant quantum signal is preserved, although relative performance under noise ultimately requires empirical verification.
To assess robustness to noise, we have added an ablation study in which a depolarizing channel is applied after every single-qubit gate, with the noise-width parameter fixed at 0.02. The results for different depolarizing strengths are reported below.
| Depolarizing strength | |
|---|---|
| 0 | 0.0651 ± 0.0070 |
| 0.0652 ± 0.0071 | |
| 0.0690 ± 0.0095 | |
| 0.1338 ± 0.0056 |
These results show that weak depolarizing noise has only a limited effect on our method’s performance. Although stronger noise leads to a larger discrepancy, the generated quantum states still tend to concentrate near the training distribution, as illustrated in Fig. H.6.
We have also added an ablation study examining the effect of finite measurement-shot budgets. As shown below, the results obtained with 2,000 and 5,000 shots per overlap are close to the ideal-measurement baseline, whereas a budget of 100 shots leads to some degradation. These results indicate that our method can maintain performance close to the ideal baseline using a finite number of measurements.
| Training shots per overlap | |
|---|---|
| 100 | 0.0765 ± 0.0134 |
| 2000 | 0.0414 ± 0.0067 |
| 5000 | 0.0455 ± 0.0067 |
| Ideal | 0.0428 ± 0.0066 |
Because measurements in our method are primarily used to estimate the overlap matrix, Fig. H.8 further illustrates how the estimated matrix varies with the measurement-shot budget.
Author Response (Part 3)
W4 & Q5 The ablation studies are primarily qualitative.
We thank the reviewer for pointing this out. We have added the Wasserstein distances for all ablation experiments to the appendix.
In addition, we would like to point out that, while keeping the existing architecture unchanged, there is no way to simultaneously fix the number of repetitions P and vary the input dimension. With a fixed number of qubits, different input dimensions require different numbers of layers; if the number of repetitions is then also fixed, the number of parameters will be completely unequal. Unless the circuit structure is altered—for example, by placing parameterized gates after repetitions to keep the parameter count equal—which would entirely destroy the circuit structure and make a fair comparison impossible.
We have added an ablation study on with and without scaling, and it can be observed that scaling does indeed improve performance.
| Without scaling | With scaling | |
|---|---|---|
| 0.02 | 0.0655 ± 0.0059 | 0.0436 ± 0.0009 |
| 0.2 | 0.0428 ± 0.0066 | 0.0296 ± 0.0011 |
| 2 | 0.3161 ± 0.0377 | 0.0315 ± 0.0028 |
| 0.4282 ± 0.0112 | 0.2522 ± 0.0041 |
W5 & Q4 Clarifying the Applicability and Practical Verifiability of the Universality Theorem's Assumptions
We thank the reviewer for this clarification. Our theorem establishes the expressive capacity of forward-only data re-uploading: under the stated assumptions, sufficiently deep circuits can approximate arbitrary pure-state distributions. It provides an existence guarantee, without quantitative depth bounds or guarantees for gradient-based training. We will clarify this scope and explain that the experiments assess finite-depth performance and trainability empirically.
Theorem 1 requires a sufficiently small latent-noise domain. Therefore, we also demonstrate in our ablation experiments that enlarging the noise width does indeed degrade performance.
Regarding the entanglement experiments, we have fully rerun them five times and updated the results in the main text.
Author Response (Part 1)
W1 & Q1: Insufficiently controlled comparisons make it difficult to attribute performance improvements to the proposed architecture.We thank the reviewer for pointing this out. For QDT, we replaced its loss with the same loss used in our method and conducted five independent runs. The resulting test quantum-state data are summarized in the table below:
The empirical distribution of the first batch of target samples serves as the fixed reference for all distances; the Target row compares the empirical distributions of subsequent target batches with this reference.
W2.1 & Q2 The experiments provide limited quantitative evidence for learning complete quantum-state distributions in more complex systems.We thank the reviewer for the reminder. We have added to Appendix G the Wasserstein distance metrics for noise learning and for complex distributions such as TFIM. Specifically, for the noise learning in Section 5.4, the Wasserstein distances are as follows:
Furthermore, for the TFIM model in the main text, the Wasserstein distances are as follows. As requested by the reviewer, we also use the ground-state energy value E, one of the most commonly used metrics in quantum computing, to further verify the effectiveness of our method.
W2.2 Accurate entanglement-entropy fitting does not necessarily imply recovery of complete states, and the conditional-generation results are mainly qualitative.We thank the reviewer. We would like to point out that QFM itself is a method that fits only a certain metric rather than the distribution, and we have clearly illustrated this in Appendix A.2: indeed, one metric can correspond to multiple different quantum state distributions. However, this is a limitation of QFM; our method is capable of fitting the distribution, and we have demonstrated this in the paper. The entanglement fitting is only intended to show that our method can also fit metrics, and that it performs better than methods specifically designed for metric fitting.
W2.3 the experimental evidence does not yet establish claimed superiority in general quantum-state distribution learning, particularly for larger or more complex systems.We would like to emphasize that we have demonstrated the advantages of our method across multiple benchmarks and a range of system sizes. While evaluating every possible dataset is infeasible, we do not claim that our method universally outperforms all alternatives. Rather, we believe that the breadth of our experiments provides compelling empirical evidence of its comparative advantages within the settings considered.
The experiments presented in our manuscript involve systems of up to 10 qubits. In comparison, the largest system sizes investigated in prior studies are 4 qubits for QuDDPM, 2 qubits for both QDT and QGAN, 8 qubits for LPQC, and 11 qubits for QFM. Given that the dimension of the quantum Hilbert space grows exponentially with the number of qubits, our experiments already cover a substantial computational scale relative to existing studies on quantum generative modeling.
To further assess the performance of our method at larger system sizes, we have extended the TFIM experiments to 14, 16, 18, and 20 qubits with P=50. The results are presented below: