{"id":"83823915-be15-4bcc-b647-ee9e65f8723e","arxiv_id":"2608.05338","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":3.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Exact convolution-type transparent boundary conditions with a Bessel kernel are derived for the semi-discrete Schrödinger equation, and the continuous limit is recovered.","lead":"Researchers derived exact transparent boundary conditions for the discrete Schrödinger equation on a one-dimensional lattice, so a wave packet can leave a truncated simulation box without reflecting back. The result could improve simulations of quantum transport in molecular chains and conducting polymers, where artificial boundaries corrupt the dynamics.","discovery_kind":"incremental","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The fully discrete implementation is not shown to inherit transparency; Eqs. (28)–(32) are algebraically inconsistent (spurious 1/h) and the explicit update lags the Crank-Nicolson solve, so 'entirely reflectionless' is unverified.","rationale":"Good-faith reading: the paper's central mathematical object is Eq. (15), and the Laplace derivation checks out: using the decaying root and the identity L{J1(at)/t}=(-s+√(s^2+a^2))/a indeed yields D_+Φ_J = -h^{-1}Ψ_J + ih^{-1}K*Ψ_J. The continuum-limit consistency argument is heuristic, especially the oscillatory integral split in Eq. (19), but that is not the main claim. The main numerical claim—that the fully discrete Crank-Nicolson/trapezoidal implementation 'eliminates spurious backscattering entirely'—is where the argument is least secure. I found a concrete algebraic inconsistency: the correct relation from (15) has no 1/h in the convolution after multiplying by h, yet Eqs. (28)-(31) carry a 1/h, while Eq. (32) drops it. In addition, the boundary update is described as explicit even though Crank-Nicolson requires a time-level-n+1 coupling; an explicit update must lag the interior value and thereby introduces O(Δt) error. No reference solution or reflection measure is provided. These are fixable presentation and validation gaps, so the reader's CONDITIONAL verdict stands.","tokens_in":9244,"tokens_out":17731,"duration_ms":164427,"concrete_test":"Symbolically re-derive Eqs. (30)-(32) from (15) to settle which 1/h factors belong, then run the §III Gaussian with the TBC imposed as a Robin condition at t_{n+1} inside the Crank-Nicolson solve and compare the reflected probability hΣ_{j≤J}|Ψ_j^{TBC}-Ψ_j^{ref}|^2 against a large-J reference. If the reflection is not at the O(Δt^2) level, or if the correct and lagged implementations differ materially, the 'entirely reflectionless' claim is not established.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The continuous-in-time TBC in Eq. (15) is essentially correct: choosing the decaying root ξ_+(s) and using the Bessel Laplace pair gives D_+Φ_J = -h^{-1}Ψ_J + ih^{-1}K*Ψ_J. The load-bearing gap is the transition from this exact semi-discrete condition to the fully discrete scheme. First, the discretized TBC is internally inconsistent. Multiplying (15) by h gives the correct relation 2Ψ_J(t) - Ψ_{J-1}(t) = i∫_0^t K(t-τ)Ψ_J(τ)dτ with no 1/h. However, Eq. (28) defines I(t)=ih^{-1}∫KΨ_J, and Eqs. (30)-(31) consequently carry an extra factor h in all current and history terms. Eq. (32) is the algebraically correct trapezoidal form of the relation without the 1/h, so Eqs. (28)-(31) and (32) cannot all be correct; an implementer cannot know from the text which convolution scaling the code uses. Second, even the consistent Eq. (32) is written at time level n and involves Ψ^n_{J-1}; the text describes updating Ψ^{n+1}_J explicitly. Crank-Nicolson requires a relation between Ψ^{n+1}_J and Ψ^{n+1}_{J-1} inside the tridiagonal solve, so an explicit update must lag the boundary-adjacent value by one step, changing the TBC by O(Δt). No stability or reflection analysis for this fully discrete coupling is given, and the numerical verification only inspects plots rather than comparing with an infinite-lattice reference or reporting a quantitative reflected-norm measurement. Thus the claim that backscattering is eliminated entirely is not established for the implemented scheme.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper derives transparent boundary conditions (TBCs) for the time-continuous, spatially discrete Schr\\\"odinger equation on a 1D lattice. The authors Laplace-transform the exterior problem, select the decaying characteristic root, and obtain a convolution-type condition with a Bessel kernel, Eq. (15). They then study the continuum limit and propose a trapezoidal-rule time discretization of the convolution term. Numerical experiments with a Crank-Nicolson interior solver and a Gaussian initial packet are presented to support the claim that the boundary is reflectionless.","tokens_in":9588,"tokens_out":10424,"duration_ms":87829,"significance":"If fully established, the paper would provide a useful construction: an exact, parameter-free Dirichlet-to-Neumann map for the semi-discrete Schr\\\"odinger equation, with a Bessel-kernel convolution that reduces formally to the known continuous TBC in the limit h->0. The Laplace-domain derivation of Eq. (15) is essentially sound, and the paper contains no fitted constants or circular reduction to prior results. However, the main headline claim concerns the fully discrete implementation, and that part currently contains algebraic inconsistencies and lacks quantitative verification. The semi-discrete result is valuable, but the manuscript as written does not justify the stronger statement that the implemented scheme 'eliminates spurious backscattering entirely'.","major_comments":[{"comment":"Equations (28)-(31) and (32) are mutually inconsistent. Multiplying the exact TBC (15) by h gives (Psi_J - Psi_{J-1}) = -Psi_J + i \\int_0^t K(t-tau)Psi_J(tau) dtau, hence 2Psi_J - Psi_{J-1} = i \\int_0^t K(t-tau)Psi_J(tau) dtau with no factor 1/h. Equation (28), however, defines I(t) = (i/h)\\int K(t-tau)Psi_J(tau)dtau, and Eqs. (30)-(31) inherit this spurious 1/h. Equation (32) corresponds instead to the no-1/h version: with K(0)=1/(2h^2), the coefficient of Psi^n_J on the right-hand side of (31) would need to be i\\Delta t/(4h^3) to yield the printed denominator, whereas the denominator in (32) is 2 - i\\Delta t/(4h^2). An implementer therefore cannot determine from the text which convolution scaling is actually used in the numerical code.","section":"Section IID, Eqs. (28)-(32)"},{"comment":"The temporal coupling between the boundary update and the interior Crank-Nicolson solve is not specified and appears inconsistent. Equation (32) is written at time level n and expresses Psi^n_J in terms of Psi^n_{J-1} and past values, but the text states that the right boundary value Psi^{n+1}_J is updated explicitly using Eq. (32). If Eq. (32) is evaluated at level n+1, it requires Psi^{n+1}_{J-1}, which is not available until the tridiagonal interior solve is completed; if it is evaluated at level n, it does not update the boundary for the new time level. No stability or reflection analysis for this fully discrete coupling is provided, so the exact transparency of the semi-discrete TBC is not established for the implemented scheme.","section":"Section III, Eq. (32) and Crank-Nicolson update"},{"comment":"The derivation of the continuum limit is formal rather than rigorous, despite the abstract's claim of a rigorous demonstration. Passing from (18) to (19) replaces the upper limit t/h^2 by infinity, then substitutes the large-argument asymptotic (21) and discards the rapidly oscillating term e^{-2iv/h^2} without uniform error estimates in v and t. The final formula (26) is plausible and consistent with (2), but the limit step needs either rigorous estimates or a more cautious statement of the result.","section":"Section IIC, Eqs. (18)-(22)"},{"comment":"The numerical evidence does not quantitatively establish 'entirely reflectionless' transport. Figure 2 is a visual inspection of snapshots, and the monotone decay of the discrete norm in Figure 3 is necessary but not sufficient to exclude a small reflected component. The paper should compare the truncated-domain solution against a reference solution on a sufficiently large (or infinite) lattice and report a quantitative reflected-norm measurement, e.g., R(t) = ||Psi_computed - Psi_reference||_2 or the reflected probability flux. Convergence in h and \\Delta t should also be reported for this quantity.","section":"Section III, numerical verification"}],"minor_comments":[{"comment":"The statement that discrete lattice equations have 'largely remained outside the scope' of exact TBC formulations is too strong in view of the cited works [5,7-9], which already construct discrete transparent boundary conditions for Schr\\\"odinger-type equations; the authors should clarify what is new relative to those works.","section":"Introduction and references"},{"comment":"The phrase 'inspired by the exact power-form solution derived in [31]' is unnecessary: the ansatz \\hat\\Phi_j = \\xi^{j-J} is the standard characteristic solution to a constant-coefficient difference equation. The citation to [31] does not support the derivation and could be removed or replaced by a direct statement.","section":"Section IIB, Eq. (11)"},{"comment":"The axis label 'Re(9')' appears garbled and should read Re(\\xi) (and similarly for Im(\\xi)).","section":"Figure 1"},{"comment":"There is a typo in 'with a width of \\sigma=1, a wave number of k_0=5, and Aa normalization constant'; it should read 'and A a normalization constant'.","section":"Section III, Eq. (35)"},{"comment":"The word 'numericall' in 'we numericall solve' is a typo and should read 'numerically'.","section":"Section III"}],"recommendation":"major_revision","confidential_remarks":"The semi-discrete TBC derivation appears essentially correct and should be preserved. The main risk is in the fully discrete implementation and the numerical verification, which currently cannot support the paper's strongest claims. The algebraic inconsistency between Eqs. (28)-(31) and (32) must be resolved, the update ordering relative to the Crank-Nicolson solve must be stated precisely, and a quantitative reflection measure should replace the purely visual validation. If those issues are fixed, the paper is likely publishable; the novelty relative to existing discrete TBC literature should also be stated more carefully."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper re-derives a convolution-type transparent boundary condition for the semi-discrete Schrödinger equation and then implements it numerically. The core Laplace-domain derivation is clean: the root selection is right, the Bessel kernel comes out correctly, and the continuum limit, while heuristic, gives the expected fractional-derivative form. The paper is readable and the topic is practically useful for truncating lattice transport simulations.\n\nBut there are three soft spots, and one is load-bearing. First, the main result (15) is already in Hu and Zheng [34], which appears in the reference list but is never cited in the body and is not acknowledged as prior work. The claim that discrete lattice equations have \"largely remained outside the scope\" of exact TBC formulations is simply inaccurate. Second, the discretization section is internally inconsistent. Equation (28) defines I(t) with a factor 1/h, so the correct relation is 2Ψ_J − Ψ_{J−1} = h I(t), not 2Ψ_J − Ψ_{J−1} = I(t) as stated. Equations (30)–(31) then carry a spurious 1/h in the convolution sum, while (32) is the algebraically correct form without it. An implementer cannot tell which scaling the code actually uses. Third, even the consistent equation (32) is at time level n, while the Crank-Nicolson interior solve needs a boundary relation at n+1. The explicit update described in the text therefore lags by a time step, changing the TBC by O(Δt). No stability or reflection analysis is given for this fully discrete coupling.\n\nThe numerical verification does not fix this: it only shows snapshots and a monotonically decaying norm, with no comparison to an infinite-lattice reference and no quantitative reflected-norm measurement. A decaying norm alone does not rule out reflected energy that has not yet re-entered the domain.\n\nSo the paper's strongest claim—that the implemented scheme eliminates backscattering entirely—is not established. The contribution reduces to a re-derivation of a known result plus a flawed discretization recipe. Still, the Laplace derivation is sound, and with honest citation of Hu-Zheng, a corrected discretization, and a proper reflection measure, a revised version could be a small but useful note. As is, I would not cite it.\n\nRecommendation: send to peer review, but the referee should insist on fixing the scaling inconsistency and providing a quantitative reflection test before acceptance.","headline":"The main TBC formula is correct but already known, and the discretization section has a scaling error that makes the numerical claim of zero reflection unverified.","tokens_in":10133,"tokens_out":3972,"would_cite":false,"duration_ms":32901,"reading_group":"maybe","serious_thinker":"no","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["35Q41","65M06","81Q05"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper derives exact transparent boundary conditions for the semi-discrete Schrödinger equation, so truncated lattice simulations can reproduce infinite-lattice transport with zero spurious reflection.","keywords":["transparent boundary conditions","discrete Schrödinger equation","Dirichlet-to-Neumann map","lattice quantum transport","Bessel convolution kernel","Crank-Nicolson scheme","reflectionless wave packet","continuum limit"],"falsifier":"Run the same Gaussian wave-packet experiment on the truncated lattice and on a much larger reference lattice, and compute the $\\ell^2$ difference of the two solutions restricted to $0\\le j\\le J$ over time (or the late-time value of the truncated norm $M(t)$); a difference that fails to converge to zero, or a rise in $M(t)$ after the packet has left, would show the fully discrete scheme reflects.","tokens_in":9054,"feed_emoji":"⚛️","tokens_out":7740,"duration_ms":85301,"temperature":0.7,"pith_summary":"The paper constructs exact transparent boundary conditions for the time-continuous, spatially discrete Schrödinger equation on a one-dimensional lattice, so that a computation restricted to finitely many lattice sites reproduces the infinite-lattice solution until the wave exits. The boundary condition is a convolution of the boundary value with a Bessel-function kernel, obtained by Laplace transforming the exterior problem and selecting the decaying lattice mode. The authors show that in the continuum limit this discrete boundary condition reduces to the known fractional-integral transparent boundary condition for the continuous Schrödinger equation, and they give a trapezoidal-rule discretization for practical use. If the claim is right, simulations of quantum transport in conducting polymers, molecular chains, and other discrete lattices can be truncated without the artificial reflections that plague naive absorbing boundaries.","feed_headline":"Exact boundary conditions let lattice waves exit with zero reflection","feed_subtitle":"A Bessel-kernel boundary map makes truncated simulations match infinite-lattice transport without backscattering.","key_machinery":"The load-bearing object is the Laplace-domain Dirichlet-to-Neumann map, derived from the characteristic equation $\\xi^2-2(1-ih^2s)\\xi+1=0$ whose roots come in reciprocal pairs; choosing the root inside the unit circle encodes outgoing waves. The Bessel Laplace pair $L\\{J_1(at)/t\\}(s)=(-s+\\sqrt{s^2+a^2})/a$ converts the map into the time-domain convolution in Eq. (15). The trapezoidal rule and the limiting kernel value $K(0)=1/(2h^2)$ make the history term computable; this mechanism is what carries the reflectionless claim.","core_discovery":"On the paper's terms, the central discovery is that the exact Dirichlet-to-Neumann map for the semi-discrete lattice equation is available in closed form. Writing the Laplace-transformed exterior solution as $\\hat\\Phi_j(s)=\\xi_+(s)^{j-J}$, with $\\xi_+(s)=1-ih^2s+ih\\sqrt{2is+h^2s^2}$ selected by the decay condition $|\\xi_+|\\le 1$, the boundary condition becomes a convolution in time, $\\frac{1}{h}(\\Psi_J-\\Psi_{J-1})(t)=-\\frac{1}{h}\\Psi_J(t)+\\frac{i}{h}\\int_0^t e^{-i(t-\\tau)/h^2}\\frac{1}{t-\\tau}J_1\\!\\left((t-\\tau)/h^2\\right)\\Psi_J(\\tau)d\\tau$. Because the restriction of the infinite-lattice solution satisfies this relation exactly, the boundary is transparent in the time-continuous problem; the paper further verifies consistency with the continuous TBC as $h\\to 0$ and demonstrates a trapezoidal-rule time discretization implemented with a Crank-Nicolson interior solver.","pith_inferences":["A direct testable extension would compare the truncated solution against a reference solution on a much larger lattice and report the reflected mass as a function of time; the paper's monotone norm decay is suggestive but not a quantitative reflection measurement.","If exactness survives the time discretization only approximately, the residual reflection likely scales with the time step $\\Delta t$; measuring it would turn the boundary condition into a controlled approximation with an error rate.","The same Laplace-plus-Bessel machinery should transfer to other discrete dispersive equations with quadratic dispersion relations, since only the characteristic polynomial changes; this is an editorial extrapolation, not a claim in the paper.","A two-sided version of the boundary map would be needed to study wave packets that reach both ends, since the numerical example uses a homogeneous Dirichlet condition on the left and tests only right-moving transport."],"forward_implications":["A simulation on $0\\le j\\le J$ with these boundary conditions reproduces the infinite-lattice dynamics for compactly supported initial data, so small computational domains can stand in for unbounded lattices.","The same boundary map should work for any right-moving initial data once the left boundary is handled symmetrically, allowing reflectionless transport studies in quasi-1D quantum wires and polymer chains.","In the continuum limit the discrete TBC reduces to the standard fractional-derivative TBC for the continuous Schrödinger equation, giving a consistency bridge between lattice and continuum simulations.","The trapezoidal-rule discretization gives an explicit update for the boundary value that can be combined with implicit interior solvers such as Crank-Nicolson without visible backscattering in the paper's wave-packet tests."],"supporting_citations":[{"why":"Supplies the exact power-form lattice solution that motivates the exponential ansatz in the Laplace domain.","marker":"[31]"},{"why":"Reviews the Laplace-transform procedure for deriving transparent boundary conditions that the paper follows for the discrete problem.","marker":"[10]"},{"why":"Provides the Bessel function small- and large-argument asymptotics used to define $K(0)$ and to pass to the continuum limit.","marker":"[40]"},{"why":"Gives the relation between Riemann-Liouville and Caputo fractional derivatives used to identify the continuum TBC integral.","marker":"[41, 42]"}],"fun_headline_variants":["Exact Bessel-kernel boundaries make 1D lattice waves exit reflectionless","Closed-form TBCs eliminate backscattering in discrete Schrödinger transport","Zero-reflection exit for lattice quantum waves via analytic boundary maps","No spurious backscattering: exact TBCs for 1D lattice Schrödinger equation","Bessel-based exact boundary map kills backscattering in discrete Schrödinger runs"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument assumes that exact transparency proved for the time-continuous boundary condition survives the trapezoidal-rule discretization and the Crank-Nicolson interior update, so that the fully discrete code is still reflectionless.","fun_headline_variants_meta":{"raw":{"variants":["Exact Bessel-kernel boundaries make 1D lattice waves exit reflectionless","Closed-form TBCs eliminate backscattering in discrete Schrödinger transport","Zero-reflection exit for lattice quantum waves via analytic boundary maps","No spurious backscattering: exact TBCs for 1D lattice Schrödinger equation","Bessel-based exact boundary map kills backscattering in discrete Schrödinger runs"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000413,"raw_usage":{"total_tokens":2123,"prompt_tokens":920,"completion_tokens":1203,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":536,"completion_tokens_details":{"reasoning_tokens":1102}},"tokens_in":536,"tokens_out":1203,"duration_ms":10813,"temperature":1.0,"reasoning_tokens":1102,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-08T15:01:07.343695+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the same Gaussian wave-packet experiment on the truncated lattice and on a much larger reference lattice, and compute the $\\ell^2$ difference of the two solutions restricted to $0\\le j\\le J$ over time (or the late-time value of the truncated norm $M(t)$); a difference that fails to converge to zero, or a rise in $M(t)$ after the packet has left, would show the fully discrete scheme reflects.","supporting_citations":[{"cited_title":"Sabirov, J.R","cited_arxiv_id":null,"evidence_quote":"Supplies the exact power-form lattice solution that motivates the exponential ansatz in the Laplace domain."},{"cited_title":"Sofronov, Conditions for complete transparency on the sphere for the three–dimensional wave equation, Russ","cited_arxiv_id":null,"evidence_quote":"Reviews the Laplace-transform procedure for deriving transparent boundary conditions that the paper follows for the discrete problem."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the Bessel function small- and large-argument asymptotics used to define $K(0)$ and to pass to the continuum limit."}],"review_version":1}