Source-linked AI summary
Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise
Nur Mohammad Sanfui, Supriyo Dutta
TL;DR
Measurement-free quantum routing must transfer unknown states without measurement-induced collapse, but conventional unweighted walks can back-scatter and spread. The paper proposes coined Szegedy walks on signed graphs, reports deterministic perfect transfer in two routing architectures, and analyzes their noise horizons.
Problem
Unknown quantum states must be routed without measurement-induced collapse, while conventional unweighted quantum walks can suffer back-reflection, dispersion, and crosstalk.
Source: §1 · pp. 1–2Method
The paper uses coined Szegedy walks on edge-duplicated signed graphs, encoding edge signs as localized phase shifts under a balanced coin.
Source: §1 · p. 2Results
The two routing archetypes achieve unit-fidelity transfer; amplitude damping reaches τmax ≈0.4055/λ hops, while phase damping retains quantum advantage to τmax ≈1.0986/p hops.
Source: §1 · p. 2Takeaways & Limitations
Binary topological signs provide phase-controlled routing, and the analyzed architectures retain quantum advantage over longer distances under phase damping than under photon loss.
Source: §7 · p. 16
Abstract
from arXiv · showhide
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 $D_{2m,0,2n}$ and scalable glued binary trees. Furthermore, we analyse routing performance under realistic open-system amplitude and phase damping noise channels.
1 Introduction
The introduction motivates measurement-free quantum routing and proposes signed-graph Szegedy walks to avoid the back-scattering and crosstalk of conventional unweighted walks. It presents deterministic state-transfer architectures and evaluates their resilience to amplitude and phase damping.
1 Introduction
- Unweighted walks at multi-branching junctions can back-scatter and spread, undermining directional refocusing and causing channel crosstalk.The introduction identifies this as a barrier to deterministic perfect state transfer across non-trivial multi-port topologies.Source: §1 · p. 2
- Balanced-coin Szegedy walks on edge-duplicated signed graphs use localized phase shifts to enforce zero back-scattering at routing junctions.At α = 0.5, destructive interference cancels unwanted input-channel reflections while focusing transmission along designated egress paths.Source: §1 · p. 2
- The signed dumbbell switch and glued-tree router achieve unit-fidelity state transfer at discrete, topologically deterministic arrival times.The dumbbell switches between memory and transmission modes by toggling one bridge sign; the glued tree refocuses at its egress root at τ = 2d and is structurally fault-tolerant to link failures.Source: §1 · p. 2
- Amplitude damping limits routing to τmax ≈0.4055/λ hops, while phase damping preserves quantum advantage to τmax ≈1.0986/p hops.Both horizons are measured against the classical fidelity threshold Fclassical = 2/3.Source: §1 · p. 2
2 Quantum routers and signed graphs
This section defines a quantum router through controlled, unit-fidelity transfer from an input port to a chosen destination without leakage or loss of coherence. It maps the network to a signed graph whose edges represent opposing communication channels and phase-controlled waveguides.
2 Quantum routers and signed graphs
- A quantum router transfers an unknown state from input S to a chosen destination Dj at a specified arrival time with unit fidelity, without measuring it or destroying coherence.The definition also requires zero transfer amplitude to every unchosen destination.Source: §2 · p. 3
- The router’s network state space represents spatial transmission modes, while orthonormal destination modes and classical control settings parameterize its unitary evolution.The control configuration selects the operator governing transmission.Source: §2 · p. 3
- For each destination, deterministic forwarding requires unit fidelity, zero leakage to other outputs, and preservation of arbitrary input superpositions under unitary evolution.These are the stated router criteria for a target-specific control setting and arrival time.Source: §2 · p. 3
- Each network link becomes a pair of opposing directed arcs, with a positive edge denoting an unshifted channel and a negative edge denoting a localized π-phase shift.The text describes applying a voltage to introduce the phase delay and toggle the edge sign.Source: §2 · pp. 3–4
- The routers considered assume one input, one receiver, and a single control parameter α for the unitary transitions.The passage identifies Szegedy quantum walks as central to information transition.Source: §2 · p. 4
3 Szegedy quantum walk on signed graphs and state transfer
The signed-graph walk represents each link with oppositely oriented arcs and evolves through a local coin reflection followed by a flip-flop shift. At α = 0.5, balanced edge-selection probabilities support zero back-scattering and perfect state transfer, which transports a state with unit fidelity at a discrete time without measurement.
Signed directed graph
- Each undirected signed edge becomes two oppositely oriented arcs, retaining its sign in the directed graph.The resulting directed graph has twice as many edges as the undirected graph.Source: §3 · p. 4
Walk construction
- The walk’s parameter α sets the probabilities of selecting positive and negative edges to α and 1 − α, respectively.The probabilities are equal among edges of the same sign.Source: §3 · p. 4
- The walk operator Uα = SCα combines a local coin reflection that redistributes amplitudes with a shift that transfers packets to adjacent vertices.The walk acts on a Hilbert space spanned by directed-edge states.Source: §3 · pp. 5–6
State transfer
- Perfect state transfer occurs when the evolved state equals the target state up to a unit-modulus phase, yielding fidelity 1 at the transfer time.The paper identifies PST as measurement-free transport of an arbitrary quantum payload without collapsing superposition or destroying entanglement.Source: §3 · p. 6
Zero back-scattering lemmas
- At α = 0.5, p(e) = 1/2 is equivalent to a zero transition amplitude from an arc to its inverse, the stated zero back-scattering condition.At a vertex with two neighbors, the walk maps the outgoing arc to the incoming arc under U0.5.Source: §3 · p. 6
4 Construction of a fault-tolerant quantum router
The section constructs a router by identifying the leaves of two rooted trees and arranging edge signs by level. Under stated conditions, the resulting glued tree supports perfect state transfer between its roots, including in the reported edge-damage construction.
Construction and PST condition
- For a rooted tree with equal root-to-leaf distances, same-sign edges at each level, and alternating signs across levels, the glued tree admits PST between its roots.The glued signed tree is formed by identifying corresponding leaves of two copies of the rooted tree.Source: §4 · p. 7
Numerical observations
- For every α in (0,1), the example’s root-to-root fidelity exceeds 0.99, and PST occurs at α = 0.5 at times t = 4, 12, 20, . . ..The distance between the two roots in that glued tree is 4.Source: §4 · p. 7
Scalability and fault tolerance
- Larger glued trees also support PST, and the reported edge-removal construction preserves root-to-root PST at a time equal to the distance between the roots.For the illustrated larger tree, the roots are r1 = 0 and r2 = 15.Source: §4 · p. 7, Figure 3 · p. 9
Fault tolerance
- The damaged glued-tree constructions retain PST between roots r1 = 0 and r2 = 15 after removing a failed edge and additional edges to preserve the tree structure.The caption depicts the graphs at two stages of the removal operation.Source: §4 · p. 7, Figure 3 · p. 9
Routing mechanism
- Alternating signs across successive levels are described as canceling back-scattering and guiding the wavepacket forward across the glued-leaf interface.The section characterizes the resulting transport as ballistic and reports refocusing at the egress root at τ = 2d.Source: §4 · p. 10
5 A switch in a routing network
The signed dumbbell switch uses the sign of its bridge to control transport across two cycles. At α = 0.5, the negative-bridge graph admits PST between opposite terminals at t = m + 1 + n, while the positive-bridge graph does not.
Theorem 1
- At α = 0.5, Σ2 admits PST from vertex 0 to 2m + n at t = m + 1 + n, whereas Σ1 does not.Σ2 has a negative bridge and Σ1 has a positive bridge; the figure identifies the same transfer endpoints and arrival time.Source: §5 · p. 10, Figure 5 · p. 11
Routing mechanism
- The source wavepacket splits into two counter-propagating fronts that travel equal-length paths to junction m, where the bridge sign determines the routing mode.The source is at vertex 0 on the 2m-vertex cycle, and both fronts reach m after m steps.Source: §5 · pp. 12–13
Optical delay mode
- With a positive bridge, the junction’s three positive edges give p = 1/3, violating the reflection-free condition and causing the state to scatter largely back into the first cycle.The paper states that this positive-bridge configuration does not admit PST between the extreme vertices.Source: §5 · pp. 12–13
Transmission mode
- With a negative bridge, the junction sends probability 0.5 onto the bridge and 0.25 onto each cycle edge, yielding unit-fidelity refocusing at the antipodal terminal.The arrival time is τ = m + 1 + n.Source: §5 · p. 13
Topological routing
- The architecture requires no measurement, and its routing switch is executed by a discrete sign change on the bridge; the cycles need not be identical in size.The paper describes the routing path as determined by global discrete topological invariants.Source: §5 · p. 13
6 Quantum communication in a noisy environment
The section models noise applied after each unitary walk step and examines how amplitude loss and phase damping constrain routing fidelity. Amplitude loss attenuates the transferred state with distance, while phase damping retains quantum routing advantage over a longer distance in the reported setting.
6 Quantum communication in a noisy environment
- The analysis applies noise after each unitary coin-shift step, with the state updated by a noise superoperator at every discrete time step.The section frames the analysis around how far a state can travel before noise reduces its fidelity.Source: §6 · p. 13
6.1 Amplitude damping Noise
- At the perfect-transfer time τ, amplitude-damped fidelity scales as F(τ; λ) = (1 − λ)^τ.For glued signed trees, τ = 2d; for signed dumbbell graphs, τ = m + 1 + n.Source: §6.1 · pp. 13–14
- Figure 6 plots arrival time against state fidelity for different λ values in the amplitude-damping channel.The supplied caption specifies the plotted quantities but does not state the curves’ outcomes.Source: Figure 6 · p. 14
6.2 Phase Damping Noise
- Phase damping preserves photon population but degrades off-diagonal coherence; in the dumbbell walk, interference cross-terms decay by (1 − p) at each hop.The initial dumbbell state is a coherent superposition of clockwise and counter-clockwise paths.Source: §6.2 · pp. 14–15
- At p = 0.02, phase damping preserves quantum routing advantage for about 55 hops, more than double the approximately 20-hop amplitude-damping horizon.The comparison is with the classical fidelity bound F = 2/3; the phase-damping result is reported for a realistic optical phase-fluctuation rate.Source: §6.1 · p. 14, §6.2 · p. 15
7 Conclusion
The conclusion presents signed-graph Szegedy walks as an all-optical, measurement-free routing architecture whose routing choices use discrete edge signs. It describes dumbbell and glued-tree mechanisms and reports tolerance to environmental decoherence, with phase damping allowing a longer reported horizon than amplitude damping.
7 Conclusion
- The photonic implementation maps directed arc states to waveguide modes, vertices to multi-mode couplers, and negative edges to localized π-phase shifters.The coin bias α parameterizes power division at each coupler.Source: §7 · p. 15
- For the dumbbell, a positive bridge sign traps the state in the primary cycle, while even-length bipartite cycles support perfect transfer independently of their specific sizes.The counter-propagating modes arrive at the junction in phase under the stated bipartite symmetry.Source: §7 · p. 15
- On signed rooted glued trees, alternating edge signs suppress lateral leakage between sibling nodes through destructive interference, producing a ballistically protected one-dimensional channel between roots.Routing is governed by graph structure and discrete sign configuration rather than continuous parameter fine-tuning.Source: §7 · p. 16
- Routing uses binary edge signs and avoids intermediate projective measurements and classical handshakes, preserving superposition amplitudes and coherence phases.The conclusion characterizes the protocols as all-unitary and coherent.Source: §7 · p. 16
- The noise analysis reports horizons of τmax ≈ 0.4055/λ hops under amplitude damping and τmax ≈ 1.0986/p hops under phase damping, with the latter exceeding twice the former distance.The comparison is made before fidelity falls to the classical benchmark F = 2/3.Source: §7 · p. 16