Direct vs. Swapped Interconnections

• Direct and swapped interconnections are paradigms defining whether connections occur through native, adjacent links or via mediated swap operations across systems.
• They influence methodology by balancing resource overhead, error propagation, and scalability through techniques like SWAP gate optimization and entanglement swapping.
• These interconnection schemes guide design choices in quantum circuits, networks, and HPC, with direct methods offering low latency and swapped approaches enabling scalable architectures.

Direct and Swapped Interconnections refer to two foundational paradigms for connecting entities—be they quantum bits, nodes in classical or quantum communication networks, or state variables in hybrid and control systems—depending on whether interactions occur via natively available links (“direct”) or are synthesized/get routed via intermediate swaps or mediating elements (“swapped”). These distinctions are central in quantum circuit compilation, interconnection network design for HPC and quantum networks, and the model reduction of hybrid systems. In all such contexts, the dichotomy shapes resource overheads, error propagation, algorithmic structure, and system scalability.

1. Formal Definitions Across Domains

The meaning of direct versus swapped interconnection is context-dependent but preserves the key distinction: direct implies native adjacency or immediate coupling; swapped involves explicit state transfer or mediation to synthesize a desired interaction.

Quantum Circuits:

• Direct interconnection: Logical qubits $q_a$, $q_b$ mapped by $\pi$ to physical qubits $\pi(q_a), \pi(q_b)$ that are adjacent in the hardware graph $G = (V, E)$. A two-qubit gate (e.g., CNOT) can be executed directly (Liu et al., 2022).
• Swapped interconnection: Logical qubits needing a gate are not adjacent; the compiler injects one or more SWAP gates (each replacing qubit content between adjacent physical qubits along a path in $G$), moving qubits to adjacency so the gate can be executed (Liu et al., 2022, Chiew et al., 2024).

Quantum Networks:

• Direct Bell-pair interconnection: Two nodes share a directly generated and distributed Bell pair, used for quantum communication or teleportation (Mutolo et al., 17 Sep 2025, Traulsen, 2014).
• Entanglement-swapped (swapped) interconnection: Intermediate nodes perform entanglement swapping, creating an effective end-to-end Bell pair over a multi-hop chain (Mutolo et al., 17 Sep 2025).

Switching Networks:

• Direct (shared-EPPS): Entangled photon pair sources are directly routed to target nodes; each user receives a photon directly from the source (Koyama et al., 2024).
• Swapped (shared-BSA): Each node emits a photon entangled with local memory to a central analyzer; pairing is achieved through a Bell-state measurement that swaps entanglement between memories (Koyama et al., 2024).

Hybrid/Control Systems:

• Direct interconnection: The system is driven directly by a signal generator; inputs are mapped straightforwardly (Niu et al., 22 Jan 2026).
• Swapped interconnection: The system’s outputs are fed into an external filter (observer), effectively swapping the driver and the plant (Niu et al., 22 Jan 2026).

HPC/Interconnection Networks:

• Direct (switch-less): Processing nodes are mutually interconnected, carrying switching fabric themselves, and direct communication occurs without centralized switches (Feng et al., 2024).
• Swapped (switch-based, conventional): Communication between non-adjacent nodes occurs via one or more central switches/routers, which serve as intermediaries (Feng et al., 2024).

2. Cost, Overhead, and Resource Efficiency

The conversion from direct to swapped interconnections introduces concrete overheads dependent on the domain and the specific routing or switching protocol.

Quantum Circuits:

• Each SWAP typically decomposes to three basis (e.g., CNOT) gates; but, not all SWAPs ultimately cost $3$ CNOTs due to commutation/optimization opportunities—some SWAPs are absorbed into block resyntheses or canceled by gate commutation (Liu et al., 2022, Chiew et al., 2024).
• NASSC (optimization-aware routing) demonstrates that SWAP insertion must not be agnostic of subsequent circuit optimizations; the realized CNOT overhead is context-dependent, with reductions up to 69.3% in CNOTs and 43.5% in circuit depth over prior art (Liu et al., 2022).

Quantum Networks:

