{"id":"d076a977-0f43-43f4-b06d-f78d6f02fa57","arxiv_id":"2505.01271","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"high","formal_verification":"none","parameter_count":2,"one_line_summary":"The authors present an ancilla-free quantum lattice Boltzmann method with a unitary linear collision model and classical shot-based macroscopic variable extraction, but the multi-loop version suffers from exponentially decaying post-selection success.","lead":"This paper proposes an ancilla-free quantum lattice Boltzmann algorithm for advection-diffusion equations, replacing non-unitary collisions with local unitary gates and extracting macroscopic variables from measurement counts instead of quantum state tomography. It demonstrates the method on D1Q3 and D2Q5 lattices in qiskit, but the repeated post-selection needed for multi-step loops makes the claimed long-time advantage doubtful.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Multi-loop continuation depends on post-selecting the q register to |00⟩; with per-step probability ≤3/4 and no amplification, the probability of T loops is ≤(3/4)^T, so the claimed ability to run any number of loops without tomography is not established.","rationale":"The paper's single-loop building block is plausible: encoding into a normalized state, linear collision via controlled-Ry gates (App. B), streaming, Hadamard summation, and extracting φ through shot counts are coherent for a single time step, and the qiskit simulations support that. The load-bearing flaw is the loop-continuation mechanism. The text says 'the algorithm can achieve any number of loops conditionally controlled by the measurement results in register q' and 'the good news is that |φ0(x,1)⟩ can serve as the initial state if the loop does not terminate.' This is post-selection: only the |00⟩ branch of Eq. (15) is retained. Appendix C analyzes the single-shot probability and bounds it by [1/4, 3/4]; it never multiplies over loops. Since there is no amplitude amplification or feedback that repairs the other measurement branches, a run that ever sees a non-|00⟩ outcome is lost. Thus P(T loops) ≤ (3/4)^T and expected restarts ≥ (4/3)^T; this is exponential in the number of time steps. That undermines the advertised 'any number of loops' and the complexity comparison, which counts Toffoli gates per loop but not the required repetitions. I am not objecting to disagreement with consensus; the issue is internal to the paper's own success-probability analysis. The Appendix A reconstruction issue (an apparent amplitude greater than 1) is secondary and does not change this verdict. The verdict stays REJECT, unchanged relative to the reader's assessment.","tokens_in":11189,"tokens_out":5760,"duration_ms":57916,"concrete_test":"Run the exact continuation protocol of Sec. III.A for T = 1 through 8 loops (D1Q3 with the paper's parameters): each loop applies collision, streaming, H on q, then measures q and aborts unless the outcome is |00⟩; record the fraction of completed runs over N trials. Also compute the product of the observed per-loop acceptance rates. If completed fractions track the product and decay roughly as (≤3/4)^T, the 'any number of loops' claim fails. An analytic companion check: derive the expected number of circuit executions needed to reach T loops given no amplitude amplification and compare it with the claimed O(log M) per-loop complexity; if it scales as (4/3)^T, the complexity claim is incomplete.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that the algorithm can execute any number of loops without per-loop tomography, relying on the statement in Sec. III.A that continuation is 'conditionally controlled by the measurement results in register q.' The only mechanism supplied for continuation is post-selecting the q-measurement outcome |00⟩ (Eq. (15) and the following text, used again in Algorithm 1). Appendix C bounds this single-step event by p ∈ [1/4, 3/4] (Eq. C5), and the paper's own simulation reports p ≈ 0.72. The paper never analyzes the product over T loops and provides no amplitude amplification, rewinding, or partial-measurement gadget that recovers the failed branch. Because a non-|00⟩ outcome destroys the state component needed for the next time step, the probability of completing T loops is at most (3/4)^T, so the expected number of fresh circuit runs is at least (4/3)^T. For the 'millions of time steps' mentioned in the introduction this is astronomically infeasible; even for T = 100, (3/4)^100 ≈ 3 × 10^{-13}. This is not an internal inconsistency in the single-loop construction; the single-loop circuit and qiskit simulations appear to work. But it invalidates the multi-loop/no-tomography claim as stated. The per-loop Toffoli count 4 log²M + 8 log M omits this restart cost, so the advertised O(log M) improvement over Refs. [16,19] is not achieved without an additional amplification scheme.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes an ancilla-free quantum lattice Boltzmann method (AFQLBM) for advection-diffusion equations. The scheme encodes the macroscopic field directly in a position register, applies a linear BGK collision with relaxation parameter ω = 1 via local controlled rotations on a direction register, performs direction-controlled streaming, and applies Hadamard gates to the direction register so that the all-zero outcome carries the sum of the streamed distributions. The authors claim that this permits an arbitrary number of time loops without quantum state tomography between steps, with a per-loop Toffoli count of 4 log² M + 8 log M for D2Q5. The paper includes qiskit simulations of Gaussian-hill advection-diffusion for D1Q3 and D2Q5 models and an analysis in Appendix C bounding the per-loop success probability of the all-zero direction outcome to the interval [1/4, 3/4].","tokens_in":11462,"tokens_out":6204,"duration_ms":59855,"significance":"If the multi-loop claim held, this would be a notable simplification of existing quantum lattice Boltzmann methods: no ancilla qubit, a purely local unitary collision operator, no per-loop quantum state tomography, and an O(log M) reduction in Toffoli count per loop compared with Refs. [16, 19]. The single-loop collision and streaming construction is coherent, the probability bound in Appendix C is a correct inequality for the stated normalization, and the qiskit comparisons provide a useful proof-of-principle for the single-loop evolution. However, the multi-loop capability is the headline contribution, and it is not established; the advertised complexity advantage over prior QLBM work is therefore not realized for more than one time step without an additional mechanism that the paper does not provide.","major_comments":[{"comment":"The claim that the algorithm 'can achieve any number of loops conditionally controlled by the measurement results in register q' is not supported. The only continuation mechanism described is measuring the direction register and keeping runs in which the outcome is the all-zero string; Eq. (15) and the following paragraph state that the collapsed state |φ0(x,1)> is obtained 'on the premise that the results are |00>'. Any other outcome is discarded. Appendix C bounds the probability of this per-loop event by p ∈ [1/4, 3/4] and reports p ≈ 0.72 in the simulations. The paper never analyzes the product over T loops and provides no amplitude amplification, rewinding, or partial-measurement gadget that would recover the failed branch. Since a non-zero measurement outcome destroys the component needed for the next time step, the probability of completing T loops is at most (3/4)^T and the expected number of fresh circuit runs is at least (4/3)^T; for T = 100 this is about 3 × 10^{-13}. The abstract and Section III.A statements about running an arbitrary number of loops without tomography are therefore not justified as stated.","section":"Section III.A, Eq. (15), and Appendix C, Eq. (C5)"},{"comment":"The stated complexity of 4 log² M + 8 log M Toffoli gates per loop and the claimed O(log M) improvement over Refs. [16, 19] count only the per-loop circuit and omit the number of repetitions required by post-selection. Unless a mechanism is supplied to avoid discarding non-all-zero outcomes, the expected cost to reach T time steps is at least (4/3)^T times the per-loop cost, which is exponential in T for the multi-loop algorithm. The complexity comparison is therefore incomplete, and the central advantage over the prior multi-loop algorithms is not achieved.","section":"Section V, Toffoli complexity analysis"},{"comment":"The numerical validation does not report the cumulative success probability or the number of discarded runs for the multi-loop cases, even though the simulations are presented as evidence of feasibility for the time-marching algorithm. With the reported per-loop success probability of about 72%, five consecutive loops would be expected to succeed in only about 19% of fresh runs, and the displayed agreement between the 'quantum' and classical curves may be the result of conditioning on the successful all-zero measurement paths. Reporting success counts, a bound on the post-selected estimator error, or a comparison at a fixed total shot budget would be needed to substantiate the feasibility claim.","section":"Section IV, numerical simulations"}],"minor_comments":[{"comment":"There are several typographical errors, including 'The cillision operator' and 'the first qubut', which should be corrected to 'collision' and 'qubit', respectively.","section":"Appendix A and general text"},{"comment":"The relationship between the measured counts S_i and the weights √S_i/(√S · S_all) is not explained; a sentence stating that the post-processing estimates |a_i|/Σ|a_i| from the square roots of empirical frequencies would clarify the method.","section":"Algorithm 1"},{"comment":"The control conventions for the streaming operators are described informally ('|10⟩ controlls direction 1'); spelling should be fixed and the mapping from each direction-register basis state to the corresponding streaming operator should be stated explicitly.","section":"Appendix B"},{"comment":"The reference for state preparation, Ref. [26], concerns efficiently integrable probability distributions; arbitrary initial fields require a more general amplitude-encoding routine whose cost should be included in the resource estimate.","section":"Equation (10) and state preparation"},{"comment":"The figures compare quantum and classical LBM results, but the text does not state the exact number of shots used beyond a multiple of the lattice size; reporting shot counts and statistical error bars would make the comparison more quantitative.","section":"Figures 3 and 4"}],"recommendation":"reject","confidential_remarks":"The multi-loop issue is the main blocker: the paper's headline capability is not supported by the mechanism it provides. The single-loop construction and simulations are meaningful, but the advertised no-tomography multi-loop advance requires either a genuine amplification scheme or a substantial rescoping of the claims. A resubmission that honestly limits the claim to a single time step or supplies a working continuation mechanism could be reconsidered."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nShort version: the single-step AFQLBM construction is real, but the paper's headline claim — that the algorithm can run any number of loops without tomography — doesn't hold. Each loop continues by post-selecting the q register into the all-zero outcome. Appendix C correctly bounds that event's probability to [1/4, 3/4], and the paper's own simulation gives about 0.72. The paper never multiplies these probabilities across T loops and offers no amplitude amplification or rewinding, so the probability of completing T loops is at most (3/4)^T. That makes the expected number of runs exponential in the time horizon, which undercuts the 'millions of time steps' scenario in the introduction and the claimed O(log M) improvement over earlier QLBM work.\n\nWhat's genuinely good: the local unitary collision construction for linear equilibrium is a clean extension of Budinski and Wawrzyniak; the rotation angles in Appendix B are explicit; the single-loop derivation (collision, streaming, Hadamard) is coherent; and the qiskit simulations verify the one-loop dynamics against classical LBM. Appendix A also does some useful surgery on Budinski, showing a real leftover imaginary amplitude in the post-selected state. These are honest, reproducible pieces.\n\nThe soft spots beyond the central one: the complexity comparison counts Toffolis per loop but ignores the measurement overhead of Algorithm 1, which reconstructs M amplitudes from shots and will cost O(M/ε^2) to reach accuracy ε. The paper also doesn't compare with the unitary QLBM [21] or two-circuit approach [22], so the claimed improvement is against a subset of baselines. Algorithm 1 is underspecified — it doesn't state how the shot counts are converted into the weights, nor the sampling error propagation.\n\nIs the central argument salvageable? The multi-loop claim needs a genuine continuation mechanism — e.g., amplitude amplification or a measurement strategy that doesn't discard the desired branch. Without that, the paper is a single-loop QLBM variant with an unresolved scaling problem.\n\nMy recommendation: reject in current form, but send it to a qualified referee for a full review. The single-loop construction and the identification of Budinski's issue are worth assessing carefully, and the multi-loop problem is a technical flaw, not a fatal confusion. If the authors add a proper success-probability analysis or an amplification scheme, a revised version could be acceptable as a specialized contribution to the QLBM literature.","headline":"Sound single-loop QLBM construction, but the 'any number of loops' claim fails because each loop post-selects with probability ≤3/4 and no amplification is provided.","tokens_in":12036,"tokens_out":5555,"would_cite":false,"duration_ms":50325,"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 ancilla-free quantum lattice Boltzmann method replaces non-unitary collisions with local unitary rotations and removes per-loop tomography, claiming arbitrary numbers of time loops for advection-diffusion.","keywords":["quantum lattice Boltzmann method","advection-diffusion equation","linear collision model","ancilla-free quantum circuit","local unitary operations","quantum state tomography","D2Q5 lattice"],"falsifier":"Run the D2Q5 circuit for a Gaussian hill over T = 10 and T = 20 loops on a simulator, recording whether the direction register returns all zeros at every intermediate step. If the cumulative success rate tracks $(3/4)^T$, roughly 6% at T = 10, then the 'any number of loops' claim fails without amplification; the final macroscopic profile should also be compared against classical lattice Boltzmann values to test the tomography-free readout.","tokens_in":10943,"feed_emoji":"⚛️","tokens_out":9860,"duration_ms":84974,"temperature":0.7,"pith_summary":"This paper proposes an ancilla-free quantum lattice Boltzmann method (AFQLBM) for the advection-diffusion equation. The key move is to replace the non-unitary BGK collision with a short product of local controlled rotations on a small direction register, and to replace per-loop quantum state tomography with a classical post-processing routine that recovers macroscopic variables from measurement statistics and the known sum of the initial values. The authors claim the algorithm can be looped for an arbitrary number of time steps, advancing whenever the direction register collapses to all zeros, without ancilla qubits and without intermediate tomography. If that claim holds, AFQLBM lowers the per-loop circuit cost: for the two-dimensional five-velocity model (D2Q5) on an $M\\times M$ grid the Toffoli count is $4\\log^2 M + 8\\log M$, an $O(\\log M)$ reduction over earlier QLBM constructions. Numerical tests on one- and two-dimensional Gaussian hills agree with the classical lattice Boltzmann results.","feed_headline":"Quantum lattice Boltzmann drops ancilla and tomography per step","feed_subtitle":"Local rotations replace nonunitary collisions, cutting the per-step circuit cost by O(log M).","key_machinery":"The load-bearing object is the linear collision model: because the equilibrium distribution $f_\\alpha^{\\rm eq}$ is linear in $\\phi$, the collision step reduces to local unitary operations on the direction register alone. For D2Q5 the direction register holds three qubits; controlled-$R_y$ rotations with angles fixed by the weights $\\hat w_\\alpha$ build the normalized state $\\sum_\\alpha \\hat w_\\alpha|\\alpha\\rangle\\otimes|\\phi_0\\rangle$, after which cyclic shift operators $R$ and $L$ perform streaming under direction control. A layer of Hadamard gates implements pointwise addition of the shifted copies, and a classical routine converts shot counts into macroscopic variables using the initial sum $|\\phi|_1$. The stated complexity benchmark is a per-loop Toffoli count of $4\\log^2 M+8\\log M$, where Toffoli gates, standard three-input reversible gates, serve as the cost unit.","core_discovery":"The central discovery is that a linear equilibrium distribution function lets the entire collision step be implemented as local unitary rotations, $R_y$ and controlled-$R_y$ gates, that set the direction register to a superposition whose amplitudes are the weights $\\hat w_\\alpha = w_\\alpha(1+e_\\alpha\\cdot \\vec u/c_s^2)$. Streaming then shifts the position register conditioned on those direction states, producing a normalized combination $\\sum_\\alpha f_\\alpha(x,1)$; applying Hadamard gates on the direction register concentrates the sum $\\sum_\\alpha f_\\alpha(x,1)$ into the all-zero outcome. The paper argues that measuring this outcome gives the next loop's initial state, and that the macroscopic variable at any chosen step can be recovered from the initial sum plus the current measurement statistics, so no quantum state tomography is needed at intermediate loops. The authors support this with a per-loop probability bound between $1/4$ and $3/4$ and a claimed resource cost of $4\\log^2 M+8\\log M$ Toffoli gates per D2Q5 loop, versus $4\\log^2 M+16\\log M$ for earlier methods.","pith_inferences":["The paper leaves implicit that its per-loop success bound $[1/4,3/4]$ applies to a single step; without amplitude amplification or a rewinding mechanism, the chance of completing $T$ loops is at most $(3/4)^T$, so 'arbitrary number of loops' would require an additional recovery strategy.","Algorithm 1's reconstruction from shot counts should accumulate finite-sampling error over loops; a direct simulator study of error versus loop count would quantify whether the claimed any-time readout remains accurate.","A natural extension is to feed the all-zero outcome through amplitude amplification, which could make the probabilistic loop advance near-deterministic while preserving the ancilla-free structure."],"forward_implications":["A QLBM solver can in principle run many advection-diffusion steps with only two registers, no ancilla qubit, and no state tomography between steps, reducing both qubit count and circuit depth.","The per-loop Toffoli count falls by $O(\\log M)$ relative to prior ancilla-based constructions, a saving that grows with the lattice size.","Macroscopic variables at a given time step can be produced from current measurement statistics plus the initial sum, so intermediate classical readout is not part of the loop.","The D1Q3 and D2Q5 demonstrations indicate the construction is extendable to larger velocity sets and, as the authors state, toward incompressible Navier-Stokes and multiphase flow models."],"supporting_citations":[{"why":"Defines the original ancilla-based quantum lattice Boltzmann algorithm whose post-selected readout is corrected in Appendix A and whose cost is the baseline.","marker":"[16]"},{"why":"Supplies the alternative QLBM formulation whose per-loop Toffoli count $4\\log^2 M+16\\log M$ is compared against.","marker":"[19]"},{"why":"Provides the amplitude-encoding procedure used to prepare the initial macroscopic field in the position register.","marker":"[26]"},{"why":"Introduces the cyclic streaming operators R and L that the streaming step applies under direction control.","marker":"[27]"},{"why":"Supports the claim that full quantum state tomography is exponentially expensive, motivating the tomography-free readout.","marker":"[28]"}],"fun_headline_variants":["Ancilla-free QLBM reduces circuit cost per loop","Quantum LBM without ancilla or per-step tomography","Linear collision model enables ancilla-free QLBM","No ancilla, no tomography: QLBM with local unitaries","Local unitary collisions cut QLBM circuit depth per loop"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The scheme's repeated-loop claim rests on the all-zero measurement of the direction register happening at every step, and only a single-step probability bound of at most 3/4 is given; the product over many steps is not analyzed.","fun_headline_variants_meta":{"raw":{"variants":["Ancilla-free QLBM reduces circuit cost per loop","Quantum LBM without ancilla or per-step tomography","Linear collision model enables ancilla-free QLBM","No ancilla, no tomography: QLBM with local unitaries","Local unitary collisions cut QLBM circuit depth per loop"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000537,"raw_usage":{"total_tokens":2563,"prompt_tokens":912,"completion_tokens":1651,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":528,"completion_tokens_details":{"reasoning_tokens":1568}},"tokens_in":528,"tokens_out":1651,"duration_ms":10339,"temperature":1.0,"reasoning_tokens":1568,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T12:09:53.814255+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the D2Q5 circuit for a Gaussian hill over T = 10 and T = 20 loops on a simulator, recording whether the direction register returns all zeros at every intermediate step. If the cumulative success rate tracks $(3/4)^T$, roughly 6% at T = 10, then the 'any number of loops' claim fails without amplification; the final macroscopic profile should also be compared against classical lattice Boltzmann values to test the tomography-free readout.","supporting_citations":[{"cited_title":"Boixo, S","cited_arxiv_id":null,"evidence_quote":"Defines the original ancilla-based quantum lattice Boltzmann algorithm whose post-selected readout is corrected in Appendix A and whose cost is the baseline."},{"cited_title":"Wawrzyniak, J","cited_arxiv_id":null,"evidence_quote":"Supplies the alternative QLBM formulation whose per-loop Toffoli count $4\\log^2 M+16\\log M$ is compared against."},{"cited_title":"Chen, and D","cited_arxiv_id":null,"evidence_quote":"Provides the amplitude-encoding procedure used to prepare the initial macroscopic field in the position register."},{"cited_title":"Todorova and R","cited_arxiv_id":null,"evidence_quote":"Introduces the cyclic streaming operators R and L that the streaming step applies under direction control."},{"cited_title":"Budinski, Quantum algorithm for the advection-diff usion equation simulated with the lattice Boltzmann method","cited_arxiv_id":null,"evidence_quote":"Supports the claim that full quantum state tomography is exponentially expensive, motivating the tomography-free readout."}],"review_version":1}