{"id":"572c45e9-d7ed-4331-a060-957b8c2e9530","arxiv_id":"2608.02734","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"This paper proves that the Jacobi-Anger truncation degree for qubitized Hamiltonian simulation has leading constant 1, improving the previous rigorous bound with constant e/2.","lead":"This paper tightens the mathematical bounds on the number of quantum operations needed to simulate a Hamiltonian, cutting the leading cost estimate by about 36 percent. The improvement comes from a sharper analysis of the leftover error when quantum time evolution is approximated by a truncated series.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified; the flagged Eq. (14) concern is a misprint, not a proof gap.","rationale":"The reader's verdict was CONDITIONAL, based mainly on the supposed inequality issue in Eq. (14). That specific concern is not correct: the transformation is an exact equality up to a typographical slip, and the proof's inequalities are in the right direction. However, the reader also correctly identified that the abstract overclaims universality and that minor references/typographical fixes are needed. These are not load-bearing for the central mathematical claim, which appears rigorous. I therefore see no reason to move the verdict: CONDITIONAL acceptance pending minor revisions remains appropriate, but not because of a flaw in the tail-bound proof. The stress-test found no significant objection to the main result.","tokens_in":9604,"tokens_out":47036,"duration_ms":392859,"concrete_test":"Independently verify the proof chain numerically: for τ ∈ {1, 10, 100, 10⁴} and ε ∈ {10⁻³, 10⁻⁹}, compute the claimed degree d from Theorems 1 and 2, evaluate the Lemma 3 bound (Eq. 10), and compare it to the exact tail 2∑_{k=d}∞ |J_k(τ)|. Also confirm the identity in Eq. (14) by comparing the Kapteyn factor at several (τ,k) pairs with exp(-k arccosh(k/τ)+√(k²-τ²)). If all bounds hold, the central claim is supported.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim, a rigorous Jacobi-Anger truncation degree with leading constant 1, appears sound. The reader's weakest assumption about Eq. (14) does not land: substituting r = τ/k = sech u shows the Kapteyn factor is exactly exp(-k arccosh(k/τ) + √(k² - τ²)) = exp(-∫_τ^k arccosh(s/τ) ds). The printed equation likely has a misplaced factor, but the subsequent derivation uses the correct identity, and the inequality direction is not endangered. The fixed-point arguments in Lemmas 4 and 5 are also valid: f and g are strictly decreasing (their derivatives are negative), the lower-bound substitutions satisfy the required inequalities, and the unique fixed points exist. The main proof therefore holds. Remaining concerns are editorial: Eq. (14) should be corrected, the figure caption cites Ref. [9] instead of [18], and the abstract's 'all Hamiltonian simulation tasks' overstates the scope to qubitized/QSP methods. None of these change the asymptotic constant-factor result.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves new rigorous bounds on the Jacobi-Anger truncation degree needed for quantum signal processing (QSP) / qubitized Hamiltonian simulation. For τ = αt and error ε, Theorem 1 gives d = ⌈τ cosh((3/τ ln(2/(ε(1−e^{−θ0}))))^{1/3})⌉ with θ0 = (3/τ ln(2/ε))^{1/3}, which expands as d = τ + (τ^{1/3}/2)(3 ln(2/(ε(1−e^{−θ0}))))^{2/3} + Õ(τ^{−1/3}); Theorem 2 sharpens this using Watson's inequality. The proofs use Kapteyn's and Watson's Bessel-function inequalities, a geometric-series majorant of the tail, and a fixed-point argument to linearize the transcendental bound. The leading query-count constant is 1, improving on prior bounds that gave about e/2 times the leading constant, and the paper reports numerical comparisons against the exact Bessel tail computed with SciPy.","tokens_in":9776,"tokens_out":19611,"duration_ms":162643,"significance":"If the theorems are correct, this is a useful constant-factor improvement for resource estimates in QSP/qubitized Hamiltonian simulation. The central derivation is self-contained: it uses standard Bessel inequalities and an explicit numerical benchmark, and the asymptotic form (d ≈ τ + O(τ^{1/3} log^{2/3}(1/ε))) is the expected near-optimal behavior. The paper is incremental (constant factors rather than asymptotic class), but constant-factor reductions are practically meaningful for fault-tolerant resource estimation. The apparent concern about Eq. (14) does not land: substituting r = τ/k = sech u shows that the Kapteyn factor equals exp(−k arccosh(k/τ) + √(k²−τ²)) exactly, so the displayed equality is correct. The main remaining issues are editorial clarity and scope overstatement in the abstract.","major_comments":[],"minor_comments":[{"comment":"The fixed-point paragraph is logically correct but too compressed: from θ0 = inf f(θ) it follows that f(θ0) ≥ θ* and therefore every θ ≥ f(θ0) satisfies the sufficient condition θ ≥ f(θ), because f is decreasing and f(θ0) ≥ θ0. The current wording ('using the property θ ≥ f(θ0)') asks the reader to reconstruct this argument; please state it explicitly. The analogous step for θ_lo in the proof of Lemma 5 would also benefit from an explicit monotonicity sentence.","section":"Section III, proof of Lemma 4"},{"comment":"The legend cites 'Ref [9] Cor. 62' and 'Ref [2] Lemma. 5', but the corresponding bibliography entries are Ref. [18] (Gilyén et al.) and Ref. [7] (Jennings et al.); please correct the citation numbers.","section":"Figure 1 caption"},{"comment":"The phrase 'reducing the overhead estimates for all Hamiltonian simulation tasks on quantum computers' overstates the scope: the result applies to QSP/GQSP-based (qubitized) Hamiltonian simulation, not to every Hamiltonian simulation method (e.g., Trotter or product-formula approaches). Please reword to 'qubitized Hamiltonian simulation' or 'QSP-based Hamiltonian simulation'.","section":"Abstract and Section I"},{"comment":"There is a typo: 'Kapetyn' should be 'Kapteyn'. Also, in Section II, 'more closely tracts the error' should be 'more closely tracks the error'.","section":"Section III, first paragraph"},{"comment":"For the record, the equality in Eq. (14) is correct; no correction is needed. The stress-test concern about a possible inequality direction does not arise because the hyperbolic substitution is exact.","section":"Section III, Eq. (14)"}],"recommendation":"minor_revision","confidential_remarks":"The paper is sound and the main constant-factor result appears correct. The numerical comparison with SciPy is a good sanity check. I recommend minor revision: the only issues are clarity of the fixed-point exposition, a few citation/typo errors, and the overbroad 'all Hamiltonian simulation tasks' phrasing. No underlying mathematical flaw was found."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nHere's my read of arXiv:2608.02734. The headline: the paper proves a rigorous Jacobi-Anger truncation degree with leading constant 1 for qubitized Hamiltonian simulation, improving the previous rigorous bound of e/2 from Jennings et al. The proof is real and the main theorems hold up. The authors acknowledge the Airy asymptotic in Babbush et al. already gave the leading 1 non-rigorously, so the novelty is the rigorous explicit bound, not the asymptotic discovery itself. That's fair.\n\nThe work is self-contained: Kapteyn and Watson inequalities, a geometric-series majorant, and a fixed-point argument pin down the degree. Lemmas 4 and 5 are sound; f and g are strictly decreasing and the fixed-point lower-bound trick works. I also checked the flagged issue in Lemma 3: the printed equation (14) looks like a false equality, but substituting r = tau/k gives exactly the exponential of -integral arccosh(s/tau) ds, so it's a typesetting mistake, not a gap in the argument. The subsequent bounds and the final theorem don't depend on the misprinted equality.\n\nCredit where due: the numerical comparison to the exact Bessel tail is useful and shows the bound is tight in the practical tau range. The use of previous GQSP conversion is appropriately black-box. No code or data shipped, but the methods are described precisely enough to re-implement.\n\nSoft spots, mostly editorial. The abstract says 'reducing the overhead estimates for all Hamiltonian simulation tasks' and 'future improvements will not be of practical significance.' Those claims outrun the body text, which focuses on qubitized/QSP simulation with a block-encoded Hamiltonian. The phrase 'loose by a logarithmic factor' in Section II is confusing. The figure caption cites Ref. [9] where it means Ref. [18]. None of these affect the math.\n\nIf I were refereeing, I'd recommend minor revision: fix Eq. (14), temper the abstract, correct the caption. The result is a legitimate improvement in the constant factor and worth publishing. A serious editor should send it to review. I'd cite it in resource estimates for qubitized simulation.","headline":"First rigorous leading-constant-1 bound for qubitized Hamiltonian simulation; the core proof is sound, with a few editorial fixes needed.","tokens_in":10314,"tokens_out":2276,"would_cite":true,"duration_ms":20019,"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 proves that a degree-d Jacobi-Anger truncation with leading coefficient d = \\alpha t + O((\\alpha t)^{1/3} \\log^{2/3}(1/\\epsilon)) suffices for qubitized Hamiltonian simulation, bringing the query count's constant factor to…","keywords":["Hamiltonian simulation","qubitization","quantum signal processing","Jacobi-Anger expansion","Bessel functions","Kapteyn inequality","Watson inequality","query complexity"],"falsifier":"Compute the true Jacobi-Anger tail $S(\\tau,d)=2\\sum_{k=d}^\\infty |J_k(\\tau)|$ over a dense grid of $\\tau$ and $d$, such as $\\tau\\in[1,10^6]$ with $d$ just above $\\tau$, and compare it against the Lemma 3 bound $2e^{-d\\operatorname{arccosh}(d/\\tau)+\\sqrt{d^2-\\tau^2}}/(1-e^{-\\operatorname{arccosh}(d/\\tau)})$; any single point where the bound falls below the true tail falsifies Lemma 3 and therefore both theorems. A more targeted check verifies whether $|J_k(\\tau)| \\le \\exp(-\\int_\\tau^k \\operatorname{arccosh}(s/\\tau)\\,ds)$ holds for all integer $k\\ge\\tau$ and all $\\tau>0$.","tokens_in":9392,"feed_emoji":"⚛️","tokens_out":13342,"duration_ms":101194,"temperature":0.7,"pith_summary":"Quantum signal processing simulates $e^{-iHt}$ by polynomial approximation: the Jacobi-Anger expansion writes the evolution as a series of walk-operator terms with Bessel coefficients $J_k(\\alpha t)$, and the practical question is where to truncate. This paper proves that a truncation of degree $d = \\alpha t + \\frac{(\\alpha t)^{1/3}}{2}(3\\ln(2/(\\epsilon(1-e^{-\\theta_0}))))^{2/3} + \\tilde O((\\alpha t)^{-1/3})$ is rigorously sufficient, so the leading constant in the number of walk-operator queries is $1$, not the $e/2$ or $2$ of earlier bounds. That reduces the estimated query overhead for any Hamiltonian simulation task built on qubitized quantum signal processing by a factor of about $e/2$, which matters because practical applications typically have $\\alpha t$ between $10^4$ and $10^6$. The improvement comes from bounding the Bessel tail more carefully using Kapteyn's and Watson's inequalities.","feed_headline":"Qubitized simulation hits near-optimal query count","feed_subtitle":"Rigorous Bessel-tail bounds bring the leading constant from e/2 down to effectively 1.","key_machinery":"The load-bearing object is the truncation error $T_\\epsilon(\\tau,d) = \\max_{x\\in[-1,1]}|e^{i\\tau x} - J_0(\\tau) - 2\\sum_{k=1}^{d-1} i^k J_k(\\tau) T_k(x)|$. Lemma 3 bounds this by $2\\sum_{k=d}^\\infty |J_k(\\tau)|$, invokes Kapteyn's inequality $|J_k(\\tau)| \\le ((\\tau/k)e^{\\sqrt{1-(\\tau/k)^2}}/(1+\\sqrt{1-(\\tau/k)^2}))^k$, and transforms each term into $\\exp(-\\int_\\tau^k \\operatorname{arccosh}(s/\\tau)\\,ds)$; the tail is then dominated by a geometric series with ratio $e^{-\\operatorname{arccosh}(d/\\tau)}$, giving $T_\\epsilon \\le 2e^{-d\\operatorname{arccosh}(d/\\tau)+\\sqrt{d^2-\\tau^2}}/(1-e^{-\\operatorname{arccosh}(d/\\tau)})$. Setting $\\theta=\\operatorname{arccosh}(d/\\tau)$ and using $\\theta\\cosh\\theta - \\sinh\\theta \\ge \\theta^3/3$ reduces the condition $T_\\epsilon\\le\\epsilon$ to a fixed-point inequality whose solution is Theorem 1; replacing Kapteyn's inequality by Watson's inequality inserts the prefactor $(2\\pi\\sqrt{d^2-\\tau^2})^{-1/2}$ and yields the tighter Theorem 2. The integer ceiling and the $d+2$ query overhead from generalized quantum signal processing turn the degree bound into a query count.","core_discovery":"The central discovery is a rigorous, near-optimal bound on the Jacobi-Anger truncation degree needed to approximate $e^{-i\\tau x}$ on $[-1,1]$. With $\\theta_0 = (3/(\\alpha t)\\ln(2/\\epsilon))^{1/3}$, Theorem 1 gives $d = \\lceil \\alpha t \\cosh((\\frac{3}{\\alpha t}\\ln\\frac{2}{\\epsilon(1-e^{-\\theta_0})})^{1/3})\\rceil$, which expands as $d = \\alpha t + \\frac{(\\alpha t)^{1/3}}{2}(3\\ln\\frac{2}{\\epsilon(1-e^{-\\theta_0})})^{2/3} + \\tilde O((\\alpha t)^{-1/3})$. Theorem 2 refines this by using Watson's inequality instead of Kapteyn's, producing a bound that remains tight for smaller values of $\\alpha t$. Since generalized quantum signal processing converts a degree-$d$ polynomial into exactly $d+2$ walk-operator queries, the final query count inherits the same leading constant $1$. The paper's numerical comparison shows the analytical bound tracking the exact Bessel tail closely in the practical range $\\alpha t \\approx 10^4$\\textendash$10^6$.","pith_inferences":["The same Bessel-tail majorization could be exported to other settings where Jacobi-Anger truncation errors are the bottleneck, such as fast multipole scattering calculations, yielding rigorous constant-factor improvements beyond Hamiltonian simulation; the paper does not discuss these applications.","The fixed-point recursion the authors mention in passing, substituting $\\theta_1, \\theta_2, \\dots$, could be developed into an explicit iterative scheme with a proof of geometric convergence, which would tighten the remaining logarithmic gap for moderate $\\alpha t$.","A direct pointwise check of the Kapteyn-to-exponential majorization across all $(\\tau,k)$ would turn the equality in Eq. (16) into a certified inequality; if the true Bessel tail ever exceeded the Lemma 3 bound, the main theorems would need an amended prefactor, but the numerical evidence in Fig. 1 suggests the inequality direction is safe."],"forward_implications":["Every Hamiltonian simulation algorithm that calls qubitized quantum signal processing as a subroutine, including phase estimation, matrix inversion, Lindbladian time evolution, and first-quantized chemistry simulation, inherits a rigorous query-count reduction of about $e/2$ compared with the previous best bound.","For realistic values $\\alpha t \\approx 10^4$\\textendash$10^6$, the new bound gives $d/\\tau$ numerically so close to $1$ that further constant-factor work on the Jacobi-Anger truncation is unlikely to produce practically meaningful improvements.","The degree bound combines directly with generalized quantum signal processing, so the total number of block-encoding queries is $d+2$, with the same leading constant $1$.","Theorem 2's Watson-based bound serves as a rigorous replacement for the non-rigorous Airy-function asymptotic formula, remaining accurate across a wider range of $\\alpha t$ including short time steps."],"supporting_citations":[{"why":"Supplies Kapteyn's inequality, the termwise bound on $|J_k(\\tau)|$ that Lemma 3 converts into a geometric tail bound.","marker":"[19]"},{"why":"Supplies Watson's inequality, the tighter prefactor used in Lemma 5 and Theorem 2.","marker":"[20]"},{"why":"Shows that a degree-$d$ polynomial can be implemented with $d+2$ queries to the walk operator, converting the degree bound into the final query count.","marker":"[17]"},{"why":"Provides the prior QSVT degree bound $d = \\lceil 2\\alpha t + 3\\ln(12/\\epsilon)\\rceil$ that this work improves upon.","marker":"[18]"},{"why":"Provides the previous best constant factor $d = \\lceil (e/2)\\alpha t + \\ln(2c/\\epsilon)\\rceil$, the baseline for the claimed $e/2$ overhead reduction.","marker":"[7]"},{"why":"Contains the Airy-function asymptotic formula for the Bessel tail that Theorem 2 improves into a rigorous bound.","marker":"[28]"}],"fun_headline_variants":["Qubitized simulation constant drops to near 1","Bessel-tail bound nails near-optimal query count","Simulation overhead cut to near-unity multiplicative factor","Sharper Bessel tail gives constant effectively 1","Hamiltonian simulation: from e/2 to near-optimal constant"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is the step in Section III, Eqs. (14)\\textendash(16), where the Kapteyn bound on $|J_k(\\tau)|$ is written as an equality with $\\exp(-\\int_\\tau^k \\operatorname{arccosh}(s/\\tau)\\,ds)$; that step is only valid as an inequality in the needed direction, and if the direction ever reversed, the geometric-series argument behind Eq. (23) and hence both main theorems would collapse.","fun_headline_variants_meta":{"raw":{"variants":["Qubitized simulation constant drops to near 1","Bessel-tail bound nails near-optimal query count","Simulation overhead cut to near-unity multiplicative factor","Sharper Bessel tail gives constant effectively 1","Hamiltonian simulation: from e/2 to near-optimal constant"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000287,"raw_usage":{"total_tokens":1704,"prompt_tokens":982,"completion_tokens":722,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":598,"completion_tokens_details":{"reasoning_tokens":642}},"tokens_in":598,"tokens_out":722,"duration_ms":6743,"temperature":1.0,"reasoning_tokens":642,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T15:01:28.410618+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the true Jacobi-Anger tail $S(\\tau,d)=2\\sum_{k=d}^\\infty |J_k(\\tau)|$ over a dense grid of $\\tau$ and $d$, such as $\\tau\\in[1,10^6]$ with $d$ just above $\\tau$, and compare it against the Lemma 3 bound $2e^{-d\\operatorname{arccosh}(d/\\tau)+\\sqrt{d^2-\\tau^2}}/(1-e^{-\\operatorname{arccosh}(d/\\tau)})$; any single point where the bound falls below the true tail falsifies Lemma 3 and therefore both theorems. A more targeted check verifies whether $|J_k(\\tau)| \\le \\exp(-\\int_\\tau^k \\operatorname{arccosh}(s/\\tau)\\,ds)$ holds for all integer $k\\ge\\tau$ and all $\\tau>0$.","supporting_citations":[{"cited_title":"Improved constant factors for qubitized Hamiltonian simulation","cited_arxiv_id":"2608.02734","evidence_quote":"Supplies Kapteyn's inequality, the termwise bound on $|J_k(\\tau)|$ that Lemma 3 converts into a geometric tail bound."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies Watson's inequality, the tighter prefactor used in Lemma 5 and Theorem 2."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Shows that a degree-$d$ polynomial can be implemented with $d+2$ queries to the walk operator, converting the degree bound into the final query count."},{"cited_title":"Gily´ en, Y","cited_arxiv_id":null,"evidence_quote":"Provides the prior QSVT degree bound $d = \\lceil 2\\alpha t + 3\\ln(12/\\epsilon)\\rceil$ that this work improves upon."},{"cited_title":"In practical problemsαt≫ln(1/ϵ), therefore finding better constant factors mul- tiplying this term results in immediate algorithmic improvements","cited_arxiv_id":null,"evidence_quote":"Provides the previous best constant factor $d = \\lceil (e/2)\\alpha t + \\ln(2c/\\epsilon)\\rceil$, the baseline for the claimed $e/2$ overhead reduction."}],"review_version":2}