• Swapped (multi-hop) entanglement generation produces exponential degradation in fidelity with each swap ($F_{\text{out}} \approx F_{\text{in}}^s$ for $s$ swaps), mandates additional distillation/QEC rounds, and increases memory requirements (Mutolo et al., 17 Sep 2025).
• Naïvely balanced, path-oblivious swapping approaches a lower swap overhead $R$ (ratio of swaps performed to the minimal nested requirement), with $R$ growing sublinearly in network size, but exponentially in distillation overhead (Mutolo et al., 17 Sep 2025).

Switching Fabrics:

• Direct “pairing” networks that implement only pairwise connections between $N$ nodes require strictly fewer switch elements ($N(N-2)/4$ planar 2x2 MZIs) than full permutation networks, reducing both loss and crosstalk (Koyama et al., 2024).
• Swapped (shared-BSA) networks offer rearrangeable non-blocking topologies (triangular, chevron, brickwork) that support arbitrary pairings at less than half the switch-point cost of general networks (Koyama et al., 2024).

3. Algorithmic Structure and Optimization

Methodological advances exploit the direct/swapped dichotomy to achieve both asymptotic and practical gains.

Quantum Routing:

• Generalized swap networks construct routing via matchings for $k$-qubit gates on $n$ logical qubits: all gates can be implemented in $O(n^{k-1})$ swap layers, with optimal scaling for complete $k$-local circuits (O'Gorman et al., 2019).
• NASSC leverages a layered, lookahead search with an optimization-aware cost function that incorporates possible future two-qubit block resynthesis and CNOT commutations; this functional is minimized during SWAP routing to minimize global CNOT depth, not just SWAP count (Liu et al., 2022).

Interconnection Networks (HPC):

• Switch-Less-Dragonfly-On-Wafers utilizes direct chiplet interconnection, yielding up to 3x injection bandwidth, reduced cabling, and up to 5x lower cost compared to switch-based Dragonfly, with only a minor penalty in average hop count, offset by significantly lower per-hop latency and energy (Feng et al., 2024).
• The Swapped Dragonfly introduces swapped global links that enable $K M^2$ conflict-free, three-hop paths between any node pairs—supporting matrix-multiplication, broadcast, and all-to-all primitives with strict conflict-free algorithms and round counts that match or improve on hypercube and classical Dragonfly embeddings (Draper, 2022, Draper, 2022).

4. Practical and Physical Implications

Quantum Hardware:

• In superconducting qubit platforms, direct exchange (iSWAP-type) gates generally outperform swapped (bSWAP) in speed and fidelity at fixed parametric drive strength; bSWAP is slower, but more robust to frequency crowding and scalable in dense arrays (Roth et al., 2017).
• Error propagation through SWAPs is not trivial; in fault-tolerant overlays, only carefully restricted SWAP sequences (type-1: computational to routing qubits; type-2: computational-to-computational at active gate layers) can preserve code distance and logical error guarantees (Chiew et al., 2024).

Quantum Communication:

• Direct Bell-pair interconnections are optimal for fidelity and latency but are intrinsically unscalable in range without swapping.
• Entanglement swapping, while necessary for range extension, inherently sacrifices fidelity unless compensated by aggressive distillation or QEC. Path-oblivious swapping protocols promise enhanced scalability and control simplicity at modest swap overheads, particularly as hardware improves (Mutolo et al., 17 Sep 2025).

Switching and Quantum Repeater Networks:

• Planar, rearrangeable pairing networks for distributed Bell state analysis or source-to-node pairing minimize hardware cost and propagation loss, making both direct and swapped architectures functionally equivalent in switch complexity (Koyama et al., 2024).

5. Comparative Analysis and Domain-Specific Guidelines

Context	Direct Interconnection Benefits	Swapped Interconnection Cost/Benefit
Quantum Circuits	Minimal CNOT overhead, lowest error, feasible only for physically adjacent pairs	Enables arbitrary logical gates on hardware graphs with limited connectivity, but incurs SWAP/CNOT/duration overhead. Careful routing/optimization can minimize, but not eliminate, overhead (Liu et al., 2022, O'Gorman et al., 2019)
Quantum Networks	Best for short-range, low-latency, high-fidelity links	Essential for scalable quantum repeaters, introduces swap-induced fidelity decay, increased resource requirements (Mutolo et al., 17 Sep 2025)
HPC/Network	High throughput, low cost, excellent scalability (in switch-less direct architectures)	Centralized switches (swapped design) permit flexibility and legacy integration but are constrained by radix, bottlenecks, and higher cost (Feng et al., 2024)
Hybrid Control	Faithful moment matching via signal generation	Dual property via filter-based “swapped” interconnection; essential for simultaneous model reduction in both paradigms (Niu et al., 22 Jan 2026)

Guidelines:

• Embedding logical coupling graphs directly onto hardware remains optimal; use swap-based methods when direct mapping is infeasible or hardware-imposed (Kattemölle et al., 18 Mar 2025).
• For dense, repetitive quantum circuits (e.g., QAOA, Trotterized time-evolution), generalized swap networks yield asymptotically minimal depth and are preferred to ad hoc unscrambled routing (O'Gorman et al., 2019, Parella-Dilmé, 31 Jul 2025).
• Fault-tolerant quantum computing on hardware with incomplete connectivity should use swap schedules guaranteeing error-pattern preservation (EPP) (Chiew et al., 2024).
• In interconnection network design, embracing direct (switch-less) architectures at scale confers energy, throughput, and cost advantages if the increased hop complexity can be tolerated by the application (Feng et al., 2024).

6. Theoretical Foundations and Model Reduction

Model Reduction for Hybrid Systems:

• Moment-matching in hybrid systems naturally distinguishes between the direct and swapped interconnections: the former corresponds to classical input-response driven by a signal generator; the latter to output-observer-driven systems (dual or filter interconnection) (Niu et al., 22 Jan 2026).
• Distinct Sylvester equations characterize the moments in each interconnection; unique reduced-order models preserving these moments are constructed via solutions to corresponding hybrid Sylvester systems.
• Two-sided moment matching requires invertibility of a product solution and yields a family of reduced models matching both direct and swapped steady-states (Niu et al., 22 Jan 2026).

7. Open Problems and Future Directions

• In quantum circuit routing, determining optimal swap placements for arbitrary interaction patterns and hardware graphs remains computationally intractable; continuous algorithmic improvements (optimization-aware routing, periodic tiling) remain a focus area (Liu et al., 2022, Kattemölle et al., 18 Mar 2025).
• For quantum communication, further quantification of swap overhead and distillation resource consumption in new, high-fidelity, scalable architectures is needed as networks transition from sparsely provisioned to well-provisioned, robust-memory-dominated regimes (Mutolo et al., 17 Sep 2025).
• In network topology, formal tradeoffs between switchless direct scaling and minimal-hop constraints in emerging system sizes still need rigorous benchmarking across diverse workloads (Feng et al., 2024).
• Hybrid system reduction and control design are increasingly leveraging dual direct/swapped moment frameworks for robust, low-order modeling in systems with periodic or complex event timing (Niu et al., 22 Jan 2026).

• (Liu et al., 2022) Not All SWAPs Have the Same Cost: A Case for Optimization-Aware Qubit Routing
• (Mutolo et al., 17 Sep 2025) Path-Oblivious Entanglement Swapping for the Quantum Internet
• (Koyama et al., 2024) Optimal Switching Networks for Paired-Egress Bell State Analyzer Pools
• (Draper, 2022) The Swapped Dragonfly
• (Draper, 2022) Four Algorithms on the Swapped Dragonfly
• (Feng et al., 2024) Switch-Less Dragonfly on Wafers
• (Chiew et al., 2024) Fault-tolerant embedding of quantum circuits on hardware architectures via swap gates
• (O'Gorman et al., 2019) Generalized swap networks for near-term quantum computing
• (Kattemölle et al., 18 Mar 2025) Optimal and efficient qubit routing for quantum simulation
• (Roth et al., 2017) Analysis of parametrically driven exchange-type (iSWAP) and two-photon (bSWAP) interactions between superconducting qubits
• (Niu et al., 22 Jan 2026) Interconnection-based Model Reduction for Linear Hybrid Systems
• (Traulsen, 2014) Faster Communication Using Probabilistic Swapped-Bell-States Analysis

This synthesis reflects the broad technical reach, typical methodologies, and structural implications of the direct and swapped interconnection dichotomy across multiple research domains.