Abstract Continuous-time quantum walks on dynamic graphs are generated by an ordered sequence of Hamiltonians. Replacing that sequence by one average Hamiltonian can simplify analysis and control, but it may change the transported quantum state. We study this replacement in the single-excitation sector for sequential, undirected edge couplings. Nonzero edge Hamiltonians commute precisely when their edges coincide or are vertex-disjoint, giving a pulse-independent exact reduction for schedules supported on a matching. For general schedules, we derive a nonperturbative spectral-norm bound between the ordered unitary and the exponential of the integrated Hamiltonian. In the edge model, the bound becomes a weighted count of temporal wedges—pairs of distinct event edges meeting at one vertex—and is computable in expected linear time. The same certificate controls state-transfer amplitudes and probabilities, process fidelity, average gate fidelity, and sensitivity to event reordering. A weak-pulse expansion shows that its quadratic scaling is generally sharp. An exact three-vertex calculation and reproducible numerical tests illustrate when the certificate is informative and when cancellation makes it conservative. The result is a directly checkable sufficient condition for replacing a dynamic quantum walk by its weighted aggregate.
Routing unknown quantum information across distributed communication networks requires autonomous, measurement-free mechanisms to prevent wave-function collapse. Szegedy quantum walks provide a mechanism for spatial state transport. The conventional walks on unweighted graphs suffer from severe back-reflection, spatial dispersion, and channel crosstalk. In this paper, we introduce a deterministic topological quantum routing architecture based on coined Szegedy quantum walks on edge-duplicated signed graphs. By treating edge signs as localized phase shifts within a balanced coin reflection, we enforce an exact zero back-scattering condition across routing nodes. We demonstrate deterministic Perfect State Transfer (PST) with unit fidelity at exact arrival times across fundamental archetypes, including the signed dumbbell switch
D2m,0,2n and scalable glued binary trees. Furthermore, we analyse routing performance under realistic open-system amplitude and phase damping noise channels.
We develop a systematic framework for quantum mechanics on a finite graph-resolved class of second-countable, T1, non-Hausdorff one-manifolds. The central problem is that local differential expressions do not by themselves determine the quantum theory: non-Hausdorff incidence, bundle transport, smooth extension, and analytic completion can impose additional global constraints on the operator domain. We formulate these constraints using transported jets, Whitney realisability, Sobolev traces, and formal return holonomy, obtaining exact closure results for finite smooth graph resolutions.
At first Sobolev order, scalar dynamics reduce to a weighted quantum graph whose edge weights arise from a marked resolving presentation, leading naturally to weighted Kirchhoff Hamiltonians. Multiple-origin lines and circles, branching junctions, finite trees, and split-and-rejoin geometries then yield explicit deficiency indices, reflection and transmission laws, interference conditions, compact dark states, and embedded cavity modes.
For finite-rank Hermitian bundles, unitary gluing selects a transmitting fixed subspace, so scattering becomes projection onto the invariant sector of the subgroup generated by the gluing matrices. Compact-group representations therefore turn non-Hausdorff incidence into an invariant-sector selection mechanism; connected compact semisimple groups require at most two relative gluing matrices for full invariant completion, with explicit SU(3) examples.
The resulting theory separates topological non-Hausdorff data from the analytic and representation-theoretic structures that remain detectable by quantum dynamics.
Abstract Continuous-time quantum walks (CTQWs) provide a versatile framework for exploring quantum transport on graphs. In this work, we investigate how the introduction of edge-weight modulation at a single vertex can suppress its occupation probability. We show that when the edges connected to the root vertex are enhanced by a factor J , the probability of detecting the walker at this vertex decays as
1/J2 1 / J 2 , provided the initial state has no components on the vertex itself or its nearest neighbors. We derive the full eigenvalue and eigenvector structure of this system, revealing that the suppression arises from the decoupling of two symmetric line subgraphs and the destructive interference of higher-order contributions. The analysis is extended to tree graphs, where we demonstrate the same scaling behavior and identify the role of local graph geometry in controlling vertex probabilities. These results suggest edge-weight modulation as a mechanism for manipulating transport pathways in CTQWs, with potential applications in quantum information transfer and state engineering, and may serve as a probe of decoherence effects in open quantum systems.
This deposit contains the manuscript and the three analysis scripts (with outputs and SHA-256 hashes) for Part III of the SFIT Stochastic-Braid Substrate series. The paper separates three objects that are often conflated in attempts to obtain quantum measurement statistics from a classical substrate: (i) the substrate configuration (positions, velocities, helicities of the Part I defects), (ii) the channel population
xk≥0,
∑kxk=1, and (iii) the record probability
P(k), i.e. the probability that a physical record names channel
k. The Born rule relates (iii) to (ii); it says nothing by itself about how (ii) arises from (i). The paper asks three questions and reports the status of each: 1. Can a shared, finite carrier enforce exclusive records? In a coupled-mode model with explicit local detectors, detector-local back-reaction lowers the gated coincidence parameter from
α=1.00 to
α=0.57–0.60 at the strongest back-reaction tested, but only when detector thresholds are comparable to the carrier energy. At thresholds one-twentieth of the carrier energy,
α stays at
0.96–1.00. Strong exclusion (
α<0.1) was not reached in any of 136 configurations. Result: partial suppression only. 2. Under what conditions does record selection reproduce Born weights? Two sufficient routes are identified, each with a precisely quantified fragility. Route 1: exactly memoryless (exponential) detector thresholds give Born frequencies by a common-time-change argument; gamma thresholds of shape 2 depart by TV distance
0.08–0.15. Route 2: a bounded martingale for channel populations absorbed at a vertex gives Born weights for any functional form of the exchange law; a first-passage bound and a converse are proved (given absorption, zero conditional drift is necessary), and a biased exchange kernel is shown to follow the Kimura fixation formula, so zero drift must hold to order
1/M in the number of exchange units. Common-mode noise on the shared carrier cannot substitute for detector-local randomness: with fixed thresholds the largest channel fires first in every run, at every reversal rate. 3. Does Part I supply these conditions? No. The Part I helicity representation acts by permutation matrices, and no permutation action yields zero conditional drift for any filtration unless it is the identity (for pairwise-distinct populations). Measured on the Part I crossing process, the drift is nonzero at every test state, and populations are rearranged but never concentrated; sector populations are exactly invariant. This identifies braiding as neutral with respect to record selection. Scope and caveats. No derivation of the Born rule or of quantum superposition from the substrate is claimed. The internal state
ψ is an input; the exchange kernel of Route 2 is global and postulated; memoryless detector thresholds (Route 1) are assumed; strong exclusion was not achieved; and the first-passage record of Proposition 3 (
α=0 by conservation) has not been combined with local detectors in simulation. Real amplitudes suffice for the single-system statistics studied, but real-amplitude quantum theory is experimentally distinguishable from complex quantum theory in network scenarios. Each result in the manuscript is tagged [DERIVED], [ASSUMED], or [TESTED]. Three scripts produce every number in the paper; each states its model, metrics, controls, predictions and decision rules in its header, fixed before the runs reported. The scripts were not preregistered; this deposit supplies them together with their outputs and hashes to support reproducibility.
Borrowing ideas from the relation between simply laced Lie algebras and Dynkin diagrams, a weighted graph theory representation of quantum information is addressed. In this way, the density matrix of a quantum state can be interpreted as a signless Laplacian matrix of an associated graph. Using similarities with root systems of simply laced Lie algebras, one-qubit theory is analyzed in some details and is found to be linked to a non-oriented weighted graph having two vertices. Moreover, this one-qubit theory is generalized to n-qubits. In this representation, quantum gates correspond to graph weight operations preserving the probability condition. A speculation from string theory, via D-brane quivers, is also given.