- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper has a clear focus: replaces the Pauli LCU decomposition of a PDE discretisation with an LCU built from the stencil relations themselves. The key object is the Hermitian dilation of a partial signed permutation: for K relations the construction gives 2K+1 signed-permutation terms and K+1 unsigned skeletons independent of grid size, which specialises to 4d+1 terms for a d-dimensional Dirichlet heat operator. On top of this the paper adds a fixed-lift identity, a row-block residual decomposition for the distributed setting, a finite-shot variance and allocation analysis, and a control-variate estimator that reuses the previous update's shot counts. Experiments are circuit-simulator runs on heat and upwind convection-diffusion systems up to N = 32768 (15 qubits), plus a much larger emulation campaign.
Critical strengths
-
I think the directed case is a real gap in the prior art. Previously people decompose σx ⊗ A, which is the same operator as D(A) only when A is symmetric. The paper's use of [[0, A], [Aᵀ, 0]] is the correct generalisation to nonsymmetric A, and I confirmed that the leading structural decomposition work for this operator class contains no treatment of advection, upwinding, or directed operators at all. Extending completion to partial signed permutations with unequal forward and backward weights is a defensible contribution.
-
From the paper, the reporting discipline is better than the norm. The arithmetic is clean and reasonable.
Critical weaknesses
-
The contribution claim is not adequately separated from prior art, and the closest competitor is never benchmarked. This is my main concern. The paper "Variational quantum algorithms for Poisson equations based on the decomposition of sparse Hamiltonians" already decompose σx ⊗ A for the d-dimensional Poisson problem into 4d+1 Hermitian, one-sparse, self-inverse operators, and they note the extension to sparse matrices with constant diagonals. Corollary 2 of this paper recovers that same count for the same case. The paper says so in one clause of Related Work, but Contribution (1) in the introduction reads as if the completion construction is new. The same applies to the completion machinery itself: Gnanasekaran & Surana introduce unitary completion for exactly this class of structured sparse matrices and, in §VII of the 2026 paper, explicitly analyse unitary completion against unitary dilation for partial-isometry terms. Their decomposition gives 2 log₂ n_x + 1 terms for the 1D Poisson equation and polylogarithmic scaling for heat and higher-dimensional systems. The paper cites this line of work in one sentence ("Sigma-basis methods provide compact operator access") and never compares constructions, term counts, coefficient norms, or shots-to-target. Since the thesis is that structured LCUs are measurement-efficient, the Sigma-basis decomposition is the comparison that matters most and it is absent. Contribution (1) is therefore not established as new in its current framing.
-
I feel the experiments do not isolate the mechanism the paper claims. On the native N = 32768 heat study, StructVQLS and the direct-square control are statistically indistinguishable: S − D = −0.000142, interval [−0.003841, 0.003557], while both differ from merged Pauli. The direct-square arm is not a Pauli baseline; it compiles A² out of the same stencil relations (Eq. 15, 33 terms) and is a second short-coefficient-mass structured representation. So the gap against merged Pauli is evidence that a structured representation beats Pauli at matched shot budgets, which prior work already argues, and is not evidence for the 9-term linear completion specifically. The six-source study agrees (S-minus-D intervals span zero at all three sizes), and in the common-depth control at N = 32768 the direct-square arm is numerically better than StructVQLS (.01015 ± .0012 against .01226 ± .0029). The upwind studies and the cross-budget "75% fewer measurements" claim run S against M only, with no structured-square control. Until a factorised comparison exists that varies representation (Pauli / structured square / structured linear) against allocation on at least one nonsymmetric case, the reader cannot tell which ingredient produces the result.
-
Several load-bearing objects are used before definition ("merged exact Pauli", "charged", "selected tasks", "native", S/(4C) efficiency, Q_local(9,1) = 222). The r versus R distinction is easy to lose across sections. Figure 5's headline percentages ("S error: 48.3% lower E") are computed from the two displayed hand-picked samples, while the cohort statistics in Section 4.3 are different numbers; the caption flags this, but the figure invites the wrong reading. The abstract places the native upwind figures and the emulated cross-budget figure in adjacent sentences, and the native/emulated distinction is load-bearing.
Questions for authors
-
What exactly is new in Theorem 1 relative to "Variational quantum algorithms for Poisson equations based on the decomposition of sparse Hamiltonians" beyond the partial-signed-permutation and directed-interface cases? Please state the delta in the related work rather than leaving it to a single clause.
-
Why is there no comparison against the Sigma-basis decomposition, which targets the same operator class and reports 2 log₂ n_x + 1 terms for the 1D Poisson case? For at least one shared system, please report term counts, coefficient ℓ1 mass, per-coordinate variances, and shots-to-target for both constructions.
7 comments
The full information of the two papers I mentioned in the Weakness 1 are as follows:
-
Li, Hui-Min, Zhi-Xi Wang, and Shao-Ming Fei. "Variational quantum algorithms for Poisson equations based on the decomposition of sparse Hamiltonians." Physical Review A 108.3 (2023): 032418.
-
Gnanasekaran, Abeynaya, and Amit Surana. "Efficient quantum access model for sparse structured matrices using linear combination of “things”." Physical Review A 113.2 (2026): 022437.
In the response, please focus on explaining the difference between the proposed solution and the methods in above two papers. Thanks!
Response to Reviewer HDfi: Contributions beyond Li and Sigma
Thank you for clarifying the comparisons with Li et al. and the Sigma construction, and for asking us to isolate the measurement mechanism and improve the presentation. Section and table references are to the revised manuscript.
1. Added value beyond Li and Sigma (Sections 2-3, 4.5).
StructVQLS (S) carries reusable directed relations through residual-preserving learning to lower measurement noise and gate cost.
Li et al. (2023) establish the symmetric Poisson 4d+1 count (paper). We extend it to partial signed-permutation relations: truncated stencils and directed interfaces with unequal forward/backward weights. For K distinct nonidentity unsigned supports and nonzero real coefficients, completion gives 2K+1 Hermitian involutions sharing K+1 permutation skeletons. The fixed lift D(A)=[[0,A],[A^T,0]] preserves the original residual and derivatives for nonsymmetric solves with reusable circuits.
Gnanasekaran and Surana (2026) provide general Sigma matrix access and completion, including nonsymmetric matrices (paper). We organize measurements around fixed spatial relations and carry them through quadratic, RHS, scale and coordination gradients, coefficient-aware allocation and distributed execution. On fixed-coefficient heat systems, S retains nine terms and coefficient mass 3; Sigma grows from 9 to 17 terms and mass 4 to 6. Sigma/S initial full-gradient variance rises from 2.61 to 10.44.
Section 2 credits Hogancamp et al. for first-derivative operators and Shen et al. for block-local coordination. D=structured direct square; M=merged Pauli.
2. Sigma: lower gradient noise (Section 4.5; K.2, Tables 34-36).
We supply all four requested metrics using Sigma's recursive construction (V.1), tensor-sum extension and projected measurements (VI.1): four paired starts/size, shared ansatz/optimizer, 512 updates, 1M shots/full gradient. CPU emulation has no reuse; rejected projections are charged zero-valued observations.
| N | Terms S / Sigma | Mass S/Sigma | Initial variance S/Sigma | Final raw residual S/Sigma |
|---|---|---|---|---|
| 16 | 9 / 9 | 3 / 4 | 0.0060433 / 0.0157760 | 0.023424 / 0.024882 |
| 64 | 9 / 13 | 3 / 5 | 0.0060156 / 0.0343865 | 0.027899 / 0.027968 |
| 256 | 9 / 17 | 3 / 6 | 0.0060018 / 0.0626304 | 0.021228 / 0.021842 |
Variance is the mean initial full-gradient covariance trace. N=256 coordinate variances:
| Coordinate | S | Sigma |
|---|---|---|
| theta_0 | 0.0007255173 | 0.0071616319 |
| theta_1 | 0.0007255174 | 0.0071616526 |
| theta_2 | 0.0007254437 | 0.0070601333 |
| theta_3 | 0.0007255236 | 0.0071616395 |
| theta_4 | 0.0007255237 | 0.0071616725 |
| theta_5 | 0.0007254409 | 0.0070584295 |
| theta_6 | 0.0007255237 | 0.0071619339 |
| log scale | 0.0009233409 | 0.0127032766 |
Paired endpoint 95% CIs for Sigma-S: [-0.001734, 0.004651], [-0.000890, 0.001028] and [-0.000792, 0.002020]. Stable 1% hits are 0/4 for both at every size; each path costs 512M shots (2.048B/method/size). Stability requires five passing checks ten updates apart and a passing endpoint. The measured benefit is lower gradient noise at the same objective and budget.
3. Nonsymmetric allocation (Section 4.5; Tables 37-38).
S improves on M under both policies: N=64, beta=.2 convection-diffusion, four paired starts, depth-three ansatz, 512 Adam updates, 1M shots/gradient. Coordinate allocation uses coefficients or a charged 5% pilot plus 95% fresh samples; within-coordinate rules are fixed. D represents A^T A with unequal boundary corrections.
| Allocation | S final raw residual | D final raw residual | M final raw residual |
|---|---|---|---|
| Coefficient | 0.067958 | 0.067545 | 0.094304 |
| Charged pilot | 0.069494 | 0.068893 | 0.095303 |
S-M 95% CIs: [-0.048615, -0.004076] and [-0.047900, -0.003718]; S-D: [-0.000514, 0.001339] and [-0.001276, 0.002477]. Pilot-minus-coefficient interaction CIs: [-0.002333, 0.002710] for S-D and [-0.004641, 0.005714] for S-M. Both allocation policies retain the S-M gain in the 24-path control.
S/D both retain short heat coefficient masses: linear 3/3, quadratic 4.875/5.0. Eight paired native starts give S/D/M means 0.008505/0.008617/0.025050 and S-D interval [-0.002008, 0.001785]. At n=15, S uses 7.4%/9.8% lower expected CX than D on all-to-all/linear connectivity at rho=1: an additional circuit-cost benefit over D.
4. Definitions and presentation.
We clarified definitions in Sections 1, 3.3 and 4: merged exact Pauli, charged shots (pilots/fresh counts; past counts once), selected tasks and native GPU circuit-simulator sampling versus emulation. Section 3.2 defines Q_local(L,Delta), including Q_local(9,1)=222; Appendix F.1 defines S/(4C) using shots and summed maximum worker loads. Discretization r_k, raw residual r and aligned R are distinguished. Figure 5 (p. 8) uses each source's first registered start, labels percentages "example," and Section 4.3 reports cohort statistics.
I clarify a typo in the summary part that native runs reach N = 32768 is on the heat system experiment, and the reported upwind native runs are at N = 256.
Please focus on Weaknesses 1 first and give clarification to existing works.