{"id":"fcace2ed-e2b0-4f5b-8db8-15ef68262b5f","arxiv_id":"2505.08206","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A structural grouping of Jordan-Wigner transformed molecular Hamiltonians yields O(N^2) commuting groups, enabling shallower evolution circuits and fewer measurement runs than previous grouping schemes.","lead":"This paper proposes a way to group the many terms of a molecular Hamiltonian into fewer commuting sets, cutting the number of measurement circuits from O(N^3) to O(N^2) and the quantum circuit depth of time evolution by a factor of N. A smart generalist would read it because measurement overhead is a main bottleneck for quantum chemistry on quantum computers.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"As written, the grouping is incomplete: Algorithm 2 has no branch for the two-body XX and YY Pauli strings, so real molecular Hamiltonians contain terms assigned to no group.","rationale":"The reader's weakest_assumption was that every JW Pauli string is assigned to one of G1-G8 and that Algorithm 2 is complete. My stress-test confirms this is the load-bearing weak point: the printed algorithm has no dispatch for the XX and YY string types that necessarily arise from the one-body off-diagonal terms of any molecular Hamiltonian, and Eq. (11) does not include plain XaXb or YaYb strings. This is not a matter of disagreement with consensus; it is an internal gap between the paper's own Table I and its grouping Algorithm 2. The numerical tests in Table II and Figures 4-6 cannot close the gap because no code or data is provided and the tests do not report completeness of assignment or pairwise commutativity. I do not see a more fundamental obstruction: commuting groups of same Pauli type are automatically pairwise commuting, so the missing Appendix A proof for G3-G7 is less threatening than the coverage failure, and the asymptotic O(N^2)-group and O(N^3 log N)-depth claims would survive the straightforward patch of adding XX/YY to G2. Thus the correct disposition remains CONDITIONAL, as the reader concluded, and my read does not move the verdict, so UNCHANGED is appropriate.","tokens_in":19314,"tokens_out":19238,"duration_ms":200626,"concrete_test":"Generate the JW Pauli Hamiltonian for the 12-qubit LiH STO-3G system reported in Table II (631 terms), then execute Algorithm 2 exactly as printed. Count the number of Hamiltonian terms whose Pauli type is XX or YY and therefore never enter Gdict; if this count is nonzero, the partition claim fails as written. Then patch Algorithm 2 by assigning each XaXb and YaYb string to G2(a,b), re-run the grouping, and verify that all 631 terms are assigned and that every pair of strings in each resulting group commutes via a brute-force pairwise check, which is feasible at this size. This also reproduces or corrects the Table II group count.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim requires every JW Pauli string of a molecular Hamiltonian to be placed in one of the O(N^2) commuting groups. The paper's own Algorithm 2 cannot do this. Table I lists XX- and YY-type strings as genuine outputs of the JW transform of the one-body terms h_ij a_i^dagger a_j (Sec. III), but Algorithm 2's type dispatch covers only I/Z/ZZ, ZXX/ZYY/XZX/YZY/XXZ/YYZ, XXXX/YYYY/XXYY/YYXX, and XYYX/YXXY. There is no branch for 'XX' or 'YY'. The group definition in Eq. (11) is likewise incomplete: G2(a,b) contains ZiXaXb, XaZjXb, XaXbZk and the corresponding Y/Y strings, but never a plain XaXb or YaYb. Since off-diagonal one-body integrals are always present in a molecular Hamiltonian, the claimed partition into G1-G8 omits actual Hamiltonian terms. Appendix A also explicitly limits its commutativity proof to G8 and asserts the other families follow similarly; while this is a documented gap, the concrete failure of Algorithm 2 is sufficient by itself to invalidate the completeness part of the central claim as published. The fix is straightforward, namely extend G2(a,b) to include the plain XX/YY endpoint pairs, but until it is stated and implemented, the O(N^2)-group result is not supported by the text.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript proposes a deterministic grouping of the Pauli terms obtained from the Jordan-Wigner transform of a molecular Hamiltonian. It defines eight families of groups, G1-G8, and claims that the O(N^4) Hamiltonian terms can be partitioned into O(N^2) mutually commuting groups. On this basis it gives a parallel Trotter evolution circuit with per-step depth O(N^3 log N) and a measurement scheme requiring O(N^2) circuits, and it reports numerical counts of terms and groups for small molecules and for a series of alkanes.","tokens_in":19608,"tokens_out":9373,"duration_ms":93389,"significance":"If the grouping theorem were fully established, the paper would provide a genuinely better asymptotic construction than graph-based clique-cover methods, reducing the number of groups from O(N^3) to O(N^2) with classical preprocessing cost O(N^4). The authors deserve credit for deriving the group-count scaling analytically from the group definitions rather than from fitted parameters, and for presenting the numerical data as observations rather than as input to the claimed scaling. The overall idea is appealing and the identified gaps appear locally repairable, but the completeness of the partition and the commutativity of the groups are not yet established as written.","major_comments":[{"comment":"The partition into G1-G8 is incomplete. The JW image of a_i^dagger a_j for i<j includes the strings X_i Z_{i+1}...Z_{j-1} X_j and Y_i Z_{i+1}...Z_{j-1} Y_j, listed as the XX and YY types in Table I. However, the group G2(a,b) in Eq. (11) contains only strings of the forms Z_i X_a X_b, X_a Z_j X_b, and X_a X_b Z_k (together with their Y counterparts), and never a plain X_a X_b or Y_a Y_b. Algorithm 2 confirms the omission: its type dispatch covers I/Z/ZZ, ZXX/ZYY/XZX/YZY/XXZ/YYZ, XXXX/YYYY/XXYY/YYXX, and XYYX/YXXY, with no branch for the two-body \"XX\" or \"YY\" types, so such terms are not inserted into any group. Since off-diagonal one-body integrals are generically nonzero in molecular Hamiltonians, real Hamiltonians contain terms outside the claimed partition. The asymptotic count may survive a repair (for instance by adding plain X_a X_b and Y_a Y_b to G2(a,b)), but as written the central claim that all O(N^4) terms are partitioned into O(N^2) groups is not supported.","section":"Sec. III, Eq. (11), Table I, Algorithm 2"},{"comment":"The commutativity proof is only given for G8; the text states that for the other groups \"the proof follows a similar approach.\" This is not sufficient. The G3-G6 families are grouped by the nontrivial Med/Bia conditions of Eq. (12), and G7 uses the Med1/Med2 conditions of Eq. (15); pairwise commutation within these families is not immediate and needs an explicit algebraic argument or an exhaustive machine-checked verification for small N. Since the parallel evolution and simultaneous measurement protocols require every group to be fully commuting, this proof gap is load-bearing. The sketched case analysis for G8 is also informal and should be replaced with a complete argument covering all index orderings.","section":"Appendix A"},{"comment":"Algorithm 2 does not implement the grouping rules as defined in the main text. Equation (12) defines Bia = (l-k)-(j-i), but line 15 of Algorithm 2 computes index2 = (l-k)-(j-l), which is a different quantity. The comment on the same line also says that \"j and k are the indices of the third and fourth Pauli X (Y) operators,\" which conflicts with the notation X_i X_j X_k X_l in Table I. These discrepancies must be corrected for the algorithm to reproduce the theoretical groups.","section":"Algorithm 2"}],"minor_comments":[{"comment":"There are several typographical errors that should be cleaned up: \"workss\" in the introduction, \"Hamitonian\" in Algorithm 2, \"correspongding\" in Sec. III, and \"tt is easy\" in Appendix A.","section":"Throughout"},{"comment":"The range for Bia is stated as [4-N, N-4] \"assuming N <= 4\"; this should presumably be N >= 4, since the range is empty for N < 4.","section":"Sec. III, after Eq. (12)"},{"comment":"The abbreviated notation \"\\Z_i X_a X_b\" is introduced informally; the paper should state explicitly, for each abbreviated form, which qubits carry the omitted consecutive Z operators, especially for the XZX and YZY types where the omitted Z string contains a gap.","section":"Sec. III, after Table I"},{"comment":"The claim that \"using different mappings does not affect our grouping results\" is too strong as stated. Pairwise commutation is indeed basis-independent, but the actual Pauli terms change under the Bravyi-Kitaev transformation, so the grouping is not literally identical; the paper should clarify that the JW grouping is used as a template for the BK grouping.","section":"Sec. III, paragraph on other fermion-to-qubit mappings"}],"recommendation":"major_revision","confidential_remarks":"The asymptotic claims are attractive and the missing XX/YY case appears repairable without changing the scaling. Before further consideration I would want to see (i) an explicit extension of G2(a,b) to cover the plain XX and YY two-body terms, (ii) a complete or machine-checked commutativity proof for G3-G7, and (iii) a corrected Algorithm 2 that matches Eq. (12). The numerical section should also verify that every Hamiltonian term is assigned to exactly one group in the reported counts."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nYou should know two things about arXiv:2505.08206. The first is that the core grouping idea is genuinely new: the Med/Bia construction partitions JW-transformed molecular Hamiltonians into O(N^2) commuting groups, and the parallel Trotter scheme built on it would cut evolution depth by a factor of N. The second is that the paper as written does not actually prove that partition. The stress-test note is right: Algorithm 2 and the group definitions omit the plain two-body XX and YY strings, which appear in any real molecular Hamiltonian with off-diagonal one-body integrals. That is a load-bearing gap, not a cosmetic one.\n\nWhat the paper does well: the O(N^2) group count is derived analytically from the group definitions, not fitted to data; the numerical fits (2.81 and 2.16) are honestly presented as empirical and do not set any parameter. The parallel parity-loading Trotter scheme is a real contribution if the grouping holds. The authors also correctly note that their numerical tests count groups but do not verify commutativity or term coverage, and they explicitly flag the incomplete proof in Appendix A. The citation pattern looks fine; the claimed improvement over O(N^3) greedy schemes is consistent with the cited literature.\n\nWhere it is soft: the XX/YY omission is the main issue. The commutation proof is completed only for G8; the other group families are dismissed with \"the proof follows a similar approach.\" The numerical section never checks end-to-end correctness of the partition or the parallel evolution circuit. The variance claim is based on random states and is a side observation, not a supported scaling statement. No code or data are provided, which is a problem for a paper whose main deliverable is an algorithm.\n\nThe fixes are straightforward: extend G2(a,b) to include XaXb and YaYb, give a complete or unified commutativity proof, and ship reproducible code that actually runs the grouping on a real molecule. If the authors do that, the O(N^2) claim probably holds. As is, the central completeness claim is not supported by the text.\n\nThis paper is for people who do resource estimation for VQE and QPE and for researchers working on measurement grouping. It deserves a serious referee, because the idea is original and the gaps are fixable. I would not desk-reject it; I would send it to review asking for a corrected algorithm, a complete proof, and reproducible code. I would not cite it until the revision lands.","headline":"Genuinely new Med/Bia Pauli grouping with an O(N^2) group count, but the published partition omits the two-body XX/YY strings, so the central claim is not yet supported.","tokens_in":20164,"tokens_out":4089,"would_cite":false,"duration_ms":37572,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"Molecular Hamiltonians' $O(N^4)$ Pauli terms can be packed into $O(N^2)$ commuting groups, cutting simulation cost by $N^3$.","keywords":["fermionic Hamiltonian simulation","Jordan-Wigner transformation","Pauli string grouping","commuting operator groups","Trotter evolution depth","measurement reduction","quantum chemistry","variational quantum eigensolver"],"falsifier":"Take a molecular Hamiltonian at, say, $N=50$ orbitals, generate all Pauli strings under the Jordan-Wigner transform, run the paper's grouping rule, and check every pair within each output group for commutation; a single non-commuting pair, or a term that the rule fails to assign, would refute the $O(N^2)$ claim. A second check is to compute a minimum clique cover of the commutativity graph for small molecules and compare the clique number with the number of groups produced; if the minimum exceeds $25N^2+1$, the bound is wrong.","tokens_in":19085,"feed_emoji":"⚛️","tokens_out":8183,"duration_ms":74650,"temperature":0.7,"pith_summary":"The paper claims that the roughly $O(N^4)$ Pauli terms in a molecular Hamiltonian can be partitioned into only $O(N^2)$ families of mutually commuting operators, using the structure the Jordan-Wigner transform imposes. If true, one Trotter step of Hamiltonian evolution would have circuit depth $O(N^3\\log N)$ rather than $O(N^4\\log N)$, and estimating the energy would need $O(N^2)$ measurement circuits rather than $O(N^3)$ or $O(N^4)$. The grouping is done by direct rules based on Pauli-string type and two index invariants, so it avoids building the expensive commutativity graph. Because the number of groups and the shots per group both shrink, the total time for evolution plus measurement falls by a factor of $N^3$.","feed_headline":"One grouping rule packs O(N^4) Hamiltonian terms into O(N^2) groups","feed_subtitle":"A Trotter step becomes N times shallower and energy estimates need O(N^2) circuits, not O(N^3).","key_machinery":"The load-bearing object is the taxonomy of Jordan-Wigner Pauli strings into sixteen types, together with the grouping invariants for four-body strings and the Clifford unitary $U_n = \\prod_i (T_i+\\sigma_i)/\\sqrt{2}$, which rotates an arbitrary fully-commuting family into a qubit-wise commuting family. That rotation lets parity be copied to rotation qubits so all phase rotations in a family are applied in parallel, and it also underlies the simultaneous measurement scheme. The Med and Bia invariants are what make the group count quadratic in $N$ rather than cubic: fixing the symmetry axis and the bias of the two substrings forces enough overlap among the Pauli supports that every pair in a family commutes.","core_discovery":"Under the Jordan-Wigner transformation, every term of a molecular Hamiltonian becomes one of sixteen Pauli-string types. The paper's central claim is that these strings can be assigned, by type and by two index invariants ($\\mathrm{Med}=(j+k)/2$ and $\\mathrm{Bia}=(l-k)-(j-i)$, with a second pair $\\mathrm{Med}_1=(i+j)/2$, $\\mathrm{Med}_2=(k+l)/2$ for the crossed types), to eight families $G_1$ through $G_8$, so that each family contains only pairwise-commuting strings and the total number of families is $O(N^2)$. On top of this grouping, the paper constructs a parallel evolution circuit using parity and rotation ancillas: one Trotter step has depth $O(N^3\\log N)$ instead of $O(N^4\\log N)$, and simultaneous measurement of each commuting family brings the number of measurement circuits down to $O(N^2)$. Numerical tests on molecules up to 48 qubits and on alkanes up to $C_9H_{20}$ show group counts scaling as $O(N^{2.16})$.","pith_inferences":["The paper does not test the grouping on fermion-to-qubit mappings other than Jordan-Wigner, but its own Clifford-conjugation argument suggests the same $O(N^2)$ group count would transfer to any mapping related by a Clifford circuit; a full proof there would extend the result without redoing the JW analysis.","Because the appendix proves pairwise commutation only for $G_8$ and says the other families follow similarly, a complete proof for $G_3$ through $G_7$ would remove the largest gap in the central claim.","The observed group-variance reduction suggests a natural follow-up: adaptively distributing shots across groups by their variances could lower the total number of circuit executions below the equal-shot estimate, though the paper does not analyze that allocation.","For fault-tolerant operation, the $O(N^2)$ auxiliary parity and rotation qubits may dominate physical resources before the depth savings matter; whether that trade-off is favorable in practice is not addressed by the paper."],"forward_implications":["A single Trotter step of a molecular Hamiltonian can be executed in depth $O(N^3\\log N)$, an $N$-fold reduction over the standard $O(N^4\\log N)$ per-step depth.","Energy estimates require $O(N^2)$ measurement circuits rather than $O(N^3)$ for the best prior grouping schemes or $O(N^4)$ for term-by-term measurement.","Total runtime for Hamiltonian evolution plus measurement drops by a factor of $N^3$, which is the paper's headline speedup.","Measuring a whole commuting group needs fewer shots than measuring one term alone, because the group's total variance is smaller.","In the near-term regime the scheme degrades to a qubit-wise-commuting grouping with $O(N^3)$ groups and only shallow auxiliary circuits, still beating the $O(N^4)$ groups of other QWC schemes."],"supporting_citations":[{"why":"Supplies the Jordan-Wigner transformation that produces the sixteen Pauli-string types on which the grouping is built.","marker":"[19]"},{"why":"Provides the Trotter decomposition used as the baseline Hamiltonian-evolution method that the parallel scheme accelerates.","marker":"[13, 14]"},{"why":"The prior grouping-measurement results the paper compares against, which estimate O(N^3) groups.","marker":"[26, 28, 30]"},{"why":"Shows that building the commutativity graph costs O(N^8), the bottleneck the direct grouping avoids.","marker":"[31]"},{"why":"Supplies the Clifford unitary that rotates a fully-commuting family into a qubit-wise commuting family, used for both parallel evolution and simultaneous measurement.","marker":"[51]"},{"why":"Provides the molecular Hamiltonians used in the numerical tests of group counts and variances.","marker":"[39]"}],"fun_headline_variants":["Pauli grouping turns O(N^4) terms into O(N^2) commuting sets","Fermion simulation timescales shrink by N^3 via smart grouping","One grouping trick cuts fermion simulation cost by N^3","O(N^2) commuting groups reduce fermion simulation depth and measurements"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument depends on the assertion that the eight families $G_1$ through $G_8$ cover every Pauli string a molecular Hamiltonian can produce under the Jordan-Wigner transform and that every pair inside each family commutes; the paper proves the commutation in detail only for $G_8$ and states that the other families follow along the same lines, while Algorithm 2 has no explicit branch for the two-body XX and YY types.","fun_headline_variants_meta":{"raw":{"variants":["Pauli grouping turns O(N^4) terms into O(N^2) commuting sets","Fermion simulation timescales shrink by N^3 via smart grouping","One grouping trick cuts fermion simulation cost by N^3","O(N^2) commuting groups reduce fermion simulation depth and measurements"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000652,"raw_usage":{"total_tokens":3035,"prompt_tokens":1038,"completion_tokens":1997,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":654,"completion_tokens_details":{"reasoning_tokens":1915}},"tokens_in":654,"tokens_out":1997,"duration_ms":14759,"temperature":1.0,"reasoning_tokens":1915,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T22:03:48.847794+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a molecular Hamiltonian at, say, $N=50$ orbitals, generate all Pauli strings under the Jordan-Wigner transform, run the paper's grouping rule, and check every pair within each output group for commutation; a single non-commuting pair, or a term that the rule fails to assign, would refute the $O(N^2)$ claim. A second check is to compute a minimum clique cover of the commutativity graph for small molecules and compare the clique number with the number of groups produced; if the minimum exceeds $25N^2+1$, the bound is wrong.","supporting_citations":[{"cited_title":"Jordan and E","cited_arxiv_id":null,"evidence_quote":"Supplies the Jordan-Wigner transformation that produces the sixteen Pauli-string types on which the grouping is built."},{"cited_title":"Verteletskyi, T.-C","cited_arxiv_id":null,"evidence_quote":"Shows that building the commutativity graph costs O(N^8), the bottleneck the direct grouping avoids."},{"cited_title":"ChemiQ: A Chemistry Simulator for Quantum Computer","cited_arxiv_id":"2106.10162","evidence_quote":"Provides the molecular Hamiltonians used in the numerical tests of group counts and variances."}],"review_version":1}