{"id":"5d752899-7d4d-4c7e-b722-f7ab8ff96ebc","arxiv_id":"1908.02084","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A backtracking algorithm enumerates every Fock state with non-interacting energy below a threshold, yielding a smaller and more accurate basis for exact diagonalization.","lead":"This paper gives a simple algorithm that lists all many-body Fock states whose non-interacting energy is below a chosen cutoff, for any single-particle spectrum and for bosons or fermions. Computational physicists should read it because exact diagonalization in this energy-ordered basis can reach the same ground-state accuracy as a much larger standard basis.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Unproven exact enumeration and O(D_E) underpin the central claim; the printed flowcharts do not specify the backtracking tightly enough to certify completeness.","rationale":"The reader's weakest_assumption was that ordering by non-interacting energy is the right truncation for interacting problems, with the single weak-coupling example as support. That is a genuine limitation of the physical demonstration. However, the more fundamental load-bearing point is the soundness of the algorithm itself: completeness and O(D_E) are the paper's central computational claims and are asserted without proof or a fully specified, unambiguous implementation. The flowcharts and Table 1 give credible evidence that a correct backtracking combination generator is intended, and I do not claim the algorithm is actually wrong; the concern is that the paper does not supply enough specification or proof for a reader to verify the exact-enumeration property on which all applications depend. This concern is addressable by an independent implementation test or a formal proof, and if it passes, the physical-truncation caveat remains as the main reason for a conditional rather than full acceptance. Therefore I do not change the reader's CONDITIONAL verdict, but I disagree with the reader's emphasis: the algorithm's unproved completeness is at least as load-bearing as the physical energy-ordering assumption.","tokens_in":6404,"tokens_out":20072,"duration_ms":225069,"concrete_test":"Implement the bosonic and fermionic algorithms from Figs. 1 and 2 exactly as written (or from an unambiguous pseudocode supplied by the authors) and compare against brute-force enumeration for random strictly increasing energy spectra, N=3 through 8, and values of E chosen so that D_E≈10^4–10^5; verify that the output equals the brute-force set with no omissions or duplicates. Instrument the implementation to count energy evaluations and index updates and check whether total work grows no faster than a constant multiple of D_E for fixed N. If the output misses states or the work is superlinear, the central algorithmic claim fails; if it passes, the missing proof remains but the claim is supported.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing premise is that the algorithm of Section 2 really enumerates every N-particle Fock state with non-interacting energy ≤ E, exactly once, in O(D_E) time. This premise is asserted in Section 1 ('a complete set of all D_E Fock states' and 'generated sequentially one-by-one in O(D_E) time') but never proven. The only specification is the schematic flowcharts in Figs. 1 and 2, with no loop invariant, termination argument, or pseudocode in the text. Read at face value, the printed flowchart's control flow after an energy rejection is not explicit enough to rule out missing states or duplicate visits; the reset rule for bosons (set all later State(j) equal to State(Index)) is a correct lexicographic carry only when paired with a precise backtracking rule, and that rule is not stated. Table 1 is consistent with a correct combination generator, but a single finite example cannot certify completeness for all N, for fermionic constraints, or for arbitrary energy spectra. The O(D_E) claim is also not derived; with widely spaced spectra the number of rejected energy tests per accepted state needs an amortized argument. Since every reported application (Section 3) diagonalizes in the basis produced by this procedure, an incomplete or duplicated basis would invalidate the central result even if the energy-ordering principle is accepted.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript presents an algorithm for generating all N-particle Fock states whose non-interacting energy is no larger than a user-specified maximal energy E, for both bosonic and fermionic statistics, and claims that the states are produced in lexicographic order in O(D_E) time, where D_E is the number of generated states. The algorithm is described through two schematic flowcharts that implement a weighted-combination backtracking enumeration. The authors illustrate the output for N=4 bosons in two single-particle spectra and then demonstrate the method on a system of two interacting ultra-cold bosons in an anharmonic trap, comparing the convergence of the ground-state energy obtained by diagonalization in the energy-ordered basis against the standard single-particle cutoff method.","tokens_in":6592,"tokens_out":13567,"duration_ms":131799,"significance":"If the completeness and complexity claims are correct, the algorithm is a useful and simple tool for exact-diagonalization calculations, potentially reducing the Hilbert-space dimension needed for a given accuracy relative to the standard cutoff approach. The manuscript's strengths are its transparent algorithmic idea, the explicit flowcharts, and the worked examples in Tables 1 and Fig. 3. The claimed benefits are, however, not backed by proofs or by a fully consistent numerical comparison, so the significance is conditional on the repairs described below.","major_comments":[{"comment":"The paper asserts in Section 1 that the algorithm returns 'a complete set of all D_E Fock states' with energy no larger than E, but Section 2 provides only schematic flowcharts and no formal specification, loop invariant, or termination proof. The flowcharts are not sufficient to rule out missing or duplicated states, especially for the fermionic version and for arbitrary single-particle spectra. I recommend adding a rigorous pseudocode listing and an inductive proof that every N-particle Fock state satisfying the energy bound is generated exactly once, using the monotonicity of the single-particle energies and the lexicographic ordering of the first-quantization representation.","section":"Section 2, Figs. 1 and 2"},{"comment":"The claim 'Fock states are generated sequentially one-by-one in O(D_E) time' is not derived. The flowchart computes the non-interacting energy as a sum over N terms for every candidate, which costs O(N) per generated state, and the number of rejected candidates that exceed the energy bound is not analyzed. The authors should either state the complexity as O(N D_E) for fixed N or provide an amortized argument bounding the total number of energy tests in terms of D_E.","section":"Section 1 and Section 2"},{"comment":"The reported Hilbert-space dimensions for the standard cutoff method are inconsistent with the stated N=2 boson system. For N=2 bosons, the formula in Section 1 gives D_C=(C+N)!/(C!N!), so C=6, 10, and 26 yield D_C=28, 66, and 378, respectively, while the figure and text report values such as 23,751 for C=26. This error invalidates the quantitative comparison and the specific statement that D_E=6,536 outperforms D_C=23,751; the example should be recomputed with the correct cutoff dimensions.","section":"Section 3, Fig. 3"}],"minor_comments":[{"comment":"There are several typographical errors, including 'build' for 'built' in the abstract, 'dependents' for 'depends' in Section 1, and 'fitting' for 'fitting' in the abstract; these should be corrected.","section":"Abstract and Section 1"},{"comment":"The flowcharts are difficult to parse as the sole specification of the algorithm; a compact pseudocode listing in the text would greatly improve reproducibility and clarity.","section":"Section 2"},{"comment":"The proposed generalization to multicomponent systems is described only in words; a pseudocode sketch or a more detailed explanation would help readers implement it correctly.","section":"Section 2, multicomponent generalization"},{"comment":"The physical example uses a single parameter set (alpha=0.5, g=0.1) and does not report the exact ground-state energy or a convergence criterion; a brief discussion of how the results depend on the interaction strength would better support the generality of the method.","section":"Section 3"},{"comment":"The notation |n0 n1 ...> is not explicitly decoded in the caption; a one-sentence reminder that these are the occupation numbers of the single-particle orbitals would help readers.","section":"Table 1 caption"}],"recommendation":"major_revision","confidential_remarks":"The numerical inconsistency in Fig. 3 is substantial and should be addressed carefully; it may stem from accidentally using dimensions for a different particle number. The self-citation to reference [8] is from the same group and provides motivation, but the algorithm itself is independent. The missing proofs are the main barrier to acceptance; the paper's algorithmic idea is simple and likely correct, but it needs a precise specification and an amortized complexity argument."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear Colleague,\n\nThis is a conditional acceptance paper: the core idea is sound and useful, but the presentation is too thin to verify the strong claims and the demonstration contains an obvious arithmetic mistake.\n\nWhat is actually new: an algorithm that, given a set of single-particle energies, enumerates all N-particle Fock states (bosonic or fermionic) whose non-interacting energy is no larger than a declared E, in lexicographic order. For equally spaced spectra this was already handled via integer partitions in the same group's Ref. [8]; the new piece is the direct backtracking enumeration for arbitrary spectra, plus the recursive generalization to multicomponent mixtures. That is a real extension, and the lexicographic ordering is a practically important property for building Hamiltonian matrices.\n\nWhat the paper does well: the algorithm is simple, the flowcharts are readable, Table 1 gives correct test cases, and the physical intuition behind energy-ordered truncation is explained clearly. The authors do not overstate their case in the abstract; the overstatement is in Section 1, where they assert completeness and O(D_E) generation without proof.\n\nThe soft spots are proportionate but real. First, no proof of completeness or of the O(D_E) bound is given. The flowcharts are nearly but not quite a precise specification: the reset rule, e.g. 'set all later State(j) equal to State(Index)' for bosons, needs a loop-invariant argument to rule out missing or duplicated states. A single finite table cannot certify this. Second, the numerical example has a clear error: for N=2 bosons and C=26, the paper's own formula gives D_C=378, not 23,751 as printed in Fig. 3. That figure drives the claimed factor-of-four advantage. Third, the example is weak-coupling only (alpha=0.5, g=0.1); strong interactions could easily change whether energy-ordered truncation stays competitive. None of these points shows the algorithm is wrong, but they mean the paper, as written, does not deliver what it claims.\n\nI would send this to peer review with a request for major revision: provide real pseudocode, prove or properly bound the complexity, fix the Fig. 3 numbers and ideally replace or supplement that example, and add at least one strong-interaction test case. The authors' own citation pattern is fine; Ref. [8] is motivation, not a substitute for the new algorithm.\n\nFor a reading group, it's a maybe — the idea is worth knowing, but the paper needs verification before I'd rely on it. I would not cite it myself until I have reimplemented and checked the enumeration.\n\nRecommendation: not a desk reject; send out, but expect revision.\n\nBest wishes,","headline":"Useful algorithm with real potential, but the central claims are unproven and the one numerical example contains an arithmetic error that undermines the headline efficiency comparison.","tokens_in":7136,"tokens_out":5117,"would_cite":false,"duration_ms":84850,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"An O(D_E) algorithm generates exactly all N-particle Fock states with non-interacting energy below a cutoff, and this energy-ordered basis converges far faster than single-particle cutoff truncation.","keywords":["exact diagonalization","Fock basis","non-interacting energy","energy-ordered truncation","bosons","fermions","lexicographic enumeration","ultracold atoms"],"falsifier":"For two bosons in the anharmonic trap of Eq. (5) with a large contact interaction $g$, compare the ground-state energy obtained with the energy-ordered basis and with the single-particle cutoff basis at equal Hilbert-space dimension $D$; if the energy-ordered basis is not more accurate, or is less accurate, the paper's central practical claim fails. Separately, enumerate all occupation vectors with $\\sum_k n_k \\varepsilon_k \\le E$ by brute force for a small hand-computable spectrum and compare with the algorithm's output; any missing state falsifies the claimed completeness.","tokens_in":6166,"feed_emoji":"⚛️","tokens_out":11662,"duration_ms":117455,"temperature":0.7,"pith_summary":"Given any set of single-particle orbitals with known ascending energies, the paper claims a simple enumeration algorithm that generates exactly those N-particle Fock states whose non-interacting energy is no larger than a chosen cutoff E, for both bosons and fermions, in time proportional to the number of generated states. This is the basis needed for exact diagonalization of an interacting Hamiltonian, and it addresses a known defect of the usual approach: cutting off the single-particle orbital ladder includes many high-energy many-body states while omitting lower-energy states with one highly excited particle. In a two-boson anharmonic-trap example, diagonalizing in the energy-ordered basis reaches nearly the same ground-state energy with a Hilbert space several times smaller than the standard cutoff basis. If correct, the algorithm makes energy-ordered truncation a routine, one-parameter step for a wide class of many-body calculations.","feed_headline":"Lowest-energy Fock states, generated exactly and in linear time","feed_subtitle":"Ordering a many-body basis by non-interacting energy makes exact diagonalization converge far faster at the same size.","key_machinery":"The central object is the first-quantization representation of a Fock state as a sorted list of occupied single-particle indices $(i_1,\\dots,i_N)$, with $i_1 \\le \\dots \\le i_N$ for bosons and strict inequalities for fermions, together with a lexicographic backtracking rule. Starting from the lowest state, the algorithm checks whether the current state's non-interacting energy $\\sum_k E(i_k)$ lies within the cutoff $E$; when it does not, it increments the rightmost index that can be increased and resets all later indices to the smallest allowed values. This reset is what makes the enumeration complete and ordered: it guarantees no valid state is skipped and that output states are produced in lexicographic order, which is also what gives the claimed $O(D_E)$ running time and instant index lookup.","core_discovery":"For a fixed number $N$ of indistinguishable particles and a sorted single-particle spectrum $\\varepsilon_0 \\le \\varepsilon_1 \\le \\dots$, the algorithm accepts one number, the maximal energy $E$, and outputs, in lexicographic order, exactly the set of all Fock states with non-interacting energy $\\sum_k n_k \\varepsilon_k \\le E$. The novelty is the enumeration itself: a state is represented as a sorted list of occupied orbital indices, and a short backtracking loop moves from one allowed state to the next by incrementing the rightmost index that can be raised and resetting all following indices to their minimal legal values (equal for bosons, consecutive for fermions). Because the loop walks through the allowed region instead of filtering a large precomputed set, the paper claims the running time is $O(D_E)$. The authors further claim this basis gives immediate index-to-occupation mapping, and they show numerically that exact diagonalization in this basis is substantially more accurate, at equal basis size, than the standard single-particle cutoff construction.","pith_inferences":["The paper's accuracy example is weakly interacting; a natural extension is to test the same basis at strong coupling, where bound states built from many high-energy orbitals may make the non-interacting energy ordering a poor guide.","By starting the enumeration from a shifted configuration rather than the ground state, the same machinery could generate a finite energy window and give a route to excited-state exact diagonalization without building the full low-energy space.","Because the algorithm's only physical input is the set of single-particle energies, it could be applied to quantum-chemistry active-space construction or lattice-model low-energy sectors, not only to trapped ultracold atoms."],"forward_implications":["For any single-particle spectrum with known ascending energies, the energy-ordered Fock basis can be built directly, without first generating a larger cutoff Hilbert space and filtering it.","In the weak-coupling regime tested in the paper, equal-size bases converge faster than cutoff bases, because nearly degenerate low-energy many-body states are included systematically rather than accidentally.","The same enumeration pattern works for fermions and, by recursive energy budgeting, for multicomponent mixtures with different particle numbers or spectra.","Lexicographic output order gives a direct map between basis index and occupation vector, simplifying the construction of Hamiltonian matrix elements.","Only the orbital energies, the particle number, and the desired maximal energy $E$ are needed, so the method transfers to any system with a non-interacting Hamiltonian that is a sum of independent single-particle Hamiltonians."],"supporting_citations":[{"why":"It supplies the earlier observation that selecting Fock states by lowest non-interacting energy is more accurate than selecting by lowest single-particle excitations, which is the premise the new algorithm realizes constructively.","marker":"[8]"},{"why":"It describes how the equally-spaced case reduces to integer partitions, the special case that the new algorithm generalizes to arbitrary spectra.","marker":"[9]"},{"why":"It defines the standard single-particle cutoff construction and its Hilbert-space dimension formulas, the baseline against which the paper compares accuracy.","marker":"[4]"},{"why":"It documents the inaccuracy of a plain single-particle cutoff basis, motivating the need for an energy-ordered construction.","marker":"[6]"},{"why":"It gives further evidence that energy-based selection of Fock states improves convergence in exact diagonalization.","marker":"[7]"}],"fun_headline_variants":["Linear-time generation of lowest-energy Fock states","Efficient basis: lowest-energy Fock states in linear time","Generate lowest-energy Fock bases exactly and fast","Fast exact Fock basis from lowest non-interacting energies","New algorithm: Fock states with lowest non-interacting energies"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing assumption is that ordering Fock states by non-interacting energy is the right truncation for the interacting problem; for strong interactions, the relevant correlations may live in Fock states with higher non-interacting energy, so the claimed accuracy advantage could shrink or reverse.","fun_headline_variants_meta":{"raw":{"variants":["Linear-time generation of lowest-energy Fock states","Efficient basis: lowest-energy Fock states in linear time","Generate lowest-energy Fock bases exactly and fast","Fast exact Fock basis from lowest non-interacting energies","New algorithm: Fock states with lowest non-interacting energies"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000551,"raw_usage":{"total_tokens":2632,"prompt_tokens":952,"completion_tokens":1680,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":568,"completion_tokens_details":{"reasoning_tokens":1601}},"tokens_in":568,"tokens_out":1680,"duration_ms":13343,"temperature":1.0,"reasoning_tokens":1601,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:56:52.670428+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For two bosons in the anharmonic trap of Eq. (5) with a large contact interaction $g$, compare the ground-state energy obtained with the energy-ordered basis and with the single-particle cutoff basis at equal Hilbert-space dimension $D$; if the energy-ordered basis is not more accurate, or is less accurate, the paper's central practical claim fails. Separately, enumerate all occupation vectors with $\\sum_k n_k \\varepsilon_k \\le E$ by brute force for a small hand-computable spectrum and compare with the algorithm's output; any missing state falsifies the claimed completeness.","supporting_citations":[{"cited_title":"Numerically exact approach to few-body problems far from a perturbative regime","cited_arxiv_id":"1803.08387","evidence_quote":"It supplies the earlier observation that selecting Fock states by lowest non-interacting energy is more accurate than selecting by lowest single-particle excitations, which is the premise the new algorithm realizes constructively."},{"cited_title":"S ´andor, D","cited_arxiv_id":null,"evidence_quote":"It describes how the equally-spaced case reduces to integer partitions, the special case that the new algorithm generalizes to arbitrary spectra."},{"cited_title":"Haugset, H","cited_arxiv_id":null,"evidence_quote":"It documents the inaccuracy of a plain single-particle cutoff basis, motivating the need for an energy-ordered construction."},{"cited_title":"Deuretzbacher, K","cited_arxiv_id":null,"evidence_quote":"It gives further evidence that energy-based selection of Fock states improves convergence in exact diagonalization."}],"review_version":1}