---
title: 'InterQnet: Dual Facet in Control & Quantum Networks'
url: https://www.emergentmind.com/topics/interqnet
type: topic
---

# InterQnet: Dual Facet in Control & Quantum Networks

InterQnet is a context-dependent research term with two distinct 2025 usages. In one usage, within the reinforcement-learning framework “InterQ: A DQN Framework for Optimal Intermittent Control,” “InterQnet” is an *Editor’s term* for the deep Q-network that approximates the scheduler’s Q-function in a communication-control co-design problem for discrete-time stochastic linear systems [2504.09035]. In a second usage, “InterQnet” denotes a multidisciplinary project on scalable heterogeneous quantum communications that combines device development, error handling, and network architecture through the paired programs InterQnet-Achieve and InterQnet-Scale [2509.19503]. These usages concern different technical domains—optimal intermittent control and quantum networking—which suggests that the term should be interpreted strictly from local research context.

## 1. Terminological scope and disambiguation

In the control-theoretic usage, the paper itself refers to the overall algorithm as “InterQ,” and the detailed explanation introduces “InterQnet” only to denote the DQN approximator used to learn the scheduling policy [2504.09035]. The object being approximated is the scheduler’s action-value function over a continuous estimation-error state and a binary transmission action. In this sense, InterQnet is not a separate framework from InterQ; it is the neural component inside it.

In the quantum-networking usage, InterQnet is the formal project name of a “heterogeneous, full-stack approach to scaling quantum networks,” with explicit emphasis on heterogeneous platforms, long-distance operation, application diversity, and orchestration under realistic constraints [2509.19503]. Here the term refers not to a neural network but to an architectural and experimental program spanning physical devices, control planes, error mitigation, and systems modeling.

A common source of confusion is therefore nominal rather than conceptual. One InterQnet is a DQN approximator for scheduling in stochastic control, while the other is a heterogeneous quantum-network initiative. Related literature in packet quantum networking, quantum interconnects, recursive quantum internet architectures, and metropolitan testbeds provides background for the latter usage, but does not redefine the term itself [1903.10685], [1912.06642], [2112.07092], [2207.09589].

## 2. InterQnet in optimal intermittent control

The control-theoretic InterQ setting studies a discrete-time stochastic linear plant
$$
x_{k+1} = A x_k + B u_k + W_k,
$$
where $W_k$ is zero-mean, independent across time, and has covariance $K_W$ [2504.09035]. The scheduler continuously observes the true state $x_k$ and chooses a binary scheduling action $s_k \in \{0,1\}$, where $s_k = 1$ means transmit and $s_k = 0$ means no transmit. When transmission occurs, the controller receives the current state perfectly; otherwise it relies on its internal estimate $\hat{x}_k$.

The architecture has two sequential decision-makers. The scheduler $S$ observes $x_k$ continuously and decides $s_k$, while the controller $C$ receives $x_k$ only when $s_k = 1$ and otherwise computes control from $\hat{x}_k$. The information structure is partially nested, with $I_C(k) \subseteq I_S(k)$ for all $k$, so the scheduler sees everything the controller sees and more. The paper states that this yields a separation principle, no dual effect for control, and certainty equivalence [2504.09035].

The stage cost is
$$
c(x_k,u_k) = x_k^\top Q x_k + u_k^\top R u_k,
$$
with $Q \succeq 0$ and $R \succ 0$, and the communication cost is $m_k = \lambda s_k$ with $\lambda > 0$ per transmission. The discounted infinite-horizon objective is
$$
J = E\!\left[\sum_{k=0}^\infty \gamma^k \left(x_k^\top Q x_k + u_k^\top R u_k + \lambda s_k\right)\right],
$$
with $\gamma \in (0,1]$ [2504.09035]. Under the partially nested structure, the optimal controller is certainty-equivalent LQR on $\hat{x}_k$, with discounted Riccati solution
$$
P = \gamma A^\top P A - \gamma^2 A^\top P B (R + \gamma B^\top P B)^{-1} B^\top P A + Q,
$$
and gain
$$
K = \gamma (R + \gamma B^\top P B)^{-1} B^\top P A,
$$
so that
$$
u_k^* = -K \hat{x}_k.
$$

