{"id":"b9d4e7d9-674a-48f7-b547-cbd3db0ad1a0","arxiv_id":"2608.06711","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For AC power flow, any quantum solver built from state preparation, a quantum linear solve, and full readout has runtime Ω(Nκ/ε), slower than classical NRLF's O(Nκ log(κ/ε)) at normal accuracies.","lead":"This paper compares how fast classical and quantum computers could solve the AC power flow problem, the core calculation for running electrical grids. It finds that a quantum solver would need to tolerate very coarse accuracy to beat the classical Newton-Raphson method, so practical quantum advantage looks unlikely for standard AC power flow.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The claimed universal Ω(Nκ/ε) lower bound for any gate-based Q-ACPF solver relies on an unproven necessity of full dense tomography; algorithms that output only specified observables could evade the N/ε readout cost.","rationale":"The reader's weakest assumption identifies exactly the same load-bearing concern: the lower bound assumes full dense tomography with cost Θ(N/ε). My analysis confirms that this is an unproven necessity rather than a consequence of the problem structure. The paper's own wording—'the solution vector is dense containing voltage magnitudes and angles'—motivates but does not prove that every useful quantum ACPF algorithm must reconstruct that dense vector classically. Since power-flow practice frequently requires only aggregated quantities or constraint checks, a quantum algorithm returning such observables could bypass the N/ε readout penalty. If such an algorithm exists with complexity O((κ+log N)/ε), the abstract's 'any Gate-based QC algorithm' claim is invalid, although the paper's conclusion for full-solution-output solvers remains plausible. This supports the reader's CONDITIONAL verdict: the central claim needs to be scoped to the specific full-tomography pipeline, and the empirical parts need specification, but the core negative result for that pipeline is coherent and the error-comparison appendix is internally consistent. I see no reason to change the verdict, only to tighten the claim.","tokens_in":6268,"tokens_out":7217,"duration_ms":129225,"concrete_test":"Construct a concrete quantum ACPF routine that outputs only a single power-flow quantity (e.g., total active power loss) as follows: use the quantum linear-solver output state from Eq. (4), encode the loss functional as a Pauli/observable measurement, and apply quantum amplitude estimation to estimate the expectation value to relative error ε. Derive the query complexity: each amplitude-estimation step requires O(1/ε) invocations, each invocation costs T_p+T_s = O(log N + κ), so the total is O((κ+log N)/ε), independent of N. If this derivation is sound and the algorithm is valid for a standard ACPF instance, the claimed universal Ω(Nκ/ε) lower bound is false as stated, and the paper must restrict its claim to algorithms that output the full dense solution vector.","verdict_should_be":"UNCHANGED","load_bearing_attack":"In Section III, the paper derives what it calls a lower bound for 'any Quantum-ACPF solver' by decomposing the algorithm into state preparation, state propagation, and readout. The readout term T_r is set to Θ(N/ε) with the justification that 'the solution vector is dense' and that tomography via state-preparation unitaries [18] costs Θ(N/ε). This is an assumption about one particular output model, not a proven lower bound. Nothing in the paper rules out a quantum ACPF algorithm that outputs only a low-dimensional set of quantities an operator actually needs—e.g., total active power loss, line-flow violations, or the value of an objective function—rather than the full voltage vector. For such an output, amplitude estimation can estimate a single expectation value to precision ε with O(1/ε) uses of the state-preparation and solve unitaries, giving an end-to-end cost of roughly O((κ+log N)/ε) rather than Ω(Nκ/ε). Consequently, the abstract's statement that the baseline runtime is Ω(Nκ/ε) for 'any Gate-based QC algorithm' is not established. The derived expression is a cost estimate for the specific pipeline in Fig. 2, not a universal lower bound. This is the most load-bearing weakness because the paper's central claim of no practical quantum advantage rests entirely on the universality of this bound.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper analyzes the runtime complexity of quantum algorithms for AC power flow (ACPF). It first establishes an NRLF benchmark complexity of O(N κ log(κ/ε)), with N buses, condition number κ, and error tolerance ε. It then attempts to derive an 'optimistic lower bound' of Ω(Nκ/ε) for any gate-based quantum ACPF solver, determined by state preparation, a quantum linear solve, and dense tomography readout. The resulting Q/C complexity ratio is approximately 1/(ε log(κ/ε)), leading the authors to conclude that no practical quantum advantage exists except at very coarse accuracies or with large classical overheads.","tokens_in":6519,"tokens_out":9291,"duration_ms":92343,"significance":"If the lower bound were valid, the paper would provide an important negative result for quantum power flow research. The paper is valuable in systematically assembling the NRLF complexity benchmark, explicitly converting between energy-norm and ℓ2-norm errors, and supplying empirical condition-number data from PGLib. It also clearly identifies the 1/ε readout bottleneck as the key obstacle. However, the central 'any gate-based QC algorithm' claim is not supported by the derivation, which analyzes one specific pipeline rather than proving a universal lower bound. The contribution is best read as a careful cost estimate for a canonical quantum ACPF pipeline; in its current form, the abstract overstates the scope of the conclusion.","major_comments":[{"comment":"The abstract's claim of Ω(Nκ/ε) for 'any Gate-based QC algorithm' is not established. The derivation assigns T_r = Θ(N/ε) by requiring full dense tomography of the 2N-dimensional solution vector via the algorithm of [18]. No argument rules out a quantum ACPF algorithm that outputs only operator-relevant quantities—total active power loss, line-flow violations, an objective value—using amplitude estimation, whose readout cost would be O(1/ε) independent of N. Such an algorithm would have end-to-end cost roughly O((κ+log N)/ε), removing the N from the advantage ratio. The 'any' quantification therefore applies to the specific pipeline in Fig. 2, not to all possible quantum solvers.","section":"Section III (readout complexity) and Fig. 2"},{"comment":"The terms 'lower bound' and 'tight bound' are used in a way that is not justified. Reference [18] provides a tomography algorithm with cost Θ(N/ε); this is an upper bound on one readout strategy, and no matching lower bound is proved. Similarly, the Ω(κ) query lower bound for quantum linear solvers is for a black-box matrix access model and does not imply that every ACPF algorithm must incur this cost for the specific Jacobian structure. The assembled expression is a cost estimate for one architecture, not a fundamental complexity bound.","section":"Section III (state propagation and readout)"},{"comment":"The comparison assumes H=1 for the quantum ACPF solver while treating the NRLF iteration count H as a constant. Since ACPF is a nonlinear problem, a single linear solve does not generally produce the solution; the assumption is explicitly optimistic, but it is an assumption rather than a lower bound. The paper does not discuss how the complexity ratio would change if the quantum algorithm also requires multiple outer iterations with possibly growing condition numbers. This affects the central conclusion about the absence of practical advantage.","section":"Fig. 2 and 'Quantum Advantage Regime'"}],"minor_comments":[{"comment":"The derivation of O(N κ log(κ/ε)) from (2) relies on the energy-norm to ℓ2-norm error conversion. This step is only sketched in the text; elaborating the chain ε_c ≥ ε/κ would improve clarity.","section":"Section II, equation (3)"},{"comment":"The numbered equality chain (5)–(8) is misaligned: the items with equality signs appear as separate equations rather than as a connected derivation. Please rewrite as a single aligned chain or with explicit inequality labels.","section":"Appendix A"},{"comment":"The claim that the iteration count H is independent of system size is supported only by the left panel for converging instances. The right panel shows non-converging instances, which are not used for the benchmark; the text should state this distinction explicitly.","section":"Section II and Fig. 1"},{"comment":"The footnote contains the placeholder 'Link' for big-O notation references; this should be replaced with a proper citation or removed.","section":"Footnote 1"},{"comment":"The Q/C ratio is computed as 1/(ε log(κ/ε)) after canceling the common factor N. The paper should state explicitly that this assumes identical constant factors for both algorithms, because the qualitative conclusion depends on that assumption.","section":"Quantum Advantage Regime"}],"recommendation":"major_revision","confidential_remarks":"The paper's title and abstract promise a general no-advantage theorem, but the body delivers a cost analysis of one specific pipeline. The main revision required is to either prove a genuine lower bound for all quantum ACPF algorithms or substantially narrow the claims to the analyzed pipeline. I also note that the paper leans heavily on the authors' own prior work [10] for the pipeline structure and empirical condition-number data; this is acceptable but the incremental novelty beyond [10] should be made explicit. With a scope correction, the paper could be a useful cautionary contribution to the quantum power flow literature."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a solid negative result for a narrow subfield, not a breakthrough. The authors extend their earlier linear power-flow complexity analysis [10] to the nonlinear ACPF setting, give a careful NRLF benchmark O(Nκ log(κ/ε)) with the energy-norm-to-ℓ2 conversion spelled out in the appendix, and build an optimistic quantum pipeline — QRAM state preparation, κ-scaled linear solve, one Newton iteration, full tomography — that costs Ω(Nκ/ε). The 1/ε versus log(κ/ε) comparison and the Q/C ratio at ε=10^-6, κ=10^8 (roughly 3×10^4) make the practical takeaway clear: for full-state ACPF, quantum advantage is unlikely except at very loose accuracy. Credit where due: the assumptions on the quantum side are generous, the direction of the conclusion is robust, and the paper itemizes the narrow escape hatches (coarse accuracy, high classical overheads). The frontier list in Section IV is speculative but reasonable and clearly labeled.\n\nThe soft spots are real but mostly fixable. The main one is the universality claim. Section III derives a lower bound for a specific pipeline: state preparation, a quantum linear solve, and full dense tomography of the N-dimensional solution vector, with readout cost Θ(N/ε). Nothing in the paper proves that every gate-based Q-ACPF algorithm must reconstruct the full classical vector. An algorithm that outputs only specified observables — total losses, line flow violations, an objective value — could use amplitude estimation at O(1/ε) per observable and bypass the N/ε term. So the abstract's 'any Gate-based QC algorithm' is not established. The authors should either restrict the claim to end-to-end solvers with full classical readout, or add an information-theoretic argument that ACPF as a task requires the full vector. For the standard ACPF problem, which is defined as solving for the state vector, the full-readout assumption is defensible, but it is an assumption and should be labeled as such.\n\nMinor issues: Figure 1 lacks reproducibility details (no code, no PGLib version, no setup description); the text has a placeholder 'Link' in a footnote and cross-references to their own Fig. 2 in [10]; and the quantum side sets H=1 while the classical side counts H as a constant, which is favorable to quantum but should be made more explicit in the main text rather than buried in Fig. 2.\n\nWho is this for: people working on quantum power flow or end-to-end complexity analyses of HHL-type solvers. It is a legitimate extension, and the central negative result for the stated pipeline holds. I would send this to peer review and ask for the 'any' claim to be tightened, the empirical setup to be reported, and the placeholders cleaned before acceptance.","headline":"Useful negative result for quantum ACPF under an explicit full-tomography pipeline, but the abstract's 'any gate-based algorithm' claim overreaches; worth refereeing after tightening.","tokens_in":7052,"tokens_out":6209,"would_cite":false,"duration_ms":63826,"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":"This paper establishes that any gate-based quantum AC power flow solver with full classical readout is slower than Newton-Raphson at every practical accuracy, because its runtime depends on one over the error tolerance instead of the…","keywords":["AC power flow","quantum advantage","quantum linear systems","Newton-Raphson load flow","runtime complexity","tomography readout","error tolerance","quantum power flow"],"falsifier":"Run an end-to-end quantum ACPF implementation on a fixed test case at two error targets, say $\\varepsilon = 10^{-3}$ and $\\varepsilon = 10^{-6}$; the claimed readout term predicts about a $10^3$-fold runtime increase, whereas a logarithmic dependence predicts only about a factor of two. A measured increase close to two, or any solver achieving total runtime $O(N\\kappa \\log(\\kappa/\\varepsilon))$ at $\\varepsilon = 10^{-6}$, would falsify the paper's lower bound.","tokens_in":6017,"feed_emoji":"⚡","tokens_out":13262,"duration_ms":117118,"temperature":0.7,"pith_summary":"This paper asks whether a quantum computer can solve alternating current power flow (ACPF) faster than the classical Newton-Raphson load flow (NRLF). It argues that the standard end-to-end recipe—prepare the load vector as a quantum state, run a quantum linear-system solver, then read out the dense voltage-and-angle solution classically—cannot beat NRLF at any practically useful accuracy. The decisive term is readout: recovering the $N$-bus solution to error $\\varepsilon$ costs $\\Theta(N/\\varepsilon)$, and because a measurement destroys the quantum state, this cost is paid after every solve, giving a total lower bound $\\Omega(N\\kappa/\\varepsilon)$. NRLF, by contrast, costs $O(N\\kappa \\log(\\kappa/\\varepsilon))$. Since $1/\\varepsilon$ outruns $\\log(\\kappa/\\varepsilon)$, the quantum–classical ratio only falls below one near $\\varepsilon \\approx 0.05$, so the paper concludes that quantum advantage for ACPF, if any, must come from tasks other than direct dense solution, or from regimes where classical overheads are much larger.","feed_headline":"Quantum AC power flow hits a readout wall","feed_subtitle":"Runtime scales with one over the error, while Newton-Raphson scales with its logarithm, so classical wins at practical accuracy.","key_machinery":"The machinery is the three-stage end-to-end decomposition of a quantum ACPF solver plus the error-norm comparison that puts both solvers on the same footing. State preparation $T_p$ encodes the injection vector by amplitude embedding ($\\Theta(N)$ generally, $\\Theta(\\log N)$ with QRAM); state propagation $T_s$ is the quantum linear-solve step, bounded below by $\\Omega(\\kappa)$ from HHL-style query complexity; readout $T_r$ is quantum tomography with state-preparation unitaries, costing $\\Theta(N/\\varepsilon)$ to recover a dense classical voltage vector in $\\ell^2$ norm. Because a single measurement yields one sample and collapses the state, the full preparation-and-solve loop runs $T_r$ times, and the product $T_r(T_p+T_s)$ produces the $\\Omega(N\\kappa/\\varepsilon)$ lower bound. On the classical side, the key mechanism is CG on the normal equations $A^T A x = A^T b$, which squares the condition number, and the conversion from energy-norm error $\\varepsilon_c$ to $\\ell^2$ error $\\varepsilon$ yields $O(N\\kappa \\log(\\kappa/\\varepsilon))$.","core_discovery":"On the paper's own terms, the central discovery is a baseline lower bound for any gate-based, end-to-end quantum ACPF algorithm. Splitting the run into state preparation $T_p = \\Theta(\\log N)$ (with QRAM), state propagation $T_s = \\Omega(\\kappa)$ (optimistically $\\Theta(\\kappa)$), and tomography readout $T_r = \\Theta(N/\\varepsilon)$, and noting that measurement destroys the state so all three stages must be repeated $T_r$ times, the end-to-end runtime is $\\Theta(T_r(T_p+T_s)) = \\Omega(N\\kappa/\\varepsilon)$. The comparison case is NRLF solved with conjugate gradients on the normal equations, whose per-iteration cost is $O(N\\kappa \\log(\\kappa/\\varepsilon))$. The ratio $Q/C \\approx (1/\\varepsilon)/\\log(\\kappa/\\varepsilon)$ therefore does not depend on $N$; at $\\kappa = 10^8$ it is about $3.1 \\times 10^4$ when $\\varepsilon = 10^{-6}$ and falls below one only near $\\varepsilon \\approx 0.05$. The authors conclude that potential quantum benefit should be sought in tasks other than direct dense ACPF solution—enumerating multiple solutions, bifurcation detection, or convergence robustness—and only if those variants beat classical counterparts such as Holomorphic-NRLF.","pith_inferences":["This is an inference: the same readout barrier applies to any quantum algorithm whose final deliverable is a dense classical vector, not just power flow; quantum solvers for other nonlinear systems would face the same one-over-error wall.","This is an inference: a quantum ACPF routine that reports only operator-relevant scalars—line flows, total losses, constraint violations—via amplitude estimation could escape the bound; the paper's lower bound explicitly assumes full tomography of the solution vector.","This is an inference: because the quantum/classical ratio is independent of system size, the only paths to advantage are algorithmic (changing what is read out or which nonlinear task is solved), not architectural (waiting for bigger grids).","This is an inference: replacing the full-tomography assumption with a few-output query model and recomputing the end-to-end complexity is a direct test of how much of the conclusion depends on readout; one would predict a bound that scales with the number of reported quantities rather than with $N$."],"forward_implications":["At error tolerance $10^{-6}$ and condition number $10^8$, the quantum baseline is about $3.1 \\times 10^4$ times the classical cost; at $10^{-3}$ the ratio is about 39.","The quantum–classical ratio is independent of system size $N$, so simply moving to larger power grids does not create a quantum advantage under this model.","The quantum solver's advantage window opens only near $\\varepsilon \\approx 0.05$ for $\\kappa = 10^8$, an error too large for operational power-flow studies.","The logarithmic error dependence of HHL inside the linear solve is erased by the $1/\\varepsilon$ tomography cost, so a quantum ACPF speedup cannot rest on the linear-solve speedup alone.","The paper's remaining positive directions are nonlinear tasks—enumerating multiple power-flow solutions, detecting bifurcations and ill-conditioning, and improving initialization robustness—provided those quantum routines beat classical alternatives such as Holomorphic-NRLF on the same task."],"supporting_citations":[{"why":"Establishes the quantum linear-systems algorithm and the Omega(kappa) query-complexity lower bound used for state propagation in the lower-bound derivation.","marker":"[9]"},{"why":"Provides the state-preparation-unitary tomography algorithm whose Theta(N/epsilon) cost sets the readout term of the end-to-end runtime.","marker":"[18]"},{"why":"Supplies the state-preparation complexity Theta(log N) with QRAM and the end-to-end algorithm decomposition the paper builds on.","marker":"[17]"},{"why":"Prior end-to-end complexity analysis of quantum power flow that this paper extends from linear power flow to the AC power flow problem.","marker":"[10]"},{"why":"Conjugate-gradient tutorial supplying the O(N s sqrt(kappa) log(1/epsilon_c)) runtime and the energy-norm error definition converted to ell-2 error.","marker":"[12]"},{"why":"Standard power-systems reference giving the ACPF equations, Jacobian structure, and sparsity relation to the admittance matrix.","marker":"[1]"},{"why":"PGLib datasets whose Jacobian condition numbers are used to set kappa and illustrate iteration-to-iteration variation.","marker":"[13]"},{"why":"Power-system modelling reference supporting the NRLF and FDLF iteration behavior and convergence-caveat claims.","marker":"[11]"}],"fun_headline_variants":["Quantum ACPF: readout cost kills advantage unless ε ~ 0.05","Quantum advantage in ACPF? Only if you don't need accuracy","Classical Newton-Raphson beats quantum ACPF at realistic tolerances","Quantum ACPF advantage fails due to readout overhead","AC power flow: quantum readout wall makes classical the winner"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that any useful quantum ACPF solver must classically read out the full dense solution vector, with readout cost proportional to the number of buses divided by the error tolerance; if a solver only reports a few operator-relevant numbers, or hands the quantum state to another quantum routine, the claimed lower bound no longer applies.","fun_headline_variants_meta":{"raw":{"variants":["Quantum ACPF: readout cost kills advantage unless ε ~ 0.05","Quantum advantage in ACPF? Only if you don't need accuracy","Classical Newton-Raphson beats quantum ACPF at realistic tolerances","Quantum ACPF advantage fails due to readout overhead","AC power flow: quantum readout wall makes classical the winner"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000629,"raw_usage":{"total_tokens":2905,"prompt_tokens":942,"completion_tokens":1963,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":558,"completion_tokens_details":{"reasoning_tokens":1868}},"tokens_in":558,"tokens_out":1963,"duration_ms":13886,"temperature":1.0,"reasoning_tokens":1868,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T22:00:48.547842+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run an end-to-end quantum ACPF implementation on a fixed test case at two error targets, say $\\varepsilon = 10^{-3}$ and $\\varepsilon = 10^{-6}$; the claimed readout term predicts about a $10^3$-fold runtime increase, whereas a logarithmic dependence predicts only about a factor of two. A measured increase close to two, or any solver achieving total runtime $O(N\\kappa \\log(\\kappa/\\varepsilon))$ at $\\varepsilon = 10^{-6}$, would falsify the paper's lower bound.","supporting_citations":[{"cited_title":"Quan- tum tomography using state-preparation unitaries,","cited_arxiv_id":null,"evidence_quote":"Provides the state-preparation-unitary tomography algorithm whose Theta(N/epsilon) cost sets the readout term of the end-to-end runtime."},{"cited_title":"Demystifying quan- tum power flow: Unveiling the limits of practical quantum advantage,","cited_arxiv_id":null,"evidence_quote":"Prior end-to-end complexity analysis of quantum power flow that this paper extends from linear power flow to the AC power flow problem."},{"cited_title":"An introduction to the conjugate gradient method without the agonizing pain,","cited_arxiv_id":null,"evidence_quote":"Conjugate-gradient tutorial supplying the O(N s sqrt(kappa) log(1/epsilon_c)) runtime and the energy-norm error definition converted to ell-2 error."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Standard power-systems reference giving the ACPF equations, Jacobian structure, and sparsity relation to the admittance matrix."},{"cited_title":"Milano,Power system modelling and scripting","cited_arxiv_id":null,"evidence_quote":"Power-system modelling reference supporting the NRLF and FDLF iteration behavior and convergence-caveat claims."}],"review_version":1}