{"id":"5f6f77a1-da45-4bdf-b0d0-812a26aac132","arxiv_id":"2608.04844","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"A continuous-time quantum walker on finite Sierpiński carpet lattices is increasingly trapped near its initial corner as fractal order grows, unlike ballistic crossing on a uniform lattice.","lead":"A quantum particle hopping on a Sierpiński carpet-shaped lattice gets increasingly trapped near its starting corner as the carpet is built with more levels, while on a plain square lattice it crosses ballistically. The result suggests that geometry alone, with no disorder, can suppress quantum transport, which is testable in current photonic and cold-atom lattice experiments.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Even accepting the numerics, the paper's own barrier argument predicts a power-law crossing time T ~ D^β, so the finite-time data do not establish the claimed absence of a crossing-time scale.","rationale":"The reader's CONDITIONAL verdict is appropriate, and my concern sharpens rather than moves it. The paper's finite-time numerical observation—corner-to-corner transport on Sierpiński lattices is strongly suppressed relative to uniform lattices, with suppression growing in R—is credible and useful, and the zone-integrated observables are a sensible way to compare different system sizes. The weakness is the asymptotic interpretation: on a finite connected graph there is always a finite crossing time, and the relevant question is how that time scales. Strikingly, the paper's own 'series of reflective barriers' argument, combined with the roughly exponential growth in Fig. 4, implies T_K ~ L^{1+c/ln3}, i.e. a power-law scaling law T~D^β. That is a simple time scaling, not the absence of one. The reader's weakest assumption highlighted the finite-time extrapolation; my concern is more specific and internal: even taking the finite-time data at face value, the proposed mechanism predicts the very kind of scaling law whose existence the central claim denies. The condition should therefore be to quantify the asymptotic growth of T_K and T_F, and if β converges, to soften the claim from 'no characteristic crossing time' to anomalous power-law transport.","tokens_in":9595,"tokens_out":9271,"duration_ms":108333,"concrete_test":"For R=4,5,6, compute the first-crossing time T_F at which the final-zone probability F(t) reaches 1%, using a Krylov-subspace propagator on the sparse Hamiltonian and extending the simulation to at least 10^4 ℏ/J (or until the first clear recurrence); also extract T_K from the same runs. Fit ln T_F versus ln D = R ln3 and ln T_K versus K. If the fitted exponent β stabilizes at a finite value >1, the data affirm a power-law characteristic crossing time, contradicting the 'no crossing time' claim; only if β grows with R, or ln T_F grows faster than linearly in R, is the no-time-scale interpretation supported. Repeat the threshold at 1% and 10% to confirm the 3% threshold is not driving the conclusion.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The demonstrated suppression of transport is credible, but the headline claim that no characteristic crossing time emerges goes beyond the evidence and sits in tension with the paper's own barrier picture. On any finite connected graph the Hamiltonian is a finite Hermitian matrix, so the evolution is quasiperiodic and F(t) cannot remain below a positive threshold forever; the R=5,6 curves only show no crossing up to tJ/ℏ≈10D. More importantly, the authors' own bottleneck argument in Sec. IV and the roughly exponential growth in Fig. 4 imply T_K/(3^K) ≈ e^{cK}, hence T_K ≈ (3e^c)^K = L^{1+c/ln3}, where L=3^K. That is precisely a power-law characteristic time T~D^β, not the absence of a time scale. To support the statement that 'the notion of a crossing time effectively ceases to apply', one must show that β diverges with R or that T grows faster than any power of D (e.g. exponentially in D), not merely that a rescaled escape time grows roughly exponentially in K. Thus the central claim currently rests on interpreting an unquantified finite-time trend as a qualitative change of dynamical character.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript studies continuous-time quantum walks on finite approximations of the Sierpiński carpet up to fractal order R=6, comparing zone-integrated corner probabilities with those on a uniform square lattice. It reports that, unlike the ballistic crossing on the uniform lattice, the particle becomes increasingly confined to its initial corner zone as R grows, and it interprets the growth of the rescaled escape time T_K J/(ℏ3^K) with zone range K as evidence that no characteristic crossing time emerges. The paper proposes a qualitative bottleneck picture in which narrow necks act as weakly reflecting barriers at each hierarchical level.","tokens_in":9758,"tokens_out":3919,"duration_ms":46841,"significance":"Demonstrated, if correct, the result is valuable: it provides a clean, disorder-free geometric mechanism for transport suppression in a self-similar lattice, with feasible experimental realizations in photonic and cold-atom platforms. The paper's strengths include a clearly defined hierarchy of zones, a uniform-lattice control, and public availability of numerical data. However, the headline claim that 'the notion of a crossing time effectively ceases to apply' goes beyond the numerical evidence and should be replaced by a quantitative scaling statement.","major_comments":[{"comment":"The central claim that no characteristic crossing time emerges is not supported by the data. The simulations run only up to tJ/ℏ = 10·3^R for R ≤ 6, and on a finite connected graph the unitary evolution is quasiperiodic, so the absence of a crossing within the simulated window cannot establish the absence of a crossing time. Moreover, the paper's own bottleneck argument and Fig. 4 imply a specific crossing-time scaling: if T_K J/(ℏ3^K) ≈ e^{cK}, then T_R ≈ (3 e^c)^R = D^{1+c/ln 3}, which is a power law in D, not the absence of a time scale. To support the conclusion, the authors should either fit the scaling, test whether the exponent grows with R, or reformulate the conclusion as finite-time suppression rather than loss of a time scale.","section":"Sec. VI and Sec. IV, Fig. 4"},{"comment":"The escape time T_K depends on an ad hoc 3% threshold, and no tests of threshold sensitivity are reported. The 'roughly exponential' growth is asserted visually; no fit, no error bars, and no R-dependence beyond R=6 are given. Since this growth is the quantitative basis for the 'no crossing-time scale' claim, the authors should provide a quantitative fit, threshold-dependence checks, and ideally multiple R values.","section":"Sec. V, Fig. 4"},{"comment":"The numerical solutions are obtained with fourth-order Runge-Kutta, but no convergence checks, time-step choices, or error estimates are reported. Because the trapping claim relies on S(t) remaining close to unity over long simulated intervals, small integration errors could matter; please include error estimates or a unitarity check.","section":"Sec. III and Figs. 2–4"}],"minor_comments":[{"comment":"The time axes are rescaled by a factor of 3 between consecutive fractal orders, but this scaling is described only in the text; a caption note or axis label would improve readability.","section":"Figs. 2 and 3"},{"comment":"The phrase 'for all practical purposes' is not quantified; please specify what practical threshold is meant, for example a fixed upper bound on F(t) over the simulated time window.","section":"Sec. VI"},{"comment":"The statement that the overall transmission decreases 'roughly exponentially with the number of barriers' is qualitative; a short derivation or at least a precise statement of the assumed scaling would make the bottleneck picture more testable.","section":"Sec. IV"}],"recommendation":"major_revision","confidential_remarks":"The paper is within the scope of quant-ph and presents a potentially interesting numerical observation. The main work needed is to bring the conclusions in line with the evidence: the finite-time data support progressively stronger trapping, but they do not support the claim that no characteristic crossing time exists. I would be willing to review a revised version."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the paper gives a clean numerical demonstration that Sierpiński carpet lattices increasingly trap a continuous-time quantum walker near its starting corner, and the hierarchy of corner zones is a genuinely new way to see the effect scale by scale. But the headline claim that \"no characteristic crossing time emerges\" and that the notion of a crossing time \"effectively ceases to apply\" is not supported by the evidence, and sits in tension with the paper's own barrier argument.\n\nWhat's new: Darázs et al. and van Veen et al. already reported suppressed transport on Sierpiński carpets, so pure trapping isn't the novelty. The new piece is the zone hierarchy: defining initial zones of edge 3^K and showing that the rescaled escape time T_K J/(ℏ3^K) keeps growing with K. That is a scale-by-scale characterization, and it makes the trapping trend much more tangible. The uniform-lattice control is appropriate, and the Zenodo data statement is a plus.\n\nThe soft spots, in order of severity. First, the asymptotic claim. On any finite connected graph the evolution is quasiperiodic, so F(t) will eventually cross any positive threshold; the R=5 and R=6 curves only show \"no crossing\" up to tJ/ℏ ≈ 10D. More importantly, the paper's own bottleneck picture says transmission drops roughly exponentially with the number of barriers, which would make T_K grow roughly exponentially in K. That gives T_K ~ (3 e^c)^K = D^{1+c/ln3}, a power-law crossing time in D, not an absence of a time scale. So \"no such characteristic crossing time emerges\" overstates what the numerics show. The authors should either soften it to \"no crossing observed within our simulation window\" or quantify the scaling and say explicitly that it is consistent with a power law, possibly with a diverging exponent. Second, the 3% threshold for the escape time is arbitrary; checking 1% or 10% would tell whether the scaling is an artifact. Third, there are no error bars or convergence checks for the RK4 integration. For R=6 the Hilbert space is 8^6 ≈ 262k sites; reporting the time step and validating one case against a smaller step is cheap and should be done.\n\nThe core numerical result—the qualitative trend and the new zone-hierarchy observable—is solid and worth publishing. The conclusion section goes beyond it. This is a fixable overclaim.\n\nWho this is for: anyone working on transport in fractal lattices, continuous-time quantum walks, or the Sierpiński carpet specifically. It will be a useful contribution once the asymptotic language is tightened and the numerics are documented. Recommendation: deserves a serious referee. I would send it out and ask for revision addressing the crossing-time scaling and numerical robustness; that is a minor-to-moderate revision, not a rejection.","headline":"Useful zone-hierarchy numerics that clearly show the trapping trend, but the 'no crossing time' claim outruns the evidence and actually contradicts the paper's own barrier picture.","tokens_in":10344,"tokens_out":3559,"would_cite":true,"duration_ms":38316,"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":"On a Sierpiński carpet lattice, a continuous-time quantum walker starting at a corner becomes increasingly trapped there as the fractal order grows, so that no well-defined crossing time emerges for moderate orders.","keywords":["quantum walk","continuous-time quantum walk","Sierpiński carpet","fractal lattice","trapping","transport suppression","self-similarity"],"falsifier":"Run the same continuous-time evolution for $R=7$ and $R=8$, or extend the time window well beyond $10\\cdot 3^R$; if the particle reaches the opposite zone in a time that grows only polynomially with $R$, the claim that no crossing time emerges would overstate. Alternatively, compute the eigenstates of the finite carpet Hamiltonian: if no eigenstate has significant weight near the initial corner, the trapping is a finite-time dynamical effect that would eventually be undone on longer times.","tokens_in":9316,"feed_emoji":"🌀","tokens_out":12349,"duration_ms":91543,"temperature":0.7,"pith_summary":"This paper studies a single quantum particle hopping on a finite Sierpiński carpet lattice and claims that, unlike on a uniform square lattice, the particle does not ballistically cross to the opposite corner as the fractal order grows. For $R \\ge 3$ the zone-integrated probability of staying in the initial corner zone stays close to unity, while the probability of reaching the opposite corner zone remains near zero over the whole simulated evolution, and for $R=5,6$ the particle effectively never leaves the initial zone within the simulated time. The trapping is not a simple slowdown: the rescaled escape time $T_K J/(\\hbar 3^K)$ grows roughly exponentially with the zone order $K$, instead of saturating as it does on the uniform lattice, so no characteristic crossing time emerges. If the claim is right, lattice geometry alone, without disorder, suppresses quantum transport in a self-similar, scale-by-scale manner.","feed_headline":"Fractal geometry alone traps a quantum walker at the corner","feed_subtitle":"Ballistic crossing vanishes on the Sierpiński carpet; trapping builds up scale by scale.","key_machinery":"The central objects are the finite Sierpiński carpet lattices, built by recursively deleting the middle ninth of each square so that $N=8^R$ sites remain at order $R$, and the zone-integrated probabilities $S(t)=\\sum_{\\vec{r}\\in Z_{\\mathrm{INI}}}|\\langle\\vec{r}|\\psi(t)\\rangle|^2$ and $F(t)$ defined analogously for the opposite corner zone $Z_{\\mathrm{FIN}}$; these coarse-grained observables make lattices of different sizes comparable. The scale-dependence analysis uses the hierarchy of self-similar corner zones $Z^K_{\\mathrm{INI}}$ of edge size $3^K$, with escape times $T_K$ defined as the first instant at which the probability outside the $K$-order zone exceeds $3\\%$. The explanatory mechanism is the bottleneck picture: every path between opposite corners must pass through single rows or columns of sites bordering removed squares, and because such necks occur at every hierarchical level, the accumulated transmission is expected to decrease roughly exponentially with $R$.","core_discovery":"On a finite Sierpiński lattice of fractal order $R$ — constructed from a uniform square lattice of edge $D=3^R$ by recursively removing the middle square of each block, leaving $N=8^R$ sites — a continuous-time quantum walker initialized at the corner $\\vec{r}_0=(1,1)$ becomes progressively trapped near that corner as $R$ increases. The zone-integrated probabilities $S(t)$ and $F(t)$ for the initial and opposite corner zones (each one of the nine squares of the first construction level) show that the particle never reaches the opposite zone within the simulated time for moderate orders, while on a uniform lattice it arrives ballistically in time $T_U \\approx 2\\hbar D/3J$. The paper shows that the confinement builds up self-similarly across the hierarchy of corner zones of edge size $3^K$: the rescaled escape time $T_K J/(\\hbar 3^K)$ keeps growing roughly exponentially with $K$, in contrast to the flat behavior on the uniform lattice. The dynamics therefore does not become a slowed-down version of ballistic transport; for sufficiently large $R$ the notion of a well-defined crossing time effectively ceases to apply, with the suppression attributed to narrow necks at every length scale acting as a series of partial barriers.","pith_inferences":["A testable quantitative prediction implied by the bottleneck picture but not computed in the paper is that the crossing probability $F(t)$ at the uniform-lattice crossing time $T_U$ should decay roughly exponentially with $R$; this could be checked from the data for $R=2,\\ldots,6$.","The same hierarchy of zone observables could be measured in photonic waveguide arrays or cold-atom lattices shaped as Sierpiński carpets, where the retention of probability in corner zones would appear as an intensity pattern concentrated near the initial region.","If the spectrum of the finite carpet Hamiltonian turns out to have no localized eigenstates near the corner, the trapping is purely dynamical and would be reversed only on exponentially long times; if localized eigenstates exist, the trapping could persist in the long-time limit.","Extending the analysis to discrete-time quantum walks, which add a coin degree of freedom, could modify or suppress the trapping and would clarify how robust the effect is to the choice of walk dynamics."],"forward_implications":["For fractal order $R \\ge 3$, the probability $F(t)$ of finding the particle in the opposite corner zone is suppressed compared with the uniform lattice, and for $R=5,6$ the particle stays in the initial zone within the simulated time window.","The escape time from a corner zone does not scale with the zone size on the Sierpiński lattice: $T_K J/(\\hbar 3^K)$ grows roughly exponentially with $K$, whereas on the uniform lattice it saturates to a constant.","No characteristic crossing time exists for large $R$; the transport changes character rather than merely slowing down.","The suppression is purely geometric and deterministic, coming from the hierarchical bottlenecks of the lattice rather than from disorder or from removed site-to-site links.","The hierarchy of zone probabilities $S_K(t)$ shows the trapping builds up progressively: small zones are emptied and refilled, while larger zones retain probability increasingly effectively with $K$."],"supporting_citations":[{"why":"It defines the Sierpiński carpet construction on which the paper's lattices are based.","marker":"[40]"},{"why":"It reports trapping and suppressed conductance in continuous-time quantum walks on Sierpinski fractals, providing the baseline the paper builds on.","marker":"[35]"},{"why":"It studies quantum transport in Sierpinski carpets and shows suppressed conductance, serving as a key comparison for the trapping claim.","marker":"[37]"},{"why":"It reports super-diffusive transport on fractal lattices and shows sensitivity to lattice construction, giving the alternative picture the paper contrasts with.","marker":"[38]"},{"why":"It reports geometry-induced electron trapping on other fractal lattices, supporting the generality of the trapping mechanism.","marker":"[39]"},{"why":"It demonstrates quantum transport in fractal networks experimentally, motivating the experimental relevance of the predicted trapping.","marker":"[22]"}],"fun_headline_variants":["Fractal geometry alone cages a quantum walker","Sierpiński carpet stops quantum walker mid-step","Quantum walker confined by self-similar fractal barriers","Fractal lattice traps quantum walker at its corner"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the finite-time numerical evolution, run up to $tJ/\\hbar = 10\\cdot 3^R$ for $R \\le 6$, reveals the asymptotic transport character, so that failing to reach the opposite zone within the simulated window is interpreted as trapping and as the loss of a well-defined crossing-time scale.","fun_headline_variants_meta":{"raw":{"variants":["Fractal geometry alone cages a quantum walker","Sierpiński carpet stops quantum walker mid-step","Quantum walker confined by self-similar fractal barriers","Fractal lattice traps quantum walker at its corner"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000345,"raw_usage":{"total_tokens":1888,"prompt_tokens":937,"completion_tokens":951,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":553,"completion_tokens_details":{"reasoning_tokens":886}},"tokens_in":553,"tokens_out":951,"duration_ms":10686,"temperature":1.0,"reasoning_tokens":886,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T15:08:04.951609+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the same continuous-time evolution for $R=7$ and $R=8$, or extend the time window well beyond $10\\cdot 3^R$; if the particle reaches the opposite zone in a time that grows only polynomially with $R$, the claim that no crossing time emerges would overstate. Alternatively, compute the eigenstates of the finite carpet Hamiltonian: if no eigenstate has significant weight near the initial corner, the trapping is a finite-time dynamical effect that would eventually be undone on longer times.","supporting_citations":[{"cited_title":"Sur une courbe cantorienne qui con- tient une image biunivoque et continue de toute courbe donn´ee,","cited_arxiv_id":null,"evidence_quote":"It defines the Sierpiński carpet construction on which the paper's lattices are based."},{"cited_title":"Transport prop- erties of continuous-time quantum walks on sierpinski fractals,","cited_arxiv_id":null,"evidence_quote":"It reports trapping and suppressed conductance in continuous-time quantum walks on Sierpinski fractals, providing the baseline the paper builds on."},{"cited_title":"Quantum transport in Sierpinski carpets,","cited_arxiv_id":null,"evidence_quote":"It studies quantum transport in Sierpinski carpets and shows suppressed conductance, serving as a key comparison for the trapping claim."},{"cited_title":"Anomalous quan- tum transport in fractal lattices,","cited_arxiv_id":null,"evidence_quote":"It reports super-diffusive transport on fractal lattices and shows sensitivity to lattice construction, giving the alternative picture the paper contrasts with."},{"cited_title":"Aharonov-bohm caging and electron trapping in snowflake-like fractal lattices,","cited_arxiv_id":null,"evidence_quote":"It reports geometry-induced electron trapping on other fractal lattices, supporting the generality of the trapping mechanism."},{"cited_title":"Quantum transport in fractal networks,","cited_arxiv_id":null,"evidence_quote":"It demonstrates quantum transport in fractal networks experimentally, motivating the experimental relevance of the predicted trapping."}],"review_version":1}