The controller’s estimator predicts
$$
\hat{x}_{k+1|k} = A \hat{x}_k + B u_k
$$
and updates according to
$$
\hat{x}_{k+1} = (1-s_{k+1})\hat{x}_{k+1|k} + s_{k+1}x_{k+1}.
$$
With estimation error $e_k := x_k - \hat{x}_k$, the dynamics reduce to
$$
e_{k+1} = (1-s_{k+1})(A e_k + W_k),
$$
and the covariance evolves as
$$
S_{k+1} = (1-s_{k+1})(A S_k A^\top + K_W).
$$
After substituting the certainty-equivalence controller into the objective, the joint design reduces to a scheduler-only optimization,
$$
J = \frac{\gamma}{1-\gamma}\operatorname{tr}(P K_W) + E\!\left[\sum_{k=0}^\infty \gamma^k \left(e_k^\top \Gamma e_k + \lambda s_k\right)\right],
$$
with
$$
\Gamma := \gamma^2 A^\top P B (R + \gamma B^\top P B)^{-1} B^\top P A \succeq 0.
$$
The scheduler therefore faces an MDP with state $z_k = e_k$, action $s_k \in \{0,1\}$, transition $z_{k+1} = (1-s_{k+1})(A z_k + W_k)$, and per-step cost $r_k = z_k^\top \Gamma z_k + \lambda s_k$ [2504.09035].

## 3. DQN architecture, training, and scheduling structure

In this control usage, InterQnet approximates $Q(z,s)$ for a continuous state $z=e_k$ and binary action $s \in \{0,1\}$ [2504.09035]. Its input is $z = e_k \in \mathbb{R}^{n_x}$, and in the reported experiments $n_x = 2$. The output head returns two scalar Q-values, $\left[Q(z,s=0), Q(z,s=1)\right]$, one per action.

The architecture is an MLP with 4 hidden layers, each with 100 units, using GeLU activations and a linear output layer with 2 units. No normalization or feature engineering is specified; raw $e_k$ is fed to the network. The training loss for a minibatch of transitions $(z,s,r,z')$ is
$$
L(\theta)=\left(r+\gamma \min_{s' \in \{0,1\}} Q(z',s';\theta^-)-Q(z,s;\theta)\right)^2,
$$
with target-network weights $\theta^-$. The update is an Adam step,
$$
\theta \leftarrow \theta - \eta \nabla_\theta L(\theta),
$$
and the paper also reports improved stability with Huber loss in place of MSE to reduce sensitivity to outliers in stochastic noise [2504.09035].

The reported training mechanisms are standard DQN stabilizers: an experience replay buffer of capacity $M=1000$ storing tuples $(e_k,a_k,c_k,e_{k+1})$, minibatch size $b=16$, uniform random sampling, a target network with periodic hard update $\theta^- \leftarrow \theta$, and $\epsilon$-greedy exploration with $\epsilon_{\text{start}} = 1.0$, $\epsilon_{\text{decay}} = 0.995$ per step, and $\epsilon_{\min} = 0.01$. The optimizer is Adam with learning rate $\eta = 0.01$, and the discount factor is $\gamma = 0.95$. The description explicitly notes that no double DQN, dueling, reward clipping, or prioritized replay are reported [2504.09035].

A notable qualitative result is the geometry of the learned scheduling landscape. The authors prove sufficient conditions for regions in estimation-error space. No-transmit is strictly optimal if
$$
\|e\|_{A^\top \Gamma A}^2 < \lambda(1/\gamma - 1) - \operatorname{tr}(\Gamma K_W),
$$
while transmit is strictly optimal if
$$
\|e\|_{A^\top \Gamma A}^2 > \frac{\lambda}{\gamma(1-\gamma)} - \operatorname{tr}(\Gamma K_W).
$$
Empirically, the learned decision boundary aligns with an ellipse between these sufficient bounds. This indicates that the DQN is not merely producing an opaque policy but is recovering structure consistent with the analytical scheduling geometry derived from the error-state formulation [2504.09035].

## 4. Empirical behavior, complexity, and limitations of the control usage

The reported numerical study uses an unstable two-dimensional system with
$$
A = \begin{bmatrix}1.5 & 2 \\ 0 & 1.51\end{bmatrix}, \qquad
B = \begin{bmatrix}0 \\ 1\end{bmatrix},
$$
$K_W = I_2$, $Q = I_2$, $R = 1$, and $\gamma = 0.95$ [2504.09035]. The Riccati solution is reported as
$$
P \approx \begin{bmatrix}5.70 & 7.34 \\ 7.34 & 14.36\end{bmatrix},
$$
and $\Gamma$ is numerically reported as approximately $14.64$ as the effective weighting in the quadratic error term. The InterQnet hyperparameters are the same 4×100 GeLU MLP with Adam, replay memory $M=1000$, batch size $b=16$, and the stated $\epsilon$-greedy schedule.

The baselines are a multi-period periodic scheduling policy, which transmits every $\tau$ steps, and an event-triggered policy defined by $s_k = 1$ if $\|e_k\|^2 \ge \tau$, else $s_k = 0$, with several thresholds tested [2504.09035]. Across tested $\lambda$ values such as $\lambda = 50$ and $60$, the reported Pareto curves show InterQ dominating both baselines: lower cumulative control-plus-communication cost for a given communication rate. The same qualitative advantage is reported when Gaussian process noise is replaced by uniform noise in $[-1,1]$.

The paper also reports that Huber loss improves training stability compared to MSE, and that replay memory size influences robustness to rare outlier experiences. A practical point stated in the description is that a smaller replay memory can improve stability in unbounded continuous state spaces by flushing rare catastrophic samples; the authors found $M=1000$ worked well [2504.09035].

Per decision step, the forward pass complexity is given as
$$
O\!\left(\sum_\ell d_\ell d_{\ell+1}\right)
$$
for 4 hidden layers of width 100 plus the 2-output head, which is summarized as roughly $O(3 \times 10^4)$ multiplies per step. Action selection computes two Q-values and chooses the minimum, while training requires a single forward/backward pass per minibatch and is described as lightweight on modern hardware [2504.09035].

The stated limitations are equally specific. The framework assumes linear dynamics and quadratic costs; although the process noise need not be Gaussian, the derivations hinge on linearity and the separation principle under partially nested information. The formulation also assumes known $A,B,Q,R,\gamma$ to compute $P$ and $u_k^*$, and immediate perfect updates when $s_k=1$. This suggests that model mismatch, delays, and out-of-order packets fall outside the present theory and would require adaptive observers, online Riccati estimation, extended filters, or POMDP formulations [2504.09035].

## 5. InterQnet as a heterogeneous quantum-networking program

In the quantum-networking literature, InterQnet is a multidisciplinary project aimed at scalable quantum communications through a “comprehensive approach that improves devices, error handling, and network architecture” [2509.19503]. The project targets scalability challenges associated with node count and topologies, heterogeneity of platforms, long distances, application diversity, and large user demand. The stated impact spans distributed quantum computing, secure communications, metrology, and sensing.

The program has a two-pronged strategy. InterQnet-Achieve is the “inner co-design loop,” intended to realize a three-node heterogeneous quantum network enabling communication between two distinct platforms via a third acting as a repeater node. Its components include a first-generation repeater based on Yb neutral atom arrays, solid-state $\mathrm{Er}^{3+}$ devices in nanophotonic cavities, superconducting microwave qubits including transmon and eNe devices interfaced via integrated piezo-optomechanical transducers, and optical quantum frequency converters [2509.19503]. The error-handling components include Pauli Check Sandwiching, resource-aware correction, and finite-size distillation circuits compiled to hardware. The control system is a centralized automated controller with a modular orchestrator, gRPC device agents, hybrid clock distribution using 10 MHz and 1 PPS radio-over-fiber plus NTP alignment, polarization drift compensation services, and an on-demand entanglement service governed by a CAR model.

InterQnet-Scale is the “outer systems study.” Its purpose is to evaluate architectural choices for scalability and resilience, including centralized versus distributed control, in-band versus out-of-band signaling, continuous entanglement generation, and error-correction trade-offs [2509.19503]. The modeling components include device-aware models in SeQUeNCe, tensor-network-accelerated optical simulations, Lindblad modeling of physical qubits, entanglement witnessing, ACP scheduling, and advanced coding strategies such as qLDPC and bosonic GKP with Petz recovery and concatenation. The Achieve and Scale components share measurements and models: physical parameters feed simulation, and simulation results inform device development and orchestration logic.

The quantum-networking InterQnet is therefore not merely a protocol stack or a device platform. It is explicitly described as full-stack co-design that links devices, protocols, control planes, and error handling under realistic constraints such as coexisting traffic, polarization drift, and timing derived from deployed-fiber data [2509.19503].

## 6. Platforms, orchestration, and error management in the quantum-networking usage

The platform heterogeneity in InterQnet is central to its design. The Yb neutral-atom platform offers telecom-band atomic transitions from the long-lived ${}^3P_0$ “clock” state at 1390, 1480, and 1540 nm, demonstrated atom-photon time-bin entanglement at 1390 nm, and memory coherence times greater than 10 s [2509.19503]. The $\mathrm{Er}^{3+}$ platform in $\mathrm{TiO}_2$ thin films on silicon provides a natural telecom transition near 1520–1530 nm, Purcell enhancement greater than 200 in nanophotonic crystal cavities, approximately 40% collection efficiency via fiber-to-chip coupling, an ensemble homogeneous linewidth of approximately 5 kHz, and spectral diffusion of approximately 27 kHz over 4 ms. The superconducting/eNe direction reports eNe qubit coherence of approximately 100 $\mu$s, single-qubit gate fidelity greater than 99.97%, resilient operation up to 0.4 K, and an integrated piezo-optomechanical microwave–optical interface targeting conversion efficiency greater than 50% with sub-photon added noise. Optical QFCs based on $\chi^{(2)}$ sum-frequency generation in periodically poled lithium niobate waveguides convert 1390/1520/1550 nm single photons to 745.7 nm for two-photon interference and Bell-state measurement, with pump temporal shaping used for photon-wavefunction engineering [2509.19503].

The control plane is organized into infrastructure, logical, and control-and-service planes. The orchestrator uses an SDN-like microservice architecture with gRPC device agents encapsulating EPS units, analyzers, time taggers, and polarization compensators; high-level protocol commands execute autonomously across nodes [2509.19503]. Synchronization is provided by radio-over-fiber 10 MHz and 1 PPS distribution plus NTP alignment, and polarization stabilization uses machine-learning-based prediction with RMS error of approximately 0.072 per Stokes parameter even with at least 5 nm wavelength separation. Background entanglement generation is managed by ACP, which adapts neighbor selection to request traffic and can integrate distillation when available.

The project also formalizes several error-handling layers. For two-photon interference fringes, the visibility metric is
$$
V = \frac{N_{\max} - N_{\min}}{N_{\max} + N_{\min}},
$$
and deployed-fiber experiments with coexisting classical traffic maintained visibilities of 59–68% [2509.19503]. For coexistence-aware orchestration, the empirical coincidences-to-accidentals ratio is modeled as
$$
CAR = \frac{\alpha_s \cdot \alpha_i \cdot \mu_c}{\bigl((\mu_c + \mu_{sn}) \cdot \alpha_s + d_s\bigr)\bigl((\mu_c + \mu_{in}) \cdot \alpha_i + d_i\bigr)} + 1,
$$
with $\alpha_x$ transmittance, $\mu_c$ correlated photon pairs per pulse, $\mu_{xn}$ SpRS-induced noise photons, and $d_x$ detector dark counts [2509.19503]. The orchestrator uses this model to tune EPS pump power, detector bias, and classical intensities to meet target CAR.

Pauli Check Sandwiching is described analytically. For initial Bell fidelity $F$ and postselection probability $c$, PCS X checks give
$$
c = \frac{1}{9}(1+2F)^2, \qquad
F' = \frac{9F^2}{(1+2F)^2},
$$
while PCS XZ checks give
$$
c = \frac{1}{324}\bigl(3 + 6F - \sqrt{12F - 3} + 4F\sqrt{12F - 3}\bigr)^2,
$$
and
$$
F' = \frac{1 + 52F^2 - \sqrt{12F - 3} - 2F(4 + \sqrt{12F - 3})}{\bigl(\sqrt{12F - 3} - 1 - 8F\bigr)^2}.
$$
Finite-size distillation based on the $[[4,2,2]]$ code, qLDPC-based logical Bell-pair purification, and bosonic GKP encodings with near-optimal Petz recovery are presented as complementary layers in an error-management hierarchy [2509.19503].

On the systems side, ACP scheduling in a 200-node autonomous-system topology reduced time-to-serve versus UCP by more than 50%, with reductions up to 94% across scenarios, and ACP plus distillation improved end-to-end fidelity by approximately 0.05 [2509.19503]. Experimental progress includes 4.38 km round-trip deployed-fiber coexistence experiments with quantum at 1550.10 nm and classical 10GBASE-LR at 1330 nm, coincidence rates of 120–155 s$^{-1}$ with a 1 ns window, 4.3 km HOM interference with a maximum dip visibility of $0.58 \pm 0.04$, and a plane-based orchestration abstraction deployed in a real testbed [2509.19503].

## 7. Relation to broader quantum-internet research and open directions

The quantum-networking usage of InterQnet sits within a broader lineage of quantum internet architecture, transport, and testbed research. Packet-level transport semantics for repeater-based, packet-switched internetworks were developed in “Protocols for Packet Quantum Network Intercommunication,” which proposed recursive quantum retransmission based on a $(2,3)$ threshold QSS scheme and a quantum three-way handshake for full-duplex logical connections [1903.10685]. In that framework, the expected total number of shares required to deliver one quantum message under per-share loss probability $p$ is
$$
E[N] = \frac{2-p}{(1-p)^2},
$$
and the handshake false-accept probability is bounded by $2^{-m}$. These results are not part of InterQnet proper, but they define transport-layer constraints relevant to any packet-based quantum internetwork.

Architectural recursion and interdomain abstraction are treated in “A Quantum Internet Architecture,” which centers on QRNA, RuleSets, and two-pass connection setup [2112.07092]. QRNA abstracts lower-layer subnetworks as virtual nodes and recommends qDijkstra with “seconds per Bell pair” as link cost. This provides a useful comparison point for InterQnet’s centralized automated orchestration and ACP scheduling. A plausible implication is that InterQnet’s Achieve/Scale split addresses many of the same scalability questions as QRNA—control placement, signaling models, and fidelity-aware service composition—but from the standpoint of heterogeneous device co-design and experimental integration rather than a single recursive control formalism.

The workshop summary “Development of Quantum InterConnects for Next-Generation Information Technologies” frames quantum interconnects as a grand challenge and defines the metrics commonly used for heterogeneous interfaces, including conversion efficiency $\eta$, added noise $n_{\text{add}}$, fidelity $F$, cooperativity $C$, Purcell factor $F_P$, bandwidth $\Delta f$, insertion loss $\alpha$, mode-matching $M$, coherence times $T_1$ and $T_2$, and entanglement rate $R$ [1912.06642]. Those criteria are directly relevant to InterQnet’s emphasis on microwave–optical transduction, cavity-enhanced telecom memories, and frequency conversion. Likewise, the metropolitan repeaterless testbed IEQNET demonstrates a layered SDN-controlled architecture over deployed fiber, quantum–classical coexistence, transparent optical switching, and calibration workflows that form an immediate experimental context for InterQnet’s deployed-fiber automation and coexistence claims [2207.09589].

The open directions are explicit in both 2025 usages. For the control-theoretic InterQnet, proposed extensions include actor-critic variants, adaptive observers, online Riccati estimation under model uncertainty, communication delays, and nonlinear systems [2504.09035]. For the quantum-networking InterQnet, the current bottlenecks include photon collection for Yb, entanglement rates, Raman and multipair noise, transducer efficiency and added noise, fiber-coupling losses, pump-induced heating, long-term polarization stability, orchestrator scaling, robust swapping under realistic error budgets, and staged integration of qLDPC and GKP recovery [2509.19503]. Taken together, these trajectories indicate that “InterQnet” currently names two active but unrelated research threads: one centered on certainty-equivalence control plus DQN-based scheduling, and one centered on heterogeneous full-stack co-design for scalable quantum networks.

Source: https://www.emergentmind.com/topics/interqnet