{"id":"fddf577b-d4c2-4e2a-a487-79994e08dcd8","arxiv_id":"2601.18024","paper_version":2,"verdict":"REJECT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":2,"one_line_summary":"Fourier-extension-based LCU approximates non-unitary operators with exponential accuracy and subnormalization growing only double-logarithmically in inverse error.","lead":"This paper proposes a new way to represent non-unitary quantum operations as a weighted list of simple unitary operations, using a classical approximation trick called Fourier extension to make the list short and accurate. If the claimed scaling holds, it would cut the overhead of simulating open quantum systems and running quantum linear algebra.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The asymptotic α=O(loglog 1/ε) claim rests on an empirical L1-coefficient-norm scaling observed only for m≤16; without rigorous or extended numerical support the central advantage is unestablished.","rationale":"The reader's weakest assumption correctly identifies the empirical basis of S_m = O(log m), and the paper's own admission in Section 5 confirms this is the load-bearing point. The entire asymptotic improvement over the finite-difference method (Eq. 5) depends on this scaling. The numerical evidence is limited to m≤16, which is too small to establish an asymptotic regime, particularly because Fourier extensions are known to be susceptible to coefficient blow-up (ref [25]). The proposed test—extending S_m computations with high precision—would provide a concrete, quantitative check on whether the empirical trend continues. Since the reader already assigned REJECT and my analysis supports that verdict, no change to the verdict is needed.","tokens_in":14386,"tokens_out":4639,"duration_ms":43783,"concrete_test":"Compute S_m = ∑_{k=1}^m |a_k| for the least-squares Fourier extension coefficients of f(τ)=τ on [-π/η,π/η] with the paper's η=2+0.460m^{-0.319}, using arbitrary-precision arithmetic (e.g., 200-digit) for m=32, 64, 128, 256, 512, and report the condition number of the Gram matrix. If S_m grows faster than O(log m) (e.g., C m^p with p>0), the α=O(loglog 1/ε) claim is refuted. If instead S_m follows O(log m) up to m=512 and the Gram condition number remains manageable, that would provide important supporting evidence, though still not a proof.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central asymptotic advantage claimed in the abstract and Section 5 is α=O(∥A∥2 log m)=O(∥A∥2 loglog 1/ε). This rests on Eq. (14), α = (2η/π max[∥H1∥2,∥H2∥2]) ∑|ak|, combined with the assertion that S_m := ∑|ak| = O(log m). The authors explicitly state in Section 5: 'we are unable to conclude that α becomes independent of m. Instead, we consider the empirical observation ∑|ak|=O(log m) for the range of m≤16 relevant to this study.' No theorem or error bound is provided for S_m; the numerical evidence stops at m=16 because double precision is exhausted. Known Fourier-extension theory (Huybrechs 2010, ref [25]) documents cases where coefficients fail to decay and can grow without bound as m increases, so the observed exponential decay in Table A is not guaranteed to persist. If S_m grows polynomially or exponentially in m, then α = O(∥A∥2 loglog 1/ε) collapses, and the method's advantage over the finite-difference decomposition (Eq. 5) disappears or reverses. Thus the paper's flagship complexity claim is not established.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a linear-combination-of-unitaries (LCU) decomposition for non-unitary operators based on a Fourier extension of the identity map f(τ)=τ on a subinterval of a larger periodic domain. The sine-series coefficients are obtained either by least squares (Section 4.1, Table A) or by a regularized optimization that trades error against subnormalization (Section 4.2, Table B). The authors give a quantum circuit implementation (Section 3) and claim that the resulting block encoding has exponentially decaying error in m and subnormalization α=O(∥A∥_2 loglog 1/ε), a substantial improvement over the polynomial dependence of finite-difference decompositions such as Eq. (5). Numerical demonstrations include coefficient tables and a statevector simulation of a dephasing Lindblad equation (Section 6).","tokens_in":14701,"tokens_out":8010,"duration_ms":85164,"significance":"If the advertised asymptotic scaling were rigorously established, Fourier-LCU would be a valuable primitive for quantum numerical linear algebra, turning generic non-unitary block encodings into a near-optimal resource. The fixed-m decomposition and circuit construction are mathematically sound and clearly presented, and the accompanying coefficient tables and statevector simulations are useful. However, the central complexity claim—the double-logarithmic subnormalization—is not proven; the manuscript itself states that the relevant coefficient norm growth is only an empirical observation for m≤16. Since this scaling is the main advertised advantage over existing methods, the significance of the paper as it stands is substantially reduced.","major_comments":[{"comment":"The central claim α=O(∥A∥_2 log m)=O(∥A∥_2 loglog 1/ε) is not established. The text explicitly says 'we are unable to conclude that α becomes independent of m' and then relies on the 'empirical observation ∑|a_k|=O(log m) for the range of m≤16 relevant to this study.' Because m=O(log 1/ε) can be arbitrarily large as ε→0, evidence for m≤16 cannot determine the asymptotic scaling. The cited Fourier-extension behavior (Ref. [25]) includes cases with non-decaying or growing coefficients, so the observed exponential decay in Table A is not guaranteed to persist. This is the load-bearing point behind the abstract and conclusion; without a proof or high-precision evidence for substantially larger m, the advertised advantage over Eq. (5) is unsupported.","section":"Section 5, final paragraph (after Eq. (14))"},{"comment":"The prescription η=2+0.460m^{-0.319} is a fitted curve over m≤16, and the associated inferences that η*→2 and S'_∞(2)=0 are not proven. The coefficient tables and the error/subnormalization estimates all depend on this choice of η. Since η is used in Eq. (14) for α and in Eq. (16) for the required m, the empirical nature of this fit propagates into the main resource analysis. A rigorous or at least more extensive numerical characterization of η*(m) is needed before the asymptotic complexity statements can be accepted.","section":"Section 4.1, Eq. (18) and Fig. 2d"},{"comment":"The claim that regularized coefficients reduce α as m grows rests on numerical Pareto-front computations for m up to 64. Corollary 1.2 only establishes that α*_m(ε) converges for fixed ε; it does not quantify the limit or show that it remains small for the target-accuracy range. The λ-sweep procedure is an optimization heuristic, and the statement that the benefit is 'robust' is stronger than what the numerical evidence supports. This is secondary to the main complexity claim, but it should be tempered.","section":"Section 4.2, Corollary 1.2 and Fig. 3"}],"minor_comments":[{"comment":"The table layout is confusing: rows for different m values are merged into a two-column block, with repeated 'k' headers. Separating the cases (e.g., with clear m labels in each column) would improve readability.","section":"Table A"},{"comment":"The statement m=O(1/δ(η) log 1/ε) is only an order-of-magnitude estimate. The constant and the range of validity should be specified, especially because the decay rate depends on the fitted η.","section":"Eq. (16)"},{"comment":"The notation 'loglog 1/ε' is nonstandard; it should be written as log log(1/ε) or log log(1/ε) with parentheses, to avoid confusion with a logarithm of a product.","section":"Abstract and Section 5"},{"comment":"The gate count O([sm+log{1/ε}]m log m) is derived under the assumption ∥H_max∥=O(∥A∥_2), which is stated but not justified in detail. A short explanation of this bound would be helpful.","section":"Section 5, second paragraph"},{"comment":"The comparison between least-squares and regularized coefficients is insightful, but the conclusion that the regularized coefficients are useful for 'practical quantum computation' is based on a single example; a brief discussion of parameter regimes would strengthen the claim.","section":"Section 6, Fig. 4"}],"recommendation":"reject","confidential_remarks":"The manuscript is honest about its main limitation, but that limitation is precisely the advertised asymptotic advantage. The fixed-m construction and numerical demonstrations are solid, so if the authors can supply a rigorous bound on ∑|a_k| or high-precision numerical evidence for m up to at least 64–128, a resubmission could be considered. As it stands, the central complexity claim is not established."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Mark, the thing to know: this is not a rehash. The Fourier-extension LCU in Eq. (9) genuinely differs from the Schlimgen finite-difference family in Eq. (5); it approximates the identity map by a sine series on an extended interval and converts that into 4m unitaries. The small-m evidence is good: exponential convergence down to double precision by m=16, subnormalization around 5 (or 2 with regularized coefficients), reproduced in a 2-qubit statevector simulation. The authors know their own weak spot. Section 5 says outright that they cannot prove sum|a_k| is bounded or O(log m); they fall back on an empirical observation valid only for m<=16 because double precision is exhausted. That is the claim that carries alpha=O(||A||_2 log m)=O(||A||_2 loglog(1/epsilon)). The stress-test note is right to call it load-bearing. Known Fourier-extension theory (ref 25, Huybrechs) has examples where coefficients don't settle down, so extrapolating to large m is not safe. The eta formula is a fitted curve too. The paper is not circular—the decomposition isn't derived from the quantity it is supposed to predict—but the scaling law is inferred from the same coefficients used to construct the method, so 'prediction' is the wrong word.\n\nThat said, I don't think the right verdict is a flat reject. The contribution is new, the numerical claims are reproducible from the tables, and the authors flag the unsupported step rather than burying it. What needs to happen is either (a) a proof of the L1-coefficient scaling or a rigorous error bound that implies it, or (b) an honest repositioning: a practical finite-m method with strong numerical evidence, not an asymptotic complexity claim. A serious referee could get them there. I also note the paper doesn't compare against QSVT/qubitization block encodings; that comparison matters for the 'near-optimal' claim. The statevector demo is minimal (one driven qubit), but the method's behavior is scalar in m, so that is not the main limitation.\n\nBottom line: worth engaging. I'd take it to peer review, and I'd tell the authors to either prove or demote the asymptotic alpha claim. If I cite it, I'd cite the decomposition and the finite-m empirical results, not the double-log scaling.","headline":"Fourier-LCU is a genuine new decomposition with strong small-m numerics, but the flagship alpha=O(loglog 1/epsilon) scaling is an openly empirical extrapolation from m<=16; treat it as plausible, not proven.","tokens_in":15168,"tokens_out":2989,"would_cite":true,"duration_ms":30338,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":["03.67.Ac"],"model":"deepseek-v4-flash","headline":"This paper proposes a Fourier-extension LCU decomposition that approximates any non-unitary operator by 4m unitaries with error decaying exponentially in m, while keeping block-encoding subnormalization O(||A||_2 log log 1/ε).","keywords":["linear combination of unitaries","block encoding","Fourier extension","subnormalization","quantum numerical linear algebra","matrix functions","open quantum systems","quantum singular value transformation"],"falsifier":"Evaluate the least-squares Fourier-extension coefficients in high-precision arithmetic for m beyond 16 and test whether Σ|a_k| continues to grow like log m; if the sum instead grows polynomially in m, the α=O(log log 1/ε) claim fails even if the exponential error convergence holds. A complementary check is to solve for the minimal achievable α at a fixed ε and compare it against the claimed O(log log 1/ε) bound.","tokens_in":14247,"feed_emoji":"⚛️","tokens_out":7255,"duration_ms":68820,"temperature":0.7,"pith_summary":"The paper's central thesis is that the long-standing trade-off between approximation error and subnormalization in general LCU block encodings can be broken by replacing the local Taylor/sine approximation of the map τ with a Fourier extension—a sine series on a larger periodic domain that approximates τ on a smaller interior interval. For any non-unitary A=H1+iH2, this yields A as a linear combination of 4m unitaries whose error decays exponentially in m, and whose subnormalization is α=(2η/π)max(||H1||_2,||H2||_2)Σ|a_k|. Observing numerically that Σ|a_k|=O(log m) for the least-squares coefficients, the paper concludes α=O(||A||_2 log log 1/ε), near-optimal since α must always grow with ||A||_2. It also shows that by regularizing the least-squares problem with an L1 penalty, one can traverse a Pareto front that lowers α further at a fixed error budget. A sympathetic reader should care because this removes the polynomial penalty that has limited practical use of non-unitary block encodings in quantum simulation and QSVT workflows.","feed_headline":"Block-encoding cost drops to log-log precision via Fourier extension","feed_subtitle":"A Fourier extension gives exponentially accurate linear combinations of unitaries for non-unitary operators, with only a log-log penalty on","key_machinery":"The central object is the Fourier-extension sine series f(τ)≈Σ_{k=1}^m a_k sin(kτ), solved by continuous least squares on the interior interval [−π/η,π/η] of a [−π,π] periodic domain. Extension factor η>1 creates a buffer zone that makes the periodic extension smooth, so coefficients decay exponentially; η=2+0.460m^{-0.319} minimizes the cost mα. The sine terms are rewritten via e^{ikτH}−e^{-ikτH}=2i sin(kτH), converting the series into an LCU. The subnormalization is controlled by S_m=Σ|a_k|, and the overcomplete dictionary (η>1) admits a null space that regularized fitting exploits to reduce S_m at fixed error.","core_discovery":"For A=H1+iH2, the Fourier-LCU decomposition is A ≈ (1/(2τ)) Σ_{k=1}^m a_k [ i e^{-ikτH1} − e^{-ikτH2} − i e^{ikτH1} + e^{ikτH2} ], with τ=π/(η max[||H1||_2,||H2||_2]). The coefficients a_k are the least-squares Fourier-extension coefficients for f(τ)=τ on [−π/η,π/η], and each sine is written as a difference of two unitaries, so the total is 4m unitaries. The approximation error converges exponentially in m, while the subnormalization is α=(2η/π)max[||H1||_2,||H2||_2]Σ|a_k|. On the evidence of m≤16 computations, Σ|a_k|=O(log m), giving α=O(||A||_2 log log 1/ε) when m=O(log 1/ε). The paper further introduces a regularized fitting objective whose L1 term directly penalizes α, demonstrating nume","pith_inferences":["Beyond the paper: the α=O(log log 1/ε) guarantee is only as solid as the empirical Σ|a_k|=O(log m) observation; proving this growth from Fourier-extension theory would remove the paper's explicit caveat that it cannot rule out m-dependence.","Beyond the paper: because Fourier extensions are known to grow outside the fitted interval, using these block encodings for operators whose spectra approach the interval boundary may require shrinking τ by a constant factor; this is a testable design choice not analyzed in the paper.","Beyond the paper: if the regularized-coefficient Pareto fronts continue to flatline at larger m, one could expect near-constant subnormalization in practice even for machine-precision errors, shifting the practical bottleneck to the depth of the controlled Hamiltonian simulations.","Beyond the paper: the same coefficient machinery might be reused for other functions of Hermitian operators (for example f(τ)=1/τ or sign functions) by Fourier-extending the appropriate odd function, although the paper only treats the identity map."],"forward_implications":["Replacing finite-difference decompositions with Fourier LCU reduces the postselection penalty from α=poly(1/ε) to α=O(log log 1/ε) for a given accuracy, so amplitude amplification becomes far less demanding.","Algorithms for open quantum systems, linear systems, and differential equations that currently use four-unitary decompositions can inherit this improved scaling without structural assumptions on the operator.","At a fixed error budget, L1-regularized coefficient selection yields smaller α (about 2 versus 5 in the paper's numerical example), meaning higher signal strength and fewer required postselection attempts.","For s-sparse Hamiltonians with oracular access, the gate complexity of preparing one block encoding is O(Q[s+1]||A||_2 log^2(1/ε) log^2 log(1/ε)), where Q encodes input normalization.","The same Fourier-extended sine series can encode Hermitian eigenvalue transforms and odd singular-value transforms, making it a direct access point for QSVT and quantum linear systems algorithms."],"fun_headline_variants":["Fourier extension slashes block-encoding cost to O(log log 1/ε)","Exponential precision in block encodings with only log-log overhead","Matrix-function encodings get exponential convergence, minimal cost","New Fourier-LCU method cuts subnormalization to logarithmic scaling","Error-independent subnormalization via Fourier-extension LCU"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The double-logarithmic subnormalization claim rests entirely on the empirical observation that the L1 norm of the least-squares Fourier-extension coefficients satisfies Σ|a_k|=O(log m) for m≤16, and on the assumption that this growth persists for all m needed to reach the target error; the paper says it cannot conclude α becomes independent of m.","fun_headline_variants_meta":{"raw":{"variants":["Fourier extension slashes block-encoding cost to O(log log 1/ε)","Exponential precision in block encodings with only log-log overhead","Matrix-function encodings get exponential convergence, minimal cost","New Fourier-LCU method cuts subnormalization to logarithmic scaling","Error-independent subnormalization via Fourier-extension LCU"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000167,"raw_usage":{"total_tokens":1129,"prompt_tokens":811,"completion_tokens":318,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":555,"completion_tokens_details":{"reasoning_tokens":227}},"tokens_in":555,"tokens_out":318,"duration_ms":3928,"temperature":1.0,"reasoning_tokens":227,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-03T08:06:47.130642+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Evaluate the least-squares Fourier-extension coefficients in high-precision arithmetic for m beyond 16 and test whether Σ|a_k| continues to grow like log m; if the sum instead grows polynomially in m, the α=O(log log 1/ε) claim fails even if the exponential error convergence holds. A complementary check is to solve for the minimal achievable α at a fixed ε and compare it against the claimed O(log log 1/ε) bound.","supporting_citations":[],"review_version":1}