{"id":"d13d0a65-2bec-4708-b642-0296d82d196e","arxiv_id":"2501.06765","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"A new quantum walk model that depends on surface embeddings yields a face-decomposed scattering matrix and a comfortability formula ranking embeddings by genus.","lead":"This paper constructs a discrete-time quantum walk on a graph embedded in a closed surface, with dynamics that depend on the surface embedding. It derives a scattering matrix decomposed by faces and a 'comfortability' measure that ranks embeddings, finding that smaller genus is generally more comfortable.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorems 7.1 and 1.2 carry a spurious factor 2 in the first term of the comfortability formula; the a=0 limit contradicts Proposition 7.2.","rationale":"The reader's identified weakest assumption was the external convergence result Proposition 4.2. That is a legitimate foundational dependency, but the more load-bearing concern is internal: the proof of Theorem 7.1, via Proposition 7.2 and the trace computation, yields a factor of 2 in the first term that differs from the printed theorem statements. This affects the central formula (1.1) and the quantitative content of Corollary 2.1. The error is concrete, checkable, and not merely a matter of citation. I therefore recommend keeping a CONDITIONAL verdict, but for a different reason than the reader's: the paper must correct the normalization factor in Theorems 7.1 and 1.2 and update Corollary 2.1 accordingly. I disagree with the reader's choice of weakest assumption because the internal inconsistency is more immediate and more directly tied to the main claim.","tokens_in":26139,"tokens_out":33826,"duration_ms":294942,"concrete_test":"Recompute the a=0 limit of Theorem 7.1: set a=0, d=0, |b|=|c|=1, and solve the stationary-state local equations for a single tail input; the internal quay, bridge, and second quay amplitudes are each of unit modulus, so E = 3/2. Then evaluate the printed first term of Theorem 7.1 at a=0, which gives 3. Alternatively, re-derive the coefficient of tr(QQ*) in (7.42) from Proposition 7.2 using the unitarity relations d^2=a^2 and |c|^2=|b|^2; if the coefficient is (2+|b|^2)/(2|bc|^2), then after substituting (7.46) the printed factor (2+|b|^2)/|b|^2 is too large by a factor of 2.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central formula (1.1) is internally inconsistent with Proposition 7.2. Proposition 7.2 states E = (1/|c|^2)||Qα||^2 + (1/(2|bc|^2))||(σ+dI)Qα||^2. Averaging over uniformly random single-tail inputs and using (σ+dI)^*(σ+dI) = (1+d^2)I + 2dσ gives E[E] = (1/N)[(1/|c|^2 + (1+d^2)/(2|b|^2|c|^2)) tr(QQ*) + d/(|b|^2|c|^2) tr(σQQ*)]. Under Assumption 1 with a,d real, unitarity forces d^2=a^2 and |c|^2=|b|^2, so the coefficient of tr(QQ*) is (2+|b|^2)/(2|b|^2|c|^2). Since (7.46) gives tr(QQ*) = |b|^2 Σ, the first term of E[E] is (1/N)(2+|b|^2)/(2|b|^2) Σ. Theorems 7.1 and 1.2 print (1/N)(2+|b|^2)/|b|^2 Σ, exactly twice as large. In the a=0 limit the printed formula yields E[E]=3, whereas Proposition 7.2 and a direct solve of the a=0 local equations (quay amplitude 1, bridge amplitude c, second quay amplitude bc, giving E=1/2(1+1+1)=3/2) yield 3/2. Consequently Corollary 2.1's δ^{-2} coefficient should be halved: (1/(2|E|))(|F| - Σ_f |f∩fbar|/|f|) rather than (1/|E|)(|F| - Σ_f |f∩fbar|/|f|). The qualitative best/worst rankings survive, but the main quantitative theorem is incorrect as stated.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper constructs a discrete-time quantum walk on the double cover and blow-up of a graph embedded in a closed surface, with semi-infinite tails attached at every island arc (the hedgehog assignment). The time evolution is governed by a local 2x2 unitary coin C, and the scattering matrix S for incoming tail amplitudes is shown to decompose as a direct sum over facial walks of the rotation system. The paper then defines 'comfortability' as half the squared norm of the stationary state restricted to the internal graph, and its main quantitative result, Theorem 1.2, gives the average comfortability over uniformly random single-tail inputs in terms of face lengths and self-intersections. Corollary 2.1 extracts a delta^{-2} coefficient as the coin parameter a approaches 1, yielding genus-based rankings of embeddings, including explicit best and worst embeddings of complete graphs.","tokens_in":26628,"tokens_out":24733,"duration_ms":201944,"significance":"The model construction is original and carefully executed: the blow-up into degree-2 islands and bridges, the hedgehog tail assignment, and the facial-walk factorization of the scattering matrix are appealing and appear to be the correct framework for encoding embedding data in quantum-walk scattering. The orientability detection criterion in Theorem 6.2 is a nice concrete consequence, and the combinatorial corollaries are interesting. However, the central quantitative theorem contains a factor-2 error in its first term, so Theorem 1.2 as stated is incorrect. The qualitative rankings appear to survive because the erroneous factor is common for a fixed graph, but the main formula, the a=0 limit, and Corollary 2.1 need correction.","major_comments":[{"comment":"The existence and uniqueness of the stationary state Psi_infty and of the scattering matrix S is imported from reference [10] without stating the precise hypotheses. Since the comfortability formula in Theorem 1.2 is computed entirely from Psi_infty, this is a load-bearing point. The authors should state the exact conditions from [10] under which the long-time limit exists for the present infinite graph with hedgehog tails and local coin C, and verify explicitly that those conditions are satisfied here.","section":"Section 4.4, Proposition 4.2"}],"minor_comments":[{"comment":"There are several typographical issues: 'eovlution' in Definition 4.3, 'Eular' for Euler, 'orientablility' and 'comfortablity' in the abstract, and 'interactions' instead of 'self-intersections' in the proof of Corollary 2.2. These should be fixed in revision.","section":"Various"}],"recommendation":"major_revision","confidential_remarks":"The factor-2 discrepancy is verifiable directly from equations (7.42) and (7.46); it is a genuine error in the central formula, but it is local and fixable, and the qualitative combinatorial rankings appear to survive. I would not reject on this basis. The other concern is the unstated applicability of the convergence theorem from [10]; this should be made explicit in revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nThe paper gives a new discrete-time quantum walk model that actually sees the embedding of a graph on a closed surface, via a double cover and a blow-up with degree-2 vertices. The scattering matrix result (Theorem 6.1/1.1) is the strongest part: the scattering matrix is a direct sum of face-wise unitary matrices with simple circulant-like weights. That is a genuine structural insight, and the orientability test from the phases of scattering elements is elegant. The combinatorial application—best/worst embeddings of K_n—is a nice payoff.\n\nThe soft spots are real but localized. The average comfortability formula has a factor-2 error. Deriving from Proposition 7.2 and (7.46) gives the first-term coefficient (2+|b|^2)/(2|c|^2), not (2+|b|^2)/|b|^2 (and |c|^2=|b|^2 under the assumptions). So Theorem 7.1, Theorem 1.2, and Corollary 2.1 are off by a factor of two. A direct check: the a=0 limit of the printed formula gives 3, while a solve of the local equations for one inflow gives 3/2. The qualitative ranking from Corollary 2.1 survives because the factor is global, but the quantitative statement is wrong.\n\nThere's also a separate inconsistency in the 'single-face embedding has comfortability 0' remark. In (2.2), for a single face on an orientable surface, |f∩fbar| = |E| and |f|=2|E|, so the bracket is 1/2, not 0. The claim would only be possible with a different counting of self-intersections.\n\nA third issue: the stationary state and scattering matrix rely on Proposition 4.2 cited from the authors' prior work [10], and the present paper does not restate the exact convergence conditions. That's a minor concern—the model is a generalization of [12], so the citation is not circular—but it makes the proof conditional.\n\nThese are all corrigible. The model, the scattering decomposition, and the orientability detection are new and worth taking seriously. The paper should be refereed, with a request to fix the algebra and clarify the convergence assumptions. The corrected version would be a solid contribution to quantum walk theory and topological graph theory.","headline":"Factor-2 error in the average comfortability formula and a flawed single-face claim, but the scattering decomposition and embedding-sensitive model are genuinely new and deserve refereeing.","tokens_in":27098,"tokens_out":13775,"would_cite":true,"duration_ms":107974,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C10","05C50","81P68"],"pacs":[],"model":"deepseek-v4-flash","headline":"Quantum walks can distinguish different surface embeddings of the same graph, and a quantum walker feels more comfortable on embeddings of smaller genus.","keywords":["discrete-time quantum walk","graph embedding on closed surfaces","rotation system","stationary state","scattering matrix","comfortability","orientability","facial walks"],"falsifier":"Simulate the time evolution numerically for the two K4 embeddings on the torus and the Klein bottle compared in Figure 4, using a = 0.98 and hedgehog tails: the formula predicts the Klein-bottle embedding has the higher average comfortability because its octagonal face has one self-intersection rather than two, so a reversal of that ranking would falsify the face formula.","tokens_in":25930,"feed_emoji":"🧭","tokens_out":10682,"duration_ms":167925,"temperature":0.7,"pith_summary":"The paper constructs a discrete-time quantum walk whose transition weights depend on the surface embedding of a graph, via the rotation system used to draw the graph on an orientable or non-orientable closed surface. For a walker driven by a constant random inflow through semi-infinite tails, the long-time stationary state produces a scattering matrix that decomposes face by face; the square norm of the stationary state on the graph interior, called the comfortability, is then computed in closed form. The central result is an exact formula for the average comfortability under a random single-tail input, whose leading term in the near-staying limit is $|F|/|E|$ corrected by face self-intersections. A quantum walker therefore feels more comfortable on embeddings with smaller genus, and the scattering data also detect whether the surface is orientable.","feed_headline":"Quantum walker comfortability exposes graph-surface embeddings","feed_subtitle":"A scattering formula ties the walker's stationary state to face counts and self-intersections, and detects orientability.","key_machinery":"The essential construction is the rotation system $(G,\\rho,\\tau)$ of the embedding, converted into a degree-2 quantum-walk graph by taking a double cover with front and back sheets, replacing each vertex by a directed cycle called an island, connecting islands by bridges, and attaching semi-infinite tails in the hedgehog assignment. The local time evolution at each degree-2 vertex is governed by a single $2\\times 2$ unitary coin $C$. The facial walks $f$ of the rotation system define weighted permutation matrices $P_f$, and these organize the scattering matrix into face blocks and the comfortability sum into face contributions.","core_discovery":"The paper claims that the average comfortability of a quantum walker on an embedded graph has a closed form controlled entirely by the embedding's face structure. Under Assumption 1 (hedgehog tails, $d$ real, $a>0$, $\\omega=1$), Theorem 1.2 gives $$\\mathbb{E}[\\mathcal{E}] = \\frac{1}{|A|}\\frac{2+|b|^2}{|b|^2}\\sum_{f\\in F}|f|\\frac{1+$a^{{|f|}}$}{1-$a^{{|f|}}$} - \\frac{1}{|A|}\\frac{a}{|b|^2}\\sum_{f\\in F}\\frac{1}{1-$a^{{|f|}}$}\\sum_{e\\in f\\cap \\bar f}\\left($a^{{\\mathrm{dist}}$_f(e,\\bar e)}+$a^{{\\mathrm{dist}}$_f(\\bar e,e)}\\right),$$ where $f\\cap \\bar f$ counts the self-intersections of the facial walk $f$. In the near-staying limit $a=1-\\delta$, Corollary 2.1 yields $$\\lim_{\\delta\\downarrow 0}\\$delta^{2}$\\mathbb{E}[\\mathcal{E}_\\delta] = \\frac{|F|}{|E|}\\left(1-\\frac{1}{|F|}\\sum_{f\\in F}\\frac{|f\\cap \\bar f|}{|f|}\\right).$$ The same framework proves that the scattering matrix decomposes as $S=\\bigoplus_{f\\in F}S_f$ with $S_f=bc\\omega P_f(I-a\\omega P_f)^{-1}+dI_f$, and that the phases of non-zero entries of submatrices of $S$ between islands detect orientability.","pith_inferences":["One could probe individual blocks $S_f$ by feeding tailored inputs that excite a single facial walk, recovering the face length and self-intersection count directly from the response; the paper works only with the averaged uniform-input quantity.","The divergence of $\\mathcal{E}$ as $a\\to 1$ suggests that normalizing $\\delta^2\\mathcal{E}$ extracts a finite per-embedding coefficient; whether that coefficient is a topological invariant under other input ensembles is left open.","Because $|b|^2=1-a^2$, tuning the coin weights changes the relative size of the face term and the self-intersection penalty, which could amplify one geometric signal over another in an experiment."],"forward_implications":["The scattering matrix $S$ is block-diagonal with one unitary block per face, so outflow data from the tails can be read face by face.","Orientability of the underlying surface can be decided from the invariance of phases of non-zero scattering entries between two islands, without prior knowledge of the embedding.","In the $a\\to 1$ limit, the average comfortability ranking is governed by $|F|/|E|$ minus the mean self-intersection ratio, so embeddings with more, shorter, and self-intersection-free faces are more comfortable.","For the complete graph $K_n$, the best and worst embeddings for a quantum walker coincide with the minimal- and maximal-genus embeddings classified by known genus formulas.","If a triangulation exists among the embeddings of a graph, it is the best embedding."],"supporting_citations":[{"why":"Supplies the existence of the long-time stationary state and the unitary, inflow-independent scattering matrix S on which the comfortability formula is built.","marker":"[10]"},{"why":"Provides the rotation-system formalism for two-cell embeddings, facial walks, and the Euler-genus formulas used throughout.","marker":"[7]"},{"why":"Gives the standard treatment of graph embeddings on surfaces, facial walks, and the edge-twisted surgery used to compare best and worst embeddings.","marker":"[18]"},{"why":"Introduces the predecessor quantum walk on orientable embeddings that this paper extends to non-orientable surfaces.","marker":"[12]"},{"why":"Supplies the minimal genus of K_n used to identify the best embeddings in Corollary 2.2.","marker":"[22]"},{"why":"Supplies the maximal genus of K_n on orientable surfaces used to identify the worst embeddings in Corollary 2.2.","marker":"[20]"},{"why":"Motivates the degree-2 blow-up construction as implementable with optical polarizing elements.","marker":"[17]"}],"fun_headline_variants":["Facial self-intersections shape quantum walker comfort","Quantum walk comfortability: a formula from face structure","Scattering matrix detects orientability; comfortability reveals faces","Near-staying limit links comfortability to facial walk counts","Quantum walkers feel more comfortable on low-genus surfaces"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The paper relies on an earlier theorem guaranteeing that the walk reaches a unique long-time fixed state and that the scattering matrix is independent of the incoming wave; if that convergence fails for this model, the comfortability formula has no foundation.","fun_headline_variants_meta":{"raw":{"variants":["Facial self-intersections shape quantum walker comfort","Quantum walk comfortability: a formula from face structure","Scattering matrix detects orientability; comfortability reveals faces","Near-staying limit links comfortability to facial walk counts","Quantum walkers feel more comfortable on low-genus surfaces"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001219,"raw_usage":{"total_tokens":5058,"prompt_tokens":1035,"completion_tokens":4023,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":651,"completion_tokens_details":{"reasoning_tokens":3943}},"tokens_in":651,"tokens_out":4023,"duration_ms":33773,"temperature":1.0,"reasoning_tokens":3943,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T20:49:53.061413+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Simulate the time evolution numerically for the two K4 embeddings on the torus and the Klein bottle compared in Figure 4, using a = 0.98 and hedgehog tails: the formula predicts the Klein-bottle embedding has the higher average comfortability because its octagonal face has one self-intersection rather than two, so a reversal of that ranking would falsify the face formula.","supporting_citations":[{"cited_title":"and Segawa, E., Dynamical system induced by quantum walks, Journal of Physics A: Mathematical and Theoretical 52 (2019) 39520","cited_arxiv_id":null,"evidence_quote":"Supplies the existence of the long-time stationary state and the unitary, inflow-independent scattering matrix S on which the comfortability formula is built."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the rotation-system formalism for two-cell embeddings, facial walks, and the Euler-genus formulas used throughout."},{"cited_title":"and Thomassen, C., Graphs on Surfaces, Johns Hopkins University Press (2001)","cited_arxiv_id":null,"evidence_quote":"Gives the standard treatment of graph embeddings on surfaces, facial walks, and the edge-twisted surgery used to compare best and worst embeddings."},{"cited_title":"Quantum walks on graphs embedded in orientable surfaces","cited_arxiv_id":"2402.00360","evidence_quote":"Introduces the predecessor quantum walk on orientable embeddings that this paper extends to non-orientable surfaces."},{"cited_title":"and Youngs, J","cited_arxiv_id":null,"evidence_quote":"Supplies the minimal genus of K_n used to identify the best embeddings in Corollary 2.2."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the maximal genus of K_n on orientable surfaces used to identify the worst embeddings in Corollary 2.2."},{"cited_title":"and Segawa E., Implementation of a discrete-time quantum walk with a circulant matrix on a graph by optical polarizing elements, Physical Review A 106 (2022) 022402","cited_arxiv_id":null,"evidence_quote":"Motivates the degree-2 blow-up construction as implementable with optical polarizing elements."}],"review_version":1}