{"id":"1524eaa3-b6d0-4169-86b2-2f055e487eb1","arxiv_id":"2504.14828","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper reports a variational quantum algorithm for the Poisson equation based on banded Toeplitz decompositions, claiming fewer decomposition terms than prior work, but with a questionable step in the multidimensional case.","lead":"This paper describes a new way to break up the matrix of a discretized Poisson equation into simpler pieces for a variational quantum algorithm. It claims to need fewer pieces than an earlier method, which could mean fewer measurements on a quantum computer.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Section 3.2's decomposition A' = 2I − L − L^{-1} + M5 is false for the circulant L defined in Sec. 3.1: with M5 = diag(1,0,...,0,1) the corner diagonals become 3, not 2, and the off-diagonal corner entries remain −1, so the d-dimensional term counts 4d+1 and 12d² rest on an invalid premise.","rationale":"The reader's weakest_assumption identifies exactly the same load-bearing error: the Section 3.2 identity A' = 2I − L − L^{-1} + M5 is false with M5 = diag(1,0,...,0,1), and the d-dimensional term counts depend on this identity. I verified the algebra independently. The one-dimensional decomposition in Sec. 3.1 is a separate construction based on Toeplitz matrices T_n^1 and T_n^2, and it is not invalidated by this Section 3.2 mistake; the 1D contribution may be salvageable. However, the paper's headline quantitative claim includes the d-dimensional case, where the number of terms is supposed to be less than in Ref. [24]. Since that claim is unsupported by the text as written, the existing REJECT verdict stands. No further adjustment is needed beyond the reader's assessment, because the identified error is load-bearing rather than a minor typo, and the paper provides no independent numerical or formal verification for the d-dimensional decomposition.","tokens_in":15605,"tokens_out":9964,"duration_ms":82572,"concrete_test":"Compute numerically for n = 4 (and n = 8) the matrices A', L, and M5 as defined in Secs. 2 and 3.2, and evaluate A' − (2I − L − L^{-1}) − M5. If the result is not the zero matrix, the identity in Section 3.2 is false. Then repeat the Section 3.2 count with the corrected corner matrix E = e_1e_n^T + e_ne_1^T in place of M5: expand ⟨b|A^{(d)}|ψ⟩ and ⟨ψ|(A^{(d)})²|ψ⟩ and count how many distinct unitaries appear. If the corrected counts exceed 4d+1 and 12d², the quantitative claim against Ref. [24] fails; if they remain within those bounds, the d-dimensional claim may be repairable despite the error.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 3.2 asserts A' = 2I − L − L^{-1} + M5, with M5 = diag(1,0,...,0,1) and L the n×n circulant shift having L_{1,n}=1 and L_{i,i-1}=1 for i>1. Direct computation gives (2I − L − L^{-1})_{1,n} = (2I − L − L^{-1})_{n,1} = −1, while its diagonal entries are 2. Adding diag(1,0,...,0,1) changes the first and last diagonal entries to 3 and leaves the off-diagonal corner entries at −1, so the right-hand side has (1,n) and (n,1) entries equal to −1, whereas A' has 0 there, and corner diagonal entries equal to 3, whereas A' has 2. The correct correction for the circulant wrap is an anti-diagonal matrix E = e_1e_n^T + e_ne_1^T, not the diagonal M5; that is, A' = 2I − L − L^{-1} + E. The subsequent decomposition of M5 into 1/2(\\tilde X − \\tilde X\\tilde Z), and every term count derived from it—⟨b|A^{(d)}|ψ⟩ in 4d+1 terms and ⟨ψ|(A^{(d)})²|ψ⟩ in 12d² terms—is therefore unsupported as written. This is not a cosmetic typo: M5 is the matrix that is spread across the d tensor factors in A^{(d)}, and replacing M5 by E changes the operators U_1, U_2, U_3 in the crossed terms and the number of independent terms. The 1D Sec. 3.1 decomposition, which uses T_n^1 and T_n^2 directly, is not affected by this error, so the 1D term counts of 5 and 6 may survive; but the paper's claimed d-dimensional advantage over Ref. [24] is built directly on the false identity.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a variational quantum algorithm for solving discretized Poisson equations by decomposing the coefficient matrix A and its square A^2 into linear combinations of banded Toeplitz matrices and sparse correction matrices. The authors claim five and six decomposition terms for the one-dimensional Poisson equation with different boundary conditions, and 4d+1 and 12d^2 terms for the d-dimensional Poisson equation with Dirichlet boundary conditions, which are claimed to improve on the decomposition counts in Phys. Rev. A 108, 032418 (2023). They also construct Hadamard-test and extended-Bell-measurement circuits for estimating the cost function, provide a numerical simulation for the one-dimensional Dirichlet case, and extend the approach to K-banded Toeplitz matrices.","tokens_in":16111,"tokens_out":9436,"duration_ms":76485,"significance":"If the decomposition counts were correct, the paper would offer a practically useful reduction in the number of quantum circuits needed to evaluate the variational cost function for Poisson-type problems. The explicit circuit constructions and the numerical demonstration for the one-dimensional Dirichlet case are useful contributions. However, the d-dimensional results rest on an algebraic identity that is false as written, and the one-dimensional unified-boundary term count appears inconsistent with the displayed decomposition. Since the claimed advantage over Ref. [24] is built directly on these decompositions, the central quantitative claims are not established by the manuscript.","major_comments":[{"comment":"This identity is false for the circulant shift L defined in Section 3.1. Direct computation gives (2I − L − L^{-1})_{1,n} = (2I − L − L^{-1})_{n,1} = −1 and diagonal entries 2. Adding M5 = diag(1,0,…,0,1) leaves the corner off-diagonal entries at −1 and changes the first and last diagonal entries to 3, whereas A' has 0 at the corners and 2 on the diagonal. The correct correction is the anti-diagonal matrix E = |e_1⟩⟨e_n| + |e_n⟩⟨e_1|, not a diagonal matrix. Because M5 is the object that is spread over the d tensor factors in A^{(d)}, the subsequent decomposition of M5 into (1/2)\\tilde X − (1/2)\\tilde X\\tilde Z, and every term count derived from it, including 4d+1 and 12d^2, is unsupported as written.","section":"Section 3.2, decomposition A' = 2I − L − L^{-1} + M5"},{"comment":"Even if the correction matrix were replaced by the correct anti-diagonal E, the decomposition M5 = (1/2)\\tilde X − (1/2)\\tilde X\\tilde Z is specific to the diagonal M5 and does not apply to E. The operators appearing in the crossed terms of A^{(d)} and (A^{(d)})^2 would change, so the sets M1 and M2 and the resulting counts of 4d+1 and 12d^2 would need to be re-derived. The claimed d-dimensional advantage over Ref. [24] therefore cannot be taken from the current manuscript.","section":"Section 3.2, decomposition of A^{(d)} and (A^{(d)})^2"},{"comment":"The statement that the number of decomposition terms of ⟨ψ|\\tilde A^2|ψ⟩ is 6 for different boundary conditions is inconsistent with the displayed formula \\tilde A^2 = T_n^2 − (4c+1−c^2)M_2 − (4d+1−d^2)M_3 + cM_4 + dM_5. In the Dirichlet limit c=d=0 this reduces to T_n^2 − M_1 and the count 6 = 5+1 is plausible. For nonzero c,d, however, there are four sparse matrices in addition to T_n^2; if T_n^2 is expanded in its five displayed components, the total is nine, and if T_n^2 is counted as a single term the total is five. Neither gives six. The claimed count therefore does not cover the 'different boundary conditions' case as stated.","section":"Section 3.1 and end of Section 3.1, count of six terms for \\tilde A^2"}],"minor_comments":[{"comment":"The word 'Toeplitz' is consistently misspelled as 'Teoplitz', including in the title, abstract, and keywords.","section":"Throughout"},{"comment":"The complexity expression 'O(ploy log n)' should read 'O(poly log n)'.","section":"Abstract and Section 4"},{"comment":"The numerical simulation validates only the one-dimensional Dirichlet case; no numerical evidence is provided for the unified-boundary or d-dimensional claims.","section":"Section 3.3 and Figure 5 caption"},{"comment":"The caption contains the typo 'Hadmard test'; it should be 'Hadamard test'.","section":"Section 3.2, Figure 3 caption"},{"comment":"Equations are not numbered, which makes it difficult to refer to specific claims; a numbered display for the key decomposition identities would substantially improve the presentation.","section":"General"}],"recommendation":"reject","confidential_remarks":"The central d-dimensional claim is invalidated by a direct algebraic error in the definition of the correction matrix M5, and the one-dimensional unified-boundary term count is also inconsistent with the displayed decomposition. These are load-bearing issues rather than presentation problems, and I do not see a way to preserve the manuscript's main quantitative claims without a substantial re-derivation."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the 1D decomposition is a real, modest improvement; the d-dimensional claims rest on a false matrix identity and don't hold as written.\n\nWhat is actually new: for the 1D Poisson equation with unified boundary conditions, the authors decompose \\tilde A = T^1_n - cM2 - dM3 and \\tilde A^2 = T^2_n - ... + cM4 + dM5, and give explicit circuits to evaluate the cost function with 5 and 6 expectation terms. I checked the 1D algebra; it is consistent, and it improves on the 7/15 terms in Ref. [24]. The circulant embedding for the Toeplitz parts is standard, but the sparse corrections are handled concretely and the n=8 simulation does show the expected convergence.\n\nThe soft spot is not soft. In Sec. 3.2 they claim A' = 2I - L - L^{-1} + M5 with M5 = diag(1,0,...,0,1). Direct computation: 2I - L - L^{-1} has -1 in the (1,n) and (n,1) positions because L and L^{-1} wrap around. Adding a diagonal matrix cannot remove those, and it turns the corner diagonal entries into 3. The correct correction is the anti-diagonal E = e_1e_n^T + e_ne_1^T. Everything that follows — the \\tilde X, \\tilde X\\tilde Z decomposition and the 4d+1 and 12d^2 counts — is built on this false identity, so the d-dimensional results are unsupported. This is a load-bearing flaw, not a typo.\n\nA secondary issue: in Eq. (2) the authors replace \\langle D^{-1}\\rangle by \\langle D\\rangle (and similarly for D^{-2}) with no comment. That is only legitimate when the expectation values are real, e.g. for real states from a Ry ansatz. For a general complex ansatz it would give the wrong value. They should state the assumption or keep the terms separate.\n\nBottom line: the 1D contribution and the banded-Toeplitz extension are salvageable and might make a short paper after revision. But as submitted, the central d-dimensional advantage is invalid. I would send it to peer review anyway, because a referee can pinpoint the fix; but the current version should be rejected.","headline":"The 1D decomposition is a real but modest improvement; the d-dimensional claims rest on a false matrix identity and don't hold as written.","tokens_in":16572,"tokens_out":6744,"would_cite":false,"duration_ms":55063,"reading_group":"maybe","serious_thinker":"no","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"A variational quantum Poisson solver decomposes A and A² into just 5 and 6 terms in one dimension, and 4d+1 and 12d² in d dimensions.","keywords":["variational quantum algorithm","Poisson equation","banded Toeplitz matrix","circulant embedding","Hamiltonian decomposition","cost function evaluation","Hadamard test","NISQ"],"falsifier":"Compute the first diagonal entry of 2I − L − $L^{{−1}}$ + diag(1,0,…,0,1) for any n≥2: the L and $L^{{−1}}$ shifts contribute no diagonal terms, while the corner matrix adds 1 to the (1,1) entry, giving 3 instead of A′'s 2, so the equality fails already at n=2 and the derived 12d² count would need a corrected derivation.","tokens_in":15410,"feed_emoji":"⚛️","tokens_out":6924,"duration_ms":58555,"temperature":0.7,"pith_summary":"The paper claims a cheaper way to evaluate the cost function of a variational quantum solver for the discretized Poisson equation. Instead of decomposing the coefficient matrix into Pauli-like terms, it writes A and A² as short sums of a banded Toeplitz matrix and sparse corner matrices, evaluating the Toeplitz part by embedding it in a circulant matrix and the sparse part by small specialised circuits. For the one-dimensional Poisson equation with unified boundary conditions the counts drop to 5 and 6, down from 7 and 15 in the comparison work; for the d-dimensional Dirichlet case the paper claims 4d+1 and 12d², both independent of the grid size n. If the counts hold, the number of circuit executions needed to estimate the cost function is substantially reduced on near-term hardware.","feed_headline":"Poisson solver cuts quantum cost function to 5 and 6 terms","feed_subtitle":"In d dimensions the same variational scheme drops to 4d+1 and 12d² terms, independent of grid size.","key_machinery":"The mechanism is the unit circulant shift L (the cyclic permutation matrix with ones just below the diagonal and in the top-right corner), its inverse $L^{{−1}}$, and the standard embedding of a Toeplitz matrix into a 2n×2n circulant matrix C_{2n}. Because L is diagonalized by the quantum Fourier transform, expectation values of Toeplitz pieces become Hadamard-test measurements of diagonal phases; the sparse boundary corrections M1–M5 are evaluated by extended Bell measurements. The paper's decomposition expresses the tridiagonal Poisson matrix as a short combination of such circulant shifts plus sparse corner terms.","core_discovery":"The central claim is that the structural features of the discrete Poisson matrix—constant diagonals away from boundary corrections—let one express the cost function E(θ)=⟨ψ(θ)|A²|ψ(θ)⟩−|⟨b|A|ψ(θ)⟩|² without ever forming A in the Pauli basis. A is written as a banded Toeplitz matrix plus a handful of sparse boundary matrices, and A² likewise; each Toeplitz expectation is evaluated by doubling the matrix into a circulant that the quantum Fourier transform diagonalizes. The paper's advertised figures are 5 terms for ⟨b|Ã|ψ⟩ and 6 for ⟨ψ|ò|ψ⟩ in 1D with unified boundary conditions, and 4d+1 and 12d² in d dimensions with Dirichlet boundary conditions.","pith_inferences":["Beyond the paper: the term count is a proxy for measurement cost only if each term needs comparable shots; the practical saving depends on how the measurement budget is shared among the terms, which the paper does not analyze.","The Toeplitz/circulant embedding used here is generic, so the same 5/6 decomposition should transfer to other constant-diagonal discretizations (e.g., convection-diffusion or heat equations), with only the boundary correction matrices changed.","The d-dimensional count 12d² rests on the algebraic identity A′=2I−L−L^{−1}+M5 in Section 3.2; a reader who verifies that identity directly will find the constant term needs checking before the multidimensional circuit count can be taken as settled."],"forward_implications":["For the 1D Poisson equation with unified boundary conditions, ⟨b|Ã|ψ⟩ is evaluated with 5 terms and ⟨ψ|ò|ψ⟩ with 6, so roughly half the quantum circuits of the 7/15-item baseline.","In d dimensions the counts are 4d+1 and 12d², compared with 4d+1 and (4d+1)²−(4d+1) in the baseline, a saving that grows quadratically with d.","The counts do not depend on the grid size n, so refining the discretization adds no new decomposition terms, only wider QFT circuits.","The same circuit templates extend to Hermitian sparse coefficient matrices whose diagonals are constant (a_{i,i+c}=a_c), including K-banded Toeplitz systems with K∈O(polylog n), giving variational linear-solver and matrix-vector-multiplication routines.","Numerical simulation for the 1D Dirichlet case with n=8 reaches a fidelity above 0.99, indicating the optimized ansatz state converges to the exact solution."],"supporting_citations":[{"why":"Supplies the previous decomposition counts (7 and 15 in 1D; 4d+1 and (4d+1)²−(4d+1) in d dimensions) that the paper's term counts are claimed to beat.","marker":"[24]"},{"why":"Gives the earlier tensor-product decomposition of the Poisson coefficient matrix that motivates the structural approach.","marker":"[21]"},{"why":"Provides the extended Bell measurements used to evaluate the sparse-matrix expectation values ⟨ψ|M_j|ψ⟩.","marker":"[27]"},{"why":"Supplies efficient quantum circuits for dense circulant operators, which underlie the Hadamard-test evaluation of the Toeplitz pieces.","marker":"[25]"},{"why":"Gives the Toeplitz-to-circulant embedding theory that justifies the doubled-matrix construction C_{2n}.","marker":"[26]"},{"why":"Provides an exact quantum algorithm for Toeplitz matrix-vector multiplication that the variational banded-Toeplitz section extends.","marker":"[28]"}],"fun_headline_variants":["Poisson solver: just 5 and 6 cost terms","Banded Toeplitz decomposition slashes Poisson VQA terms","Quantum Poisson algorithm uses Toeplitz, cuts to 5 and 6","Poisson VQA: 5 and 6 terms in 1D, 4d+1 and 12d² in dD","Toeplitz trick gives Poisson solver 5 and 6 term cost"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The d-dimensional term counts depend on the identity A′ = 2I − L − $L^{{−1}}$ + M5 with M5 = diag(1,0,…,0,1); if that identity is false, the 4d+1 and 12d² counts collapse.","fun_headline_variants_meta":{"raw":{"variants":["Poisson solver: just 5 and 6 cost terms","Banded Toeplitz decomposition slashes Poisson VQA terms","Quantum Poisson algorithm uses Toeplitz, cuts to 5 and 6","Poisson VQA: 5 and 6 terms in 1D, 4d+1 and 12d² in dD","Toeplitz trick gives Poisson solver 5 and 6 term cost"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.002,"raw_usage":{"total_tokens":7813,"prompt_tokens":961,"completion_tokens":6852,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":577,"completion_tokens_details":{"reasoning_tokens":6741}},"tokens_in":577,"tokens_out":6852,"duration_ms":40881,"temperature":1.0,"reasoning_tokens":6741,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T11:40:52.931897+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the first diagonal entry of 2I − L − $L^{{−1}}$ + diag(1,0,…,0,1) for any n≥2: the L and $L^{{−1}}$ shifts contribute no diagonal terms, while the corner matrix adds 1 to the (1,1) entry, giving 3 instead of A′'s 2, so the equality fails already at n=2 and the derived 12d² count would need a corrected derivation.","supporting_citations":[{"cited_title":"Li, Z.-X","cited_arxiv_id":null,"evidence_quote":"Supplies the previous decomposition counts (7 and 15 in 1D; 4d+1 and (4d+1)²−(4d+1) in d dimensions) that the paper's term counts are claimed to beat."},{"cited_title":"Liu, Y.-S","cited_arxiv_id":null,"evidence_quote":"Gives the earlier tensor-product decomposition of the Poisson coefficient matrix that motivates the structural approach."},{"cited_title":"Kondo, Y","cited_arxiv_id":null,"evidence_quote":"Provides the extended Bell measurements used to evaluate the sparse-matrix expectation values ⟨ψ|M_j|ψ⟩."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies efficient quantum circuits for dense circulant operators, which underlie the Hadamard-test evaluation of the Toeplitz pieces."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the Toeplitz-to-circulant embedding theory that justifies the doubled-matrix construction C_{2n}."},{"cited_title":"Gao and Y.-G","cited_arxiv_id":null,"evidence_quote":"Provides an exact quantum algorithm for Toeplitz matrix-vector multiplication that the variational banded-Toeplitz section extends."}],"review_version":1}