- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper proposes a framework, GRPO-QPS, for quantum tomography, i.e., to reconstruct the density matrix (or its distribution) from a limited number of observations. It uses a learning-based sampler, along with Markov Chain Monte Carlo (MCMC), for faithful inference. The Metropolis correction is proposed in the paper. Experiments compare the proposed approach with conventional baselines Flow-GRPO (a general flow-based sampler) and BuresTomFlow.
Critical strengths
While other papers propose independent sampling methods, this paper proposes a Markov chain proposal model. I think being able to apply the Metropolis algorithm to flow-based models is a difficult problem because flow models do not give exact likelihoods. The paper claims to have solved this problem.
Critical weaknesses
The paper is very difficult to comprehend, partly because much knowledge of the application field (quantum computers) is assumed. Even otherwise, terms are used without being defined. This applies to all sections, including the method and experiments. Even after going through related papers, I found it difficult to understand the sentences in this paper.
The claims of the paper need to be supported by comparisons with relevant baselines, especially other established methods for Quantum Tomography (such as GQNQ [Zhu et al., 2022]). The paper uses BuresTomFlow as a baseline, but that itself is not available.
Questions for authors
Sec 3.1:
- Is the target distribution known? Eq. (5) also uses ; what is it?
- Line 127: What is the simulated truth? I assume the posterior is a distribution over . Do you mean the true is the truth?
Sec 3.2:
- Line 157: what is purification factor?
- Line 161: What is the declared posterior? Is it known? If not, how is it obtained?
Sec 3.3:
- How is the end point obtained?
- What is finite posterior comparator? Is it a set of samples from the learned-model?
- Is the energy score, maximised instead of minimised? Then only can the said objectives in line 169 be achieved.
- How are the trajectories of flow-model perturbed? What is group advantage, and what is the penalty mentioned in line 172? I can see these terms are borrowed from the Flow-GRPO paper, but explaining them here is necessary in the context.
Sec 3.4:
- What is ? How is it implemented and trained? I assume is here, right? What is ?
- Many terms are used without context and are difficult to follow. E.g., enumerated-diagnostics (line 191), multimodal study (line 200).
- How are the Gaussian mixture parameters of Eq. (7) learned? Do we have data of true trajectories?
Sec 4:
- Please explain what Dicke, cluster, cat, random mixed-state problems and transverse-field Ising model are. Is the target distribution available for these? If yes, what is it?
2 comments
Part 2/2
Sec. 4: The state families. All are standard test families in quantum information, and each structured family has a small noise parameter with a uniform prior. The revision gives each formula in Section 3:
| Family | Definition |
|---|---|
| Cat (GHZ) | (1 − γ)|C_φ⟩⟨C_φ| + (γ/2)(|0…0⟩⟨0…0| + |1…1⟩⟨1…1|), with |C_φ⟩ = (|0…0⟩ + e^{iφ}|1…1⟩)/√2 |
| Dicke | (1 − p)|D⟩⟨D| + pσ, where |D⟩ is the equal superposition of all basis states with two excitations and σ is a uniform mixture of such basis states |
| Cluster | (1 − p)|C⟩⟨C| + (p/n) Σ_i Z_i|C⟩⟨C|Z_i, where |C⟩ is obtained by applying controlled-Z gates between neighbouring qubits of |+⟩^{⊗n} |
| Random mixed | ρ(F) for a complex Gaussian factor F of rank 16 |
| Thermal Ising | ρ ∝ exp(−β(J Σ Z_iZ_{i+1} + h Σ X_i)), with coupling J, field h and inverse temperature β |
As explained above, each posterior is available up to its normalizing constant, and exact references exist for the two-qubit study, the 48-state example and the multimodal study.
Comparison with established tomography methods, including GQNQ. Table 25 already compares the following methods on the same records:
- maximum likelihood;
- classical shadows;
- a restricted Boltzmann machine density operator;
- an amortized neural operator;
- the prior mean.
Section 4.3 and Appendix I also include sequential Monte Carlo, the standard sampler for Bayesian tomography (Granade et al., 2016).
No public implementation of GQNQ is available, so we reimplemented its design. A representation network averages encodings of the measured settings and outcomes, and a generation network predicts the outcome distribution of any queried measurement. We trained it with five seeds on simulated records from the same families. We then recovered a state by linear inversion of its predicted distributions over all Pauli settings, followed by projection onto density matrices. Given exact probabilities, this procedure recovers the true state to a Bures distance of about 10⁻⁷. On the settings of Table 25, GQNQ obtains the following Bures distances to the true state (lower is better):
| Family | 4 qubits | 6 qubits |
|---|---|---|
| Dicke | 0.435 | 0.712 |
| Cluster | 0.602 | 0.723 |
| Cat | 0.643 | 0.591 |
| Random mixed | 0.768 | 1.073 |
GQNQ improves on the classical shadow and the RBM density operator in 7 of the 8 settings. It is less accurate than the amortized neural operator in all six structured settings, and less accurate than maximum likelihood in five of them. It also remains far from the prior mean and the Bayesian pipeline: on four-qubit Dicke states, for example, it reaches 0.435 against 0.041 for GRPO-QPS. With only eight measurement outcomes, a generic amortized model trained on the same families does not replace the physical prior. The revision adds GQNQ as a column of Table 25 and describes the implementation in Appendix O.
Availability of BuresTomFlow. BuresTomFlow is available at https://www.preprints.org/manuscript/202611.1144, for your reference
We thank the reviewer for a careful reading of a dense paper. We agree with the main criticism: the paper assumed familiarity with quantum tomography and used several terms before defining them. The revised version opens Section 3 with a notation table that defines these terms and gives the formula of every state family. We answer the questions below in the order in which they were asked. Section, table and figure numbers refer to the submitted version; the revision keeps them.
Sec. 3.1: Is the target distribution known, and what is ρ? ρ is a density matrix, the standard description of a quantum state: for n qubits, a positive semidefinite 2ⁿ × 2ⁿ matrix with unit trace. A measurement record y lists, for each measured copy of the state, the measurement setting and the observed outcome. By the Born rule, outcome m occurs with probability tr(E_m ρ). The target is the Bayesian posterior of Eq. (1): the prior multiplied by the probability of the observed record, then normalized. It is known up to its normalizing constant, so it can be evaluated at any state but not sampled directly, which is exactly the setting of Metropolis–Hastings. For the smallest problems (the two-qubit study of Table 3, the 48-state example and the multimodal study) we also compute the normalized posterior exactly, by numerical integration or enumeration, and use it as a reference.
Line 127: What is the simulated truth? In each experiment we draw a state ρ⋆ from the prior and simulate a measurement record from it. The methods never see ρ⋆; it is used only to score an estimate by its Bures distance to ρ⋆. The "truth" is therefore indeed the true ρ.
Sec. 3.2: What is a purification factor, and what is the declared posterior? Any density matrix of rank at most r can be written as ρ = FF†/tr(FF†), where F is a complex 2ⁿ × r matrix that we call the factor. Working with F guarantees that every state is positive semidefinite with unit trace. By the "declared posterior" we mean the posterior of Eq. (1) for the prior stated in Appendix C (Table 7); nothing in it is estimated from data.
Sec. 3.3: Flow-GRPO. BuresTomFlow defines an ordinary differential equation (Eq. 3) that carries a random initial state to a state consistent with the record. Flow-GRPO replaces it with a stochastic version that has the same marginal distributions: Gaussian noise is added at each integration step, so every step has a known Gaussian transition density. ρ_g is the state at t = 1 of the g-th such trajectory.
The finite posterior comparator {ρ̃_j} consists of M states obtained by importance resampling: candidates are drawn from the prior, weighted by their likelihood and resampled. They are not samples from the learned model. The energy score R_g is maximized. Its first term rewards closeness to the comparator, and its second term rewards spread among the G trajectories that share a record. The advantage of a trajectory is its reward minus the group mean, divided by the group standard deviation. The penalty is the Kullback–Leibler divergence between the updated and the original per-step transition densities, and it keeps the fine-tuned model close to BuresTomFlow. The revision states all of this in Section 3.3.
Sec. 3.4: The proposal Q_φ. Q_φ(x′ | x, y) is the proposal distribution of the Metropolis–Hastings sampler: given the current parameter x and the record y, it proposes a new parameter x′. The parameter determines the state, ρ = ρ(x). It consists of a few physical coordinates for the structured families and of the factor F for random mixed states.
We use two forms of Q_φ. The first chooses among four fixed moves (three step sizes and a fresh draw from the prior), with probabilities that depend on the state through a small linear layer. The second is a neural network that outputs the weights, shifts and covariances of a Gaussian mixture (Eq. 7). Training needs neither true states nor true trajectories. The sampler is simulated with the current proposal, and each trajectory is scored by how closely its averages match reference moments estimated from separate pilot chains. GRPO then raises the probability of the proposals made in trajectories that scored above their group's average.
The "enumerated diagnostics" are a study of a 48-state posterior whose transition matrix can be written down exactly (Appendix K). The "multimodal study" is the thermal experiment of Section 4.4, whose posterior has two mirror-image modes.