- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper maps a homodyne record to a Euclidean vector by sorting the shots at each measured phase and averaging them into equal-mass quantile bins, which is the Radon cumulative distribution transform applied to measured quadrature marginals. Euclidean distances between these vectors equal the empirical sliced Wasserstein distance between the recorded distributions. The authors prove that the population object is a metric and an isometric embedding, derive an exact displacement law, a closed form for displaced squeezed Gaussians and a local line element in which displacement and squeezing are orthogonal, show that reducing the reference size is an orthogonal projection, and give a finite-shot rate. Experiments report MDS embeddings of displaced and squeezed grids and a regression of displacement and squeezing on cat states against a nuisance-adjusted Cramer-Rao benchmark, with moments, energy distance and an RBF mean embedding as baselines.
Critical strengths
-
Proposition 1 is exact and useful. A displacement shifts every quantile by a constant, so the embedding is affine in the displacement for any state, and the displacement readout is a fixed linear map that does not need refitting per state family. The grid experiment shows this survives 64 shots per phase, which is the kind of check that separates a geometric identity from a practical tool.
-
The geometry experiment reports the population limit next to the finite-shot result, so representation error and sampling error are separated. Table 2 does this explicitly, and the note that the squeezing grid error of 0.101 persists at infinite shots, and therefore belongs to the distance and not to the estimator, is exactly the right way to present this.
Critical weaknesses
-
The evaluation never compares against the estimator a practitioner would actually use. The primary testbed is a family with a closed-form likelihood, and Appendix D.4 shows a maximum-likelihood fit reaching 1.01 times the benchmark with no training states at all, while the pipeline sits at 1.6 to 1.9 times the benchmark. On the paper's own main experiment, the method is therefore less accurate than a zero-label estimator. The case where the embedding could pay off, a family with no closed form, is the Kerr cat in Appendix E.2, and that is where the main table should be.
-
Table 4 does not isolate the representation, and two of the baselines look handicapped. The embedding's coordinates contain the per-phase sample mean as an equal-weight average over the bins, and the moment baseline contains it directly, so both can express the sufficient statistic for the displacement. Both nonetheless sit well above the benchmark, at 1.58 and 3.05 times it, and the feature set that contains the statistic most directly is the worse of the two. That ordering points at the ridge fit rather than at the geometry, so "best feature at every budget" may mean "least badly regularized".
Questions for authors
-
Table 4, ridge regression, displacement. What error does a fixed-weight projection of the twelve phase means onto the displacement direction produce at 3072 copies? If it lands near the benchmark, Table 4 needs that arm, and the penalty path for each feature family should be reported.
-
Table 1. The record carries two budgets, labeled states and shots. Why is the comparison run along the label axis, where each extra label costs one simulation, rather than along the shot axis, where the physics actually charges you?
-
Figure 2 and Table 2. The grid error rewards linearity in the displacement and squeezing coordinates after an affine alignment, and the embedding is built to be affine in the displacement. What does the comparison with Bures or with the kernel establish beyond the fact that those distances are not parameter-linear?
-
Proposition 4 gives a shot term of order n to the minus one quarter, while Section 6.1 reports the error falling faster than that from 16 to 4096 shots. Is the bound meant to guide the choice of the phase count and the shot budget, or only to establish a rate?
-
Section 5 notes that with finitely many phases the distance is only a pseudometric. With twelve fixed phases, what can two states that agree on those twelve slices still differ in, and does the regression experiment inherit that blind spot?
-
A drift of the local oscillator phase appears in the record as a displacement. For the sensing use case in Section 7, is there any way to separate a real displacement from a phase drift without reference shots?
5 comments
Response Q1. The per-phase average is the efficient statistic for a displacement only when each slice is Gaussian. For a coherent state, the projection of the twelve averages onto the displacement direction attains the Cramer-Rao bound exactly. A cat's slice along its lobe axis instead consists of two narrow peaks far apart; the noise of the average is set by their separation, while the information about a shift is set by the width of each peak, so the average discards most of that information. A linear map on QSWE is a weighted sum of the sorted shots, so it can weight them by rank and in effect locate each peak separately, as efficient estimators of location do (Chernoff, Gastwirth & Johns, 1967). We ran the reviewer's projection as a simple check on the records of Table 4. Fitting the twelve phase averages to , with no training, gives times the floor on , far from the benchmark and the same as ridge regression on the Gaussian moments (3.05), which contain these averages. Ridge regression on QSWE reaches 1.58 from 48 labeled states, and an untrained weighting of the same coordinates derived from the model reaches 1.56. The penalty path is in our response to W2, and we will add this check to the appendix.
Response Q2. The comparison is run along both axes. Figure 4 holds the label budget at 48 states and varies the shot budget from 192 to 12,288 copies per state (16 to 1,024 shots at each of 12 phases), and Tables 4 and 5 give the full results at 3,072 and 768 copies. Along the shot axis the advantage of QSWE grows. At the smallest budget shot noise dominates and all feature sets lie within a few percent of one another; as the budget grows, QSWE read by ridge regression runs parallel to the Cramer-Rao floor, at about 1.6 times it for displacement and 1.9 times for squeezing, while the other feature sets flatten, so that at the largest budget their errors are two to three times that of QSWE. Table 1 adds the label axis at a fixed 3,072 copies. We agree that labels are cheap to obtain in some settings, and with plentiful labels the gap narrows as shown in Table 1. The kernel features with a nonlinear regressor match QSWE on displacement once given about ten times as many labeled states.
Response Q3. We agree that the grid error rewards linearity in the physical parameters, and this is precisely the property our representation is designed to exploit. The significance of this property goes beyond geometric alignment: it determines the complexity of the model required to recover physical parameters from the representation. Following the principle of Occam's razor, we favor representations that enable accurate parameter estimation with the simplest possible readout. When the parameters depend linearly on the embedding, a linear model suffices, providing a strong inductive bias and enabling sample-efficient learning. In contrast, representations with nonlinear parameter dependence generally require more expressive readouts, which can increase sample complexity and the risk of overfitting in low-data regimes.
The grid experiment therefore serves as an indicator of downstream learning complexity, rather than merely a measure of geometric linearity. This connection is supported by the regression results in Section 6.2: with only 48 labeled states, ridge regression on QSWE accurately estimates displacement and squeezing, whereas a nonlinear regressor on kernel features requires approximately ten times as many labeled states to match its displacement accuracy. Moreover, using a nonlinear regressor on QSWE actually worsens squeezing estimation compared with ridge regression. These findings support our central argument: the value of a representation lies not only in the information it preserves, but also in how simply and efficiently that information can be extracted.
Response Q4. The estimate provided in the proposition is the conservative upper bound. It assumes only that the quadrature distributions of the two states have a bounded moment of order , and at that generality cannot be improved. The measured error falls faster because the distances between the states of Figure 3 are large compared with the shot noise, so the noise changes them only at second order. A faster rate in general needs more than moments. The standard rate requires a condition on the density, which fails where the density vanishes, as at the nodes of a cat's fringes (Bobkov & Ledoux, 2019). We therefore use the bound only to establish a rate, and the faster decay measured in Section 6.1 reflects the particular states there rather than this worst case.
S. Bobkov and M. Ledoux, One-dimensional empirical measures, order statistics, and Kantorovich transport distances, Memoirs of the AMS 261(1259), 2019.
Response Q5. This is a very good question, and answering it has made the result sharper. Each homodyne slice shows the state from one direction in phase space, and turning the measurement phase reveals its angular structure. A coherence between Fock states photons apart makes the slices oscillate times as the phase goes once around. Twelve phases, together with the symmetry between opposite directions, view the state from 24 equally spaced directions. That is enough to resolve angular patterns that repeat fewer than 12 times around phase space, while faster patterns can be confused with slower ones or missed. Two states that agree on the twelve slices therefore share every quadrature moment of order below 12, including the mean and variance of every quadrature and the mean photon number, and they can differ only if they differ in some coherence between Fock states 12 or more photons apart. Among states with at most 11 photons, twelve phases determine the state (Leonhardt & Munroe, 1996). For the states of the regression experiment, the blind spot costs essentially nothing. They carry little population at 12 photons or more (a median of ), and at the same number of copies, the Cramer-Rao floor with twelve phases is within 0.3% of the floor with all phases for every target parameter. We will add this analysis to the appendix.
U. Leonhardt and M. Munroe. Number of phases required to determine a quantum state in optical homodyne tomography. Physical Review A, 54(4):3682–3684, 1996. doi:10.1103/PhysRevA.54.3682
Response Q6. We agree with the reviewer, and we will make the sentence in Section 7 more clear. A drift of the local-oscillator phase rotates the state, and the record sees the resulting motion of its center as a displacement. Whether the two can be separated without reference shots depends on the probe. For a coherent probe they cannot, since a rotated coherent state is exactly a coherent state with a rotated displacement. A probe with an orientation, such as a squeezed state or a cat, carries its own reference. A drift turns its shape as well as moving its center, while a real displacement moves only the center and leaves the shape unchanged (Proposition 1). In QSWE the two changes are also orthogonal - a displacement adds the same constant to every quantile at a phase, whereas a change of the centered shape averages to zero over quantile levels. The drift can therefore be read from the shape part of the same record and removed from the displacement part, provided the probe's orientation is tied to the frame in which the signal is defined. Appendix E.1 shows that a rotation of a squeezed state's axis is visible in the running embedding, although there the Gaussian likelihood monitor detects it sooner. We have not built such an estimator and see it as a direct follow-up.
We thank the reviewer for their time and consideration, and for the careful and candid evaluation of our paper. The review is remarkably thorough, and its questions led us to new analyses that have substantially improved the paper. We are pleased that the reviewer finds Proposition 1 exact and useful. We believe this is what makes QSWE a practical tool rather than only a geometric identity, in the reviewer's own words. Below we address the points raised by the reviewer.
Response W1. We agree that a family without a closed form, such as the Kerr cat of Appendix E.2, is where the embedding can pay off, and that it belongs in the main table. In the revision, the main regression table will be the Kerr cat. The closed-form cat will remain as the controlled test bed, where a likelihood fit attains the floor because it is given the correct model. A second reason to use QSWE even when a likelihood is available is the cost of inference. Its readout is a fixed linear map, fitted once from labeled records, so estimating a new state costs a sort and a dot product. A likelihood fit instead solves a separate nonconvex optimization for every state. In our implementation this takes 0.2 to 0.6 s per state, against under 0.2 ms for QSWE.
Response W2. We ran the penalty path the reviewer asks for in Q1, and the ordering in Table 4 does not come from the ridge fit. We refit every feature set of Table 4 at every penalty on a grid from 10−12 to 104, against the paper's 10−8 to 10, and recorded its test error at each. Even when the penalty is chosen in hindsight on the test states, which is more favorable than any procedure available in practice, no baseline comes close. QSWE at its validated penalty stays below every baseline at that baseline's best penalty, by 1.05 [0.94, 1.17] times the floor on displacement against the closest one, the energy CDF, and by 0.30 [0.22, 0.39] on squeezing against the Gaussian moments.
Ridge regression at 3,072 copies and 48 labeled states, on the records of Table 4 (30 repeats). Entries are test RMSE divided by the square root of the Cramér–Rao floor, mean ± 95% interval. Validated: the penalty chosen on the 24 validation states, as in Table 4. Best fixed penalty: the single penalty with the lowest mean test error. Best penalty per repeat: the penalty with the lowest test error in each repeat. For the RBF features the bandwidth is chosen together with the penalty: on validation in the first column, as the single best bandwidth in the second, and per repeat in the third.
We used the records, splits and seeds of Table 4 and changed nothing but the penalty, so the fits at the validated penalties reproduce Table 4 exactly. We will add the penalty paths of every feature set to the appendix.