Abstract
We address the challenge of crosstalk in quantum multiplexing–an obstacle to scaling throughput in quantum communication networks. Crosstalk arises when physically coupled quantum modes interfere, degrading signal fidelity. We propose a mitigation strategy based on encoding discrete-variable (DV) quantum information into continuous-variable (CV) bosonic modes using Gottesman-Kitaev-Preskill (GKP) codes. By analyzing the effect of mode-mixing interference, we show that under specific noise strength conditions, the interaction can be absorbed into a gauge subsystem that leaves the logical content intact. We provide rigorous conditions for perfect transmission in the ideal case, derive the structure of the output codes and prove the existence of a gauge-fixing decoder enabling recovery of the logical information. Numerical simulations under displacement Gaussian noise illustrate the fidelity behavior and rate-fidelity tradeoff. Our results establish a coding-theoretic foundation for crosstalk-resilient multiplexing in quantum networks.
Similar content being viewed by others
Introduction
The vision of a scalable quantum internet1 depends critically on the ability to establish high-fidelity end-to-end entanglement across large, distributed quantum networks2,3. Achieving this goal requires both increasing the throughput of quantum links and maintaining the fidelity of transmitted quantum states4. Multiplexing—the simultaneous use of multiple channels over a shared resource—has emerged as a key strategy for boosting quantum communication rates5,6. Meanwhile, diversity techniques7,8—the use of redundant or parallel transmissions to improve reliability—offer a path toward robust state transfer under noise7,9,10. These approaches are foundational for advanced quantum communication paradigms, including Quantum Multiple-Input Multiple-Output (MIMO) systems7,8, which leverage multiple spatial modes to enhance data rates and robustness. However, the increased complexity of such systems makes them inherently more susceptible to crosstalk. Both multiplexing and diversity are fundamentally challenged by the problem of crosstalk: interference between quantum modes caused by physical coupling, such as mode mixing in photonic hardware4,11,12. Crosstalk can degrade the fidelity of quantum transmission and limit the effectiveness of network-level parallelism.
In quantum information science, DV and CV systems offer complementary strengths. DV systems, such as qubits, are naturally suited to logical operations and are standard in many communication protocols. However, they are highly susceptible to noise and crosstalk, especially in multiplexed settings. On the other hand, CV systems–particularly bosonic modes–offer a rich structure for encoding and robust error correction but often lack native digital logic. The interplay between these paradigms opens new possibilities: by encoding DV quantum information into CV modes via GKP codes, one can combine the discrete control and processing advantages of DV systems with the error resilience and resource efficiency of CV encodings. In this work, we propose to mitigate crosstalk in multiplexed quantum networks by encoding DV quantum states into CV bosonic modes using Gottesman-Kitael-Preskill (GKP) codes13. GKP states are a powerful family of bosonic quantum error-correcting codes that embed DV logical information into structured grids in phase space14. They have found broad application in quantum technologies, ranging from fault-tolerant quantum computing15,16,17,18 and metrology19 to recent advances in quantum communication20. In particular, GKP codes are promising candidates for photonic quantum networks, including all-optical quantum repeater schemes21. These platforms inherently rely on CV hardware (e.g., squeezed light, beamsplitters, homodyne detection), making GKP encodings naturally compatible with physical-layer implementations.
Prior work on quantum MIMO communication has demonstrated the potential of spatial-mode diversity and multiplexing to boost quantum channel capacities7,8,9,10. However, such schemes often suffer from inter-mode crosstalk, which limits scalability. In parallel, GKP codes have shown promise in enhancing fault tolerance and error correction in continuous-variable systems14,15,17, but their potential in structured quantum communication–especially in MIMO settings–remains underexplored. Our work aims to bridge these directions by employing GKP encodings as a method for mitigating crosstalk in multiplexed quantum channels. In this paper, we investigate whether encoding DV states into GKP modes enables crosstalk-resilient multiplexing—under specific, quantifiable conditions on the crosstalk strength. We show that when the crosstalk strength lies at specific values, and the GKP stabilizers are appropriately scaled, the interference caused by mode coupling can be absorbed into a gauge subsystem. As a result, the logical information is preserved and can be recovered deterministically. We analyze this effect rigorously, characterizing the structure of the output state, the code conditions for perfect transmission, and the emergent gauge symmetry. Furthermore, we show how this structure can be exploited through gauge-fixing procedures, enabling reliable logical recovery. Our work establishes a foundation for crosstalk-aware encoding in quantum networks based on CV hardware and opens up new directions in entanglement distribution through structured code design, thereby contributing to the development of robust Quantum MIMO communications.
In this work, we develop a theoretical framework for preserving DV quantum information encoded in CV bosonic modes using GKP codes in the presence of crosstalk from induced mode mixing. We introduce the GKP code formalism, establish notation, and formulate the interference model, identifying the mechanism by which crosstalk manifests as displacements in phase space. Our main results provide exact conditions under which these displacements can be incorporated into the stabilizer structure of the code, enabling perfect logical transmission. We derive lattice-matching criteria and prove that certain rational crosstalk strength values permit crosstalk-mitigated multiplexing. We further characterize the output state, decomposing it into logical and gauge subsystems, and analyze the structure and role of gauge entanglement. A gauge-fixing method and a decoder based on modular arithmetic and Clifford operations are proposed. Numerical simulations under Gaussian noise quantify the fidelity trade-offs as a function of code dimension. These results establish design principles for structured GKP codes suitable for scalable, interference-resilient quantum networking.
Results
In DV quantum information processing, crosstalk between spatial or spectral modes can be a major source of noise, if left untreated. When two modes undergo a mode mixing, information encoded in one mode will generally affect the other, leading to undesired logical errors. In this section, we show how such coupling–modeled as a passive linear interaction–can be made harmless by encoding the DV information into GKP code states. This allows us to multiplex quantum information in a crosstalk-robust manner. We refer the reader to Methods for clear overview of the tools used in this section.
Crosstalk-mitigated multiplexing via GKP encodings
We aim to determine conditions under which logical information in both GKP-encoded modes is preserved after the crosstalk transformation \({\hat{U}}_{\eta }\). Ideally, we require:
with D(η) would be a decoder depending on a priori knowledge of the average behavior of the stochastic η, or more generally, that the output remains within the original GKP code spaces up to correctable displacements. The main question is: for which pairs of lattices (fA, gA) and (fB, gB) is the logical subspace preserved under the mode-mixing crosstalk transformation \({\hat{U}}_{\eta }\)? Equivalently, we ask: under what conditions does the joint stabilizer group transform into an equivalent stabilizer group (modulo correctable errors), such that the logical content in both modes is unaffected by crosstalk?
More precisely, let each mode’s GKP code be defined by stabilizer lattices \({\Lambda }_{A}={{\rm{Span}}}_{{\mathbb{Z}}}\{{{\boldsymbol{f}}}_{A},{{\boldsymbol{g}}}_{A}\}\) and \({\Lambda }_{B}={{\rm{Span}}}_{{\mathbb{Z}}}\{{{\boldsymbol{f}}}_{B},{{\boldsymbol{g}}}_{B}\}\). After undergoing crosstalk, these are mapped to new lattices \({\tilde{\Lambda }}_{A}\), \({\tilde{\Lambda }}_{B}\) with basis vectors \(({\tilde{{\boldsymbol{f}}}}_{A},{\tilde{{\boldsymbol{g}}}}_{A})\) and \(({\tilde{{\boldsymbol{f}}}}_{B},{\tilde{{\boldsymbol{g}}}}_{B})\), respectively. Logical preservation (up to correctable displacement) requires that the original stabilizer lattice be contained in the transformed one:
and that any displacement incurred by the transformation lies within the correctable region—e.g., the Voronoi cell14–of the respective new lattices. Under these conditions, the logical subspace is preserved and can be recovered by standard GKP error correction and appropriate decoding.
The mode mixing crosstalk
In order to understand the effect of crosstalk on stabilizers of each mode, we should understand how generic displacement operators transform under this mode mixing model. The reason is that stabilizers of GKP codes are given in terms of displacement operators (see “Methods”). Under beamsplitter evolution, the product of displacements, each acting on its corresponding mode, transforms as:
This reveals that displacements applied to one mode result in induced displacements on the other, as expected from a crosstalk mechanism. As a matter of fact, our goal is to find a way to absorb these induced displacements into the stabilizers of a code, such that the logical information remains unchanged. For instance, suppose we wish to transmit logical states encoded in mode 1 and mode 2, undergoing crosstalk, while both modes are initialized in a GKP codewords. In order to prevent the induced displacement from corrupting both modes, we aim to ensure that this displacement falls within the code’s stabilizer lattice.
Observation
If the second mode is initialized in a GKP code with stabilizers \({{\mathcal{S}}}_{2}=\langle {T}_{2}({{\bf{u}}}_{2}),{T}_{2}({{\bf{v}}}_{2})\rangle\), then any displacement of the form T2(γ) with γ ∈ Λ2 (the stabilizer lattice) acts trivially on the code space.
Now suppose we apply a displacement T1(α) to mode 1. From equation (2), we notice that to ensure the induced displacement on mode 2 does not affect the output we require that:
The key point is that β was arbitrary in Λ2, so if we define β to be one of the lattice vectors of the GKP code of mode 2 (u2, v2) then:
then \({\tilde{{\bf{u}}}}_{1},{\tilde{{\bf{v}}}}_{1}\) generate a new lattice in mode 1, and any displacement in the group:
can be realized through the beamsplitter interaction from mode 2.
Subsequently, investigate the effect of this transmofrmation of the symplectic form of the generators \({\tilde{{\bf{u}}}}_{1},{\tilde{{\bf{v}}}}_{1}\), assuming ω(u2, v2) = 2πd2. Then:
In order to define a GKP code on mode 1 with stabilizer area ω = 2πd1, the new lattice vectors \({\tilde{{\bf{u}}}}_{1},{\tilde{{\bf{v}}}}_{1}\) must satisfy:
Combining the expressions yields:
This provides a discrete set of values for η where perfect GKP logical transmission is possible. We summarize this result below.
Theorem 1
(Perfect Transmission Under Crosstalk) Let two GKP codes \({{\mathcal{C}}}_{{S}_{1},{d}_{1}},{{\mathcal{C}}}_{{S}_{2},{d}_{2}}\) with stabilizer areas 2πd1 and 2πd2 be encoded in two bosonic modes undergoing crosstalk \({\hat{U}}_{\eta }\). Then there exists a choice of stabilizers for both codes such that the logical information is perfectly preserved if and only if:
The above implies a matching condition between the stabilizer lattices. In particular, if S1 and S2 are generator matrices for the two lattices, then they must be related by:
under the constraint q = q1q2, p = p1p2. This guarantees that each logical mode’s stabilizers are compatible with the crosstalk pattern imposed by mode mixing. One may ask whether adapting the lattices to satisfy the matching condition sacrifices GKP code quality. Importantly, the total lattice area is preserved in the symplectic sense. However, individual codes may require rescaling — effectively increasing the physical extent of their stabilizer generators — to satisfy the rational compatibility constraint:
To understand this constraint, we remind that displacement operators satisfy the canonical commutation relation:
where ω(u, v) = uqvp − upvq is the symplectic form. In a GKP code encoding a qudit of dimension d, the logical operators are chosen as \({\hat{X}}_{d}=\hat{T}({\boldsymbol{u}}/d),{\hat{Z}}_{d}=\hat{T}({\boldsymbol{v}}/d),\) and must obey the Weyl commutation relation:
From the displacement algebra, we also have:
For the two expressions to match, the symplectic area must satisfy:
More generally, for a transformed lattice generated by \(\tilde{{\boldsymbol{u}}},\tilde{{\boldsymbol{v}}}\), with logical operators \({\hat{X}}^{{\prime} }=\hat{T}(\tilde{{\boldsymbol{u}}}/d),{\hat{Z}}^{{\prime} }=\hat{T}(\tilde{{\boldsymbol{v}}}/d)\), one finds:
To preserve the structure of the qudit Weyl algebra, this phase must again be a root of unity:
This condition ensures that the logical operators generate a finite-dimensional unitary representation of the Weyl algebra22,23,24.
Output state structure
In what follows, we would like to understand the structure of the output states and their dependence on the crosstalk parameter in order to design a decoder that is able to retrieve meaningfully the encoded logical information. Accordingly, we analyze the output state resulting from sending two GKP codewords \(\left\vert {\mu }_{1}\right\rangle \otimes \left\vert {\mu }_{2}\right\rangle\) where η is an appropriate rational number for the corresponding code dimensions as highlighted by equation (6). We characterize the structure of the output code, derive explicit expressions for the resulting quantum state, and interpret the emergence of a gauge subsystem both algebraically and operationally. Finally, we provide a decoding strategy to retrieve the logical information in the output states.
Code dimension after crosstalk coupling
Although Theorem 1 establishes when logical information is preserved under crosstalk by identifying suitable transmissivity values η, the following lemma refines this by characterizing the structure of the resulting output codes under these values. Specifically, it shows how the logical codes are embedded in higher-dimensional GKP spaces, quantifying the effective enlargement factor n = q + pd1d2.
Lemma 1
(Output Code Dimensions) Let the input GKP codes be \({{\mathcal{C}}}_{{S}_{1},{d}_{1}}\) and \({{\mathcal{C}}}_{{S}_{2},{d}_{2}}\). Then after crosstalk with η satisfying equation (6), the output state lies in the code basis:
and S3, S4 being the symplectic areas of the output codes.
Proof
Let the input GKP codes \({{\mathcal{C}}}_{{S}_{1},{d}_{1}}\) and \({{\mathcal{C}}}_{{S}_{2},{d}_{2}}\) be defined by stabilizer lattices with lattice vectors (u1, v1) and (u2, v2), satisfying:
These define the logical area of each code. Under the action of the crosstalk, displacement operators transform accrodign to equation (2). To preserve the GKP code structure under this transformation, the stabilizer displacements of one mode must map into stabilizer displacements of the other. A sufficient condition is equation (4) which shows that transformed stabilizers from mode 2 cancel displacements in mode 1, where \((\tilde{{\boldsymbol{u}}},\tilde{{\boldsymbol{v}}})\) denote the transformed stabilizer generators of mode 1 matching the condition in equation (3). The mode remains in a valid GKP code space only if the stabilizer lattice \({\Lambda }_{1}^{{\prime} }={{\rm{Span}}}_{{\mathbb{Z}}}\{\tilde{{\boldsymbol{u}}},\tilde{{\boldsymbol{v}}}\}\) contains a sublattice (u1, v1) such that:
for integers r1, r2, t1, t2. That is, the logical shifts must lie in the 2D plane spanned by the transformed stabilizers. From equation (9), we note that, if we choose \(\alpha ={p}_{1}{d}_{1}{\tilde{{\bf{u}}}}_{1}={q}_{1}{{\bf{u}}}_{1}\) and \(\alpha ={p}_{2}{d}_{1}{\tilde{{\bf{v}}}}_{1}={q}_{2}{{\bf{v}}}_{1}\), and commuting the stabilizers accordign to equation (2), this results in the following relations:
Together this yields that the area of the symplectic area S3 of the output state is:
Applying the same logic to mode 2, we note that the output codes must have symplectic areas:
corresponding to GKP codes \({{\mathcal{C}}}_{{S}_{3},n{d}_{1}}\) and \({{\mathcal{C}}}_{{S}_{4},n{d}_{2}}\). This completes the proof. □
The change of GKP lattices between the input and output following lattice matching conditions and equation (10) is schematized in Fig. 1.
General output state derivation
Since we discovered that the output GKP codes live in a larger space scaled by the factor n = q + pd1d2, which results from the rational structure of the crosstalk parameter η, we have to investigate the structure of the output states in a proper basis.
Theorem 2
(General Output State) Let \({\alpha }_{1},{\alpha }_{2}\in {\mathbb{Z}}\) satisfy the Bézout identities:
Then the output of the mode mixing Uη applied to the input state \(\left\vert {\mu }_{1}\right\rangle \otimes \left\vert {\mu }_{2}\right\rangle\) is:
where the output states belong to \({{\mathcal{C}}}_{n{d}_{1}}\otimes {{\mathcal{C}}}_{n{d}_{2}}\).
Proof
We begin with input GKP codewords \(\left\vert {\mu }_{1}\right\rangle \in {{\mathcal{C}}}_{{d}_{1}}\), \(\left\vert {\mu }_{2}\right\rangle \in {{\mathcal{C}}}_{{d}_{2}}\), which can be formally written as superpositions over lattice displacements:
The logical operator \({\hat{X}}_{i}\) corresponds to a displacement Ti(ui/di). Applying Uη to the tensor product of these two codewords yields:
Using the transformation law under the beamsplitter:
each term becomes:
where the displacement vectors are:
and \(\left\vert 0,0\right\rangle ={U}_{\eta }\left\vert 0\right\rangle \left\vert 0\right\rangle\). Simplifying the displacement vectors, we noted previously that the stabilizer lattice vector of the outputs are
and that:
we arrive at:
with the same relations and with the use of the fact that the output GKP states are considered mod n and mod n, we obtain the output vacuum state in terms of the basis vectors \(\left\vert {\mu }_{3}\right\rangle\) and \(\left\vert {\mu }_{4}\right\rangle\) as:
Applying the necessary translations with vectors in equation (17), we obtain:
considering the states now are left mod d1 and mod d2 respectively, and using the Diophantine equations:
so that \({\mu }_{i}{\alpha }_{i}n\equiv {\mu }_{i}\,{\mathrm{mod}}\,\,{d}_{i}\) We get:
which proves the theorem.
This specific structure ensures that the logical information (μ1, μ2) is encoded into distinct cosets in the enlarged lattices. It also ensures that the index j sweeps over the gauge orbit corresponding to a subgroup of the full lattice that does not alter the logical labels. □
We note that the enlargement of the stabilizer lattices introduces a gauge degree of freedom that increases the size of the decoding space. While the logical subspace remains of dimension d1 × d2, the physical lattice now supports n gauge cosets, which can increase decoding complexity. In particular, minimum distance decoding must resolve among n degenerate candidates, potentially raising the complexity from \({\mathcal{O}}(d)\) to \({\mathcal{O}}(n\cdot d)\) in the worst case. This overhead is mitigated if gauge fixing is applied prior to logical decoding, as will be discussed subsequentely.
Corollary 1
(Symmetric Case) In the symmetric setting where d1 = d2 = d, q1 = q2 = 1, p1 = p2 = 1, and α1 = α2 = 1, the output simplifies to:
Proof
We consider the general output state from the previous theorem:
and impose the symmetric assumptions:
Under these conditions, we substitute:
Then the expression becomes:
This is a superposition over n values, with step size d in both modes, and offsets determined by μ1, μ2, each scaled by n, consistent with embedding the logical indices into \({{\mathcal{C}}}_{nd}\otimes {{\mathcal{C}}}_{nd}\). Thus, the output state lies in \({{\mathcal{C}}}_{nd}\otimes {{\mathcal{C}}}_{nd}\) and has the simplified form claimed. □
Gauge degrees of freedom and symmetry
In order to retrieve the logical information encoded in the GKP codes, we would like to understand the possibility of decoupling the logical degrees of freedom from the gauge degrees of freedom, to be able to retrieve the logical information witout any gauge coupling.
Theorem 3
(Gauge Subsystem Structure) The output state \(\left\vert {\mu }_{1},{\mu }_{2}\right\rangle\) admits a factorization of the form:
where:
\({\left\vert {\mu }_{1},{\mu }_{2}\right\rangle }_{L}\) encodes the logical state in \({{\mathcal{H}}}_{{d}_{1}}\otimes {{\mathcal{H}}}_{{d}_{2}}\),
\(\left\vert {\Phi }_{n}\right\rangle =\frac{1}{\sqrt{n}}\mathop{\sum }\nolimits_{j = 0}^{n-1}\left\vert j\right\rangle \otimes \left\vert j\right\rangle\) is a maximally entangled state in the gauge subsystem \({{\mathcal{H}}}_{n}\otimes {{\mathcal{H}}}_{n}\),
The decomposition holds: \({{\mathcal{C}}}_{n{d}_{1}}\otimes {{\mathcal{C}}}_{n{d}_{2}}\cong {{\mathcal{H}}}_{{d}_{1}}\otimes {{\mathcal{H}}}_{n}\otimes {{\mathcal{H}}}_{{d}_{2}}\otimes {{\mathcal{H}}}_{n}\).
Proof
We start with the general form of the output state derived in the previous theorem:
with all terms in the Hilbert space \({{\mathcal{C}}}_{n{d}_{1}}\otimes {{\mathcal{C}}}_{n{d}_{2}}\), which has total dimension nd1 × nd2.
We aim to show that this state admits a decomposition into a logical component and a gauge-entangled component. To do so, we define a bijective relabeling of the basis of \({{\mathcal{C}}}_{n{d}_{i}}\cong {{\mathcal{H}}}_{{d}_{i}}\otimes {{\mathcal{H}}}_{n}\) via the map:
where r1 = p2d1d2, r2 = q1d2, and \(j\in {{\mathbb{Z}}}_{n}\). This map is well-defined because the terms μiαin span a sublattice of spacing n, and the shifts jri span cosets within that lattice, labeling the gauge degree of freedom.
We now define a new basis for the enlarged code space:
so that the full state becomes:
Regrouping:
We identify the first tensor factor as the logical state \({\left\vert {\mu }_{1},{\mu }_{2}\right\rangle }_{L}\in {{\mathcal{H}}}_{{d}_{1}}\otimes {{\mathcal{H}}}_{{d}_{2}}\), and the second factor as a maximally entangled Bell-like state \(\left\vert {\Phi }_{n}\right\rangle \in {{\mathcal{H}}}_{n}\otimes {{\mathcal{H}}}_{n}\), defined by:
Therefore, the state admits a decomposition:
and the total space decomposes as:
□
Lemma 2
(Symmetry Origin of Gauge Subsystem) The gauge subsystem arises from the residual symmetry induced by the mode mixing on the stabilizer structure. Define the input stabilizer lattices Λ1, Λ2 and let Λlogical ⊂ Λ1 ⊕ Λ2 denote the sublattice that preserves logical equivalence. Then:
is a finite Abelian group of order n acting on the gauge index j. This symmetry results in maximal entanglement between the gauge subsystems.
Proof
Let \({\Lambda }_{1},{\Lambda }_{2}\subset {{\mathbb{R}}}^{2}\) be the input stabilizer lattices of the two GKP codes \({{\mathcal{C}}}_{{d}_{1}}\) and \({{\mathcal{C}}}_{{d}_{2}}\). These lattices are generated by primitive vectors (u1, v1), (u2, v2) satisfying symplectic conditions:
The stabilizer group of the joint system is Λ1 ⊕ Λ2, i.e., the product lattice of displacements acting on both modes.
When the two modes interact through a crosstalk Uη, the phase-space coordinates transform linearly:
This transformation mixes the lattices Λ1, Λ2 into a coupled sublattice in \({{\mathbb{R}}}^{4}\), generating new displacement operators acting nontrivially across both modes. However, not all elements of Λ1 ⊕ Λ2 map to distinct logical states in the output code. There exists a sublattice Λlogical ⊂ Λ1 ⊕ Λ2 consisting of those displacement combinations that ct trivially on the logical space, i.e., leave logical states invariant up to stabilizer equivalence, and that commute with the logical operators of the output code \({{\mathcal{C}}}_{n{d}_{1}}\otimes {{\mathcal{C}}}_{n{d}_{2}}\). Hence, the quotient group
classifies the inequivalent cosets of logical actions modulo stabilizer redundancy. By construction, G is a finite Abelian group. Its order is given by:
since the logical lattice scales by a factor of n due to the mode mixing-induced enlargement of the stabilizer unit cell (as previously shown in the output code dimension lemma). This finite group G acts transitively on the label j that indexes the gauge orbit in the output state:
Thus, the existence of the gauge subsystem arises from this residual symmetry: different elements of the quotient G correspond to gauge-equivalent configurations of logical information that are indistinguishable by any logical observable. The entanglement of the gauge subsystems reflects the nontrivial correlation between these symmetry orbits across both modes. □
Gauge fixing and logical recovery
Having the output state depending on the gauge degrees of freedom, does not allow for perfect recovery of the logical information unless the gauge is fixed and then is collapsed to one of its orbits. In what follows we provide an existence argument of such gauge fixing decoder.
Theorem 4
(Gauge Fixing Procedure) Let \(\vert {\psi }_{{\mu }_{1},{\mu }_{2}}\rangle\) be the output state as above. Then there exists a unitary Ugauge-fix acting on \({{\mathcal{C}}}_{n{d}_{1}}\otimes {{\mathcal{C}}}_{n{d}_{2}}\) such that:
where \(\left\vert {\mu }_{1}\right\rangle ,\left\vert {\mu }_{2}\right\rangle\) are logical states in \({{\mathcal{C}}}_{{d}_{1}},{{\mathcal{C}}}_{{d}_{2}}\), and \({\left\vert 0\right\rangle }_{G}\) is a fixed state in the gauge register. The unitary Ugauge-fix is constructible from modular arithmetic operations and GKP logical Clifford gates (e.g., modular multiplication, modular subtraction, controlled shift).
Proof
We begin with the output state of the form derived earlier:
where r1 = p2d1d2, r2 = q1d2, and \({\alpha }_{i}\in {\mathbb{Z}}\) satisfy the Bézout identities. This state lies in the Hilbert space \({{\mathcal{C}}}_{n{d}_{1}}\otimes {{\mathcal{C}}}_{n{d}_{2}}\), which we know decomposes as:
We aim to apply a unitary transformation Ugauge-fix that maps the entangled gauge part into a separable form and re-expresses the state as:
To construct this unitary, observe that the terms μ1α1n + jr1 index states of the form:
under the identification:
Hence, the full state is:
Define the unitary Ugauge-fix as follows:
Apply modular inverse multiplication: \(j\,\mapsto {r}_{i}^{-1}j\,{\mathrm{mod}}\,\,n\), to bring gauge indices into canonical form 0, 1, …, n − 1,
Use a controlled modular subtraction to align both gauge indices,
Shift the gauge register into a basis where \(\left\vert j\right\rangle \otimes \left\vert j\right\rangle \mapsto \left\vert 0\right\rangle \otimes \left\vert j\right\rangle\),
Then discard (or reinitialize) the second register.
All these operations can be constructed from GKP logical Clifford unitaries:
Modular multiplication and inverses can be implemented via shift and scaling gates,
Controlled modular subtraction is a Clifford operation on GKP codes,
Basis change from entangled to separable form is equivalent to a Bell-to-product basis transformation.
After applying Ugauge-fix, we obtain:
with \({\left\vert 0\right\rangle }_{G}\) a fixed state (e.g., the zero state in the canonical basis of \({{\mathcal{H}}}_{n}\)). □
Operational construction of the decoder
A summary of an operational construction of the decoder, for gauge fixing the output state to recover the logical state, is highlighted in Fig. 2, and is given as follows:
Ancilla Preparation: Initialize two ancillary GKP modes, each with Hilbert space dimension nd1 and nd2, respectively, in the logical vacuum state \(\left\vert 0\right\rangle\).
Entangling Coupling: Apply modular controlled-X (CX) gates from each output mode to its respective ancilla. These gates act as \({\mathsf{\text{CX}}}:\left\vert x\right\rangle \left\vert 0\right\rangle \mapsto \left\vert x\right\rangle \left\vert x\right\rangle \,\mathrm{mod}\,\,n{d}_{i}\), entangling the mode and ancilla. The shared gauge index j is thus encoded redundantly in both ancillas.
Measurement: Measure the ancillas in the computational basis, yielding outcomes:
modulo nd1 and nd2, respectively. These results reveal the value of the gauge index \(j\,{\mathrm{mod}}\,\,n\) via modular inversion:
since gcd(r1, n) = gcd(r2, n) = 1 by construction, hence this is a physical unitary gate.
Feedback Correction: Apply modular displacement gates (logical \(\bar{X}\) or \(\bar{Z}\)) to the output modes, conditioned on the measured value of j. These correct for the gauge entanglement, mapping:
This is equivalent to applying a modular shift \(-j{r}_{i}\,\mathrm{mod}\,\,n{d}_{i}\), which is a GKP logical Clifford operation.
Gauge Reset: After correction, the ancillas are disentangled from the logical system. They can be reinitialized to \(\left\vert 0\right\rangle\), discarded, or traced out. The logical state is now in canonical form.
This sequence constitutes an operational realization of the unitary gauge-fixing map Ugauge-fix, acting unitarily and reversibly on the joint system, up to classical feedforward corrections based on the gauge index j. It is worth-noting that the above gauge-fixing protocol assumes that the receiver knows the gauge dimension n, which depends on the rational structure of the average mode-mixing strength η, but no information on the stochastic crosstalk behavior. In scenarios without channel state information (CSI), this value is unknown, and modular inversion or correction cannot be deterministically applied. Therefore, this decoding method is valid in the with-CSI regime. Extending gauge correction to the no-CSI setting would require adaptive or statistical decoding strategies beyond the scope of this paper.
Discussion
In what follows, we illustrate the practical implications of the multiplexing structure and rational transmissivity conditions by computing fidelity upper bounds for finite-energy GKP states under cross-talk and Gaussian noise. We consider a scenario where two independent GKP encoded EPR pairs prepared in parallel: one between parties A and A’, and the other between B and B’. Each half-pair, A’ and B’, is transmitted through a shared channel with passive crosstalk with parameter \(\eta =\frac{q}{q+p{d}^{2}}\). The other halves, A and B, are held locally. The scenario is illustrated in Fig. 3
We consider transmitted GKP encoded EPR shares \(\left\vert {\mu }_{1}\right\rangle\) and \(\left\vert {\mu }_{2}\right\rangle\) affected by crosstalk modeled by a beam splitter of transmitivity η. The two modes then are affected by displacement gaussian noise. Upon reception, an ideal disjoint decoding scheme as described in the text, tracing out the gauge degrees of freedom, is applied.
The joint state before transmission is:
After encoding and crosstalk interaction, the transmitted shares transform as:
where r1 = p2d1d2, r2 = q1d2, and α1 = α2 = 1. For example, with d1 = d2 = 2, \(\eta =\frac{1}{5}\), n = 5, the output becomes:
We assume a standard GKP error model where noise acts via random phase-space displacements drawn from an isotropic Gaussian distribution. A single-mode displacement noise channel with variance σ2 is modeled as:
with the Gaussian distribution for the displacement channel given by:
This model captures thermal or stochastic noise affecting position and momentum symmetrically, and is appropriate for modeling finite-energy GKP states under Gaussian channels.
Assuming exact rational transmissivity (i.e., perfect lattice matching), the decoding fidelity for a single GKP mode under Gaussian noise is the probability that the displacement remains within the Voronoi cell of the nearest lattice point. For square GKP lattices, this leads to:
For a two-mode product GKP code \({{\mathcal{C}}}_{{d}_{1}}\otimes {{\mathcal{C}}}_{{d}_{2}}\), the joint fidelity is simply the square of the individual success probabilities:
This expression assumes ideal (infinite-energy) GKP decoding in the absence of lattice mismatches.
In Fig. 4, the fidelity landscape as function of η and noise Level σ is given. We compute an upper bound on the entanglement fidelity Fe(η, σ2) of the GKP code under Gaussian noise and cross-talk, where rational transmissivity points of the form \(\eta =\frac{q}{q+p{d}_{1}{d}_{2}}\) are expected to support exact code embedding. The effective fidelity is bounded by:
where δ(η, ηi) = η − ηi∣L is the geometric mismatch between the actual η and rational alignment points ηi, scaled by a lattice parameter L. The color plot is produced across a grid of η and σ, with bright bands indicating regions of high-fidelity transmission centered around rational η-values, with exponential decay in the neighberhood of each peak. In comparison to non-encoded EPR pairs in Fig. 5, we notice that bosonic encoding of EPR pairs via GKP codes improve drastically the fidelity of entanglement multiplexing in the presence of mode mixing crosstalk (XX coupling between polarization encoded EPR’s), especially when the mixing is maximal around η = 0.5.
Figure 6, a simulation of the trade-off between code dimension and fidelity was carried. We fix a rational alignment \(\eta =\frac{q}{q+p{d}^{2}}\) with d = d1 = d2, and explore the decay in entanglement fidelity Fe as d increases. The fidelity decays with increasing code dimension due to reduced spacing between lattice points and increased sensitivity to noise. Each curve corresponds to a fixed noise level σ, and rational transmissivity points η(d) are annotated for interpretation. Polynomial fits highlight smooth decay behavior, illustrating the trade-off between code rate (larger d) and achievable fidelity.
These simulations confirm the analytical expectations that high-fidelity code transmission occurs near rational values of η, consistent with the gauge-based embedding theory. The numeric exploration also shows how fidelity decreases with code size due to practical effects of Gaussian noise, emphasizing the role of rational η tuning and finite squeezing in real devices. We note that for both simulations, the ideal decoder from the previous section was considered, which is not optimal in the presence of displacement gaussian noise.
To summarize, we have presented a framework for mitigating crosstalk in multiplexed quantum communication systems using GKP encoding. By embedding DV quantum information into CV modes, we identified precise lattice-matching conditions under which logical information can be preserved despite mode-mixing interactions. A key result is the identification of rational transmissivity values that allow the joint stabilizer structure to be preserved, enabling crosstalk-immune communication. Our work establishes a foundation for crosstalk-aware encoding in quantum networks based on CV hardware and opens up new directions in entanglement distribution through structured code design. Importantly, the principles and techniques developed here for crosstalk-resilient multiplexing are directly applicable to the development of robust Quantum MIMO communication systems, which are critical for future high-capacity quantum networks. Additionally, we proposed an explicit decoder that leverages the symplectic structure of the output state, decomposes it into logical and gauge components, and applies a modular arithmetic-based recovery procedure. While this decoder is effective in idealized conditions, it is suboptimal in the presence of Gaussian displacement noise and stochasticity of the crosstalk.
Future work will investigate optimized decoding strategies that account for physical noise models, including error rates and channel-specific distortions, particularly within the context of Quantum MIMO channels. In particular, we aim to adapt the decoder to scenarios with no CSI, where the average mode mixing η is unknown. Such robust decoding would enable practical implementation of GKP-based crosstalk mitigation in dynamic network environments and pave the way for truly scalable Quantum MIMO communications. We also plan to explore the direct application of these crosstalk mitigation strategies in full Quantum MIMO architectures, including the optimization of encoding and decoding schemes for multiple spatial modes.
Specifically, the proposed framework for crosstalk-resilient GKP encoding and decoding has potential applications in advanced quantum communication systems. In multicarrier CVQKD scenarios, such as those described in refs. 25,26, the use of multiple bosonic modes with orthogonal or partially overlapping spectral-temporal support introduces natural cross-mode interactions. Our method could be used to protect quantum information across such multi-carrier structures, improving the stability and scalability of secret key generation. Furthermore, in the context of the quantum internet, where quantum information must traverse large-scale networks with imperfect isolation between channels, our approach may support modular quantum repeaters or MIMO-like quantum transceivers that manage interference while maintaining high logical fidelity. These directions motivate future work on integrating our decoder into practical error correction and channel estimation pipelines.
Moreover, our proposed scheme marks an important step toward realizing scalable and resilient quantum repeater networks, a foundational requirement for the quantum internet. By mitigating both loss-induced degradation and inter-mode crosstalk, our framework ensures that high-fidelity logical information can be transmitted even in dense multiplexed settings. This resilience is particularly crucial for enabling parallel entanglement distribution across large-scale networks7, where uncontrolled interference would otherwise be a major bottleneck. In this sense, our results not only establish a coding-theoretic foundation for robust Quantum MIMO but also directly contribute to the design of modular, fault-tolerant quantum repeaters. Looking ahead, extending this framework to fully all-photonic repeater architectures based on GKP codes could provide a powerful path to long-distance, hardware-efficient quantum communication. Such advances would consolidate the role of GKP encodings as a unifying bridge between discrete-variable protocols and continuous-variable hardware, further accelerating progress toward a practical quantum internet27,28.
Methods
Here we give an overview of the main techniques used to establish our results.
GKP States and logical encoding
Here, we introduce our notations and the GKP states. For a bosonic mode with creation and annihilation operators \(\hat{a}\) and \({\hat{a}}^{\dagger }\) satisfying \([\hat{a},{\hat{a}}^{\dagger }]=1\), the quadrature operators are
The translation operator in the phase space is defined as
where \({\boldsymbol{u}}=({u}_{q},{u}_{p})\in {{\mathbb{R}}}^{2}\) is the displacement vector. Notice that \(\hat{T}({\boldsymbol{u}})=\hat{D}(({u}_{q}+i{u}_{p})/\sqrt{2})\), where \(\hat{D}(\alpha )=\exp (\alpha {\hat{a}}^{\dagger }-{\alpha }^{* }\hat{a})\) is the usual displacement operator. The commutation relation is
where the phase \(\omega ({\boldsymbol{u}},{\boldsymbol{v}})={u}_{q}{v}_{p}-{u}_{p}{v}_{q}=\det \left(\begin{array}{rc}{u}_{q}&{u}_{p}\\ {v}_{q}&{v}_{p}\end{array}\right)\) is the oriented area of the parallelogram spanned by vectors u and v.
GKP states are defined as states that are invariant under certain phase space displacements. Given two displacement operators \({\hat{S}}_{X}=\hat{T}({\boldsymbol{u}})\) and \({\hat{S}}_{Z}=\hat{T}({\boldsymbol{v}})\), the states that are invariant under the stabilizers \({\hat{S}}_{X}\) and \({\hat{S}}_{Z}\) form a d-dimensional GKP code space14,29:
if the area ω(u, v) = 2πd and d is an integer. We can equivalently denote a GKP code as \({{\mathcal{C}}}_{d,{\bf{S}}}\) where S is the normalized basis matrix for the GKP lattice defined as
It is easy to see that S is a 2 × 2 symplectic matrix since \(\det ({\bf{S}})=1\), i.e., The condition of having det(S) = 1 is sufficient in this case, because by construction S preserves the lattice area. Throughout the paper, we will interchangeably use the notation \({\mathcal{C}}({\boldsymbol{u}},{\boldsymbol{v}})\) or \({{\mathcal{C}}}_{d,{\bf{S}}}\) to represent a GKP code based on convenience.
The logical operators for a GKP code \({\mathcal{C}}({\boldsymbol{u}},{\boldsymbol{v}})\) are \(\hat{X}=\hat{T}({\boldsymbol{u}}/d)\) and \(\hat{Z}=\hat{T}({\boldsymbol{v}}/d)\), satisfying \(\hat{X}\hat{Z}={e}^{2\pi i/d}\hat{Z}\hat{X}\). We choose the eigenstates \(\left\vert \mu \right\rangle ,\mu =0,\ldots ,d-1\) of \(\hat{Z}\) as the basis states of the GKP code \({\mathcal{C}}({\boldsymbol{u}},{\boldsymbol{v}})\), where
Without loss of generality, we consider square lattice GKP codes. Any other lattice with the same phase space area is equivalent via a rotation, offering no inherent advantage. For a square lattice GKP code \({{\mathcal{C}}}_{d,{\bf{S}}}\) where \({\bf{S}}={{\mathbb{I}}}_{2}\) is the 2 × 2 identity matrix, the basis states in the position space are
The logical operators for a square lattice GKP code \({{\mathcal{C}}}_{d,{\bf{S}}}\) are
Finally, when d = 1, the GKP state \(\left\vert \mu =0\right\rangle\) is called a qunaught state since it does not carry any quantum information.
We now consider two GKP-encoded modes, labeled A and B, each carrying logical information via lattices defined by vectors (fA, gA) and (fB, gB) respectively. The logical operators for each mode are:
These operators generate the logical Pauli group for an embedded di-dimensional DV system within each CV bosonic mode. The eigenstates of \({\hat{Z}}_{i}\) serve as the computational basis \({\{{\left\vert \mu \right\rangle }_{i}\}}_{\mu = 0}^{{d}_{i}-1}\), which are localized along a one-dimensional lattice in phase space. The logical operator \({\hat{X}}_{i}\) acts as a shift between these basis states, while \({\hat{Z}}_{i}\) applies a phase. Together, \({\hat{X}}_{i}\) and \({\hat{Z}}_{i}\) satisfy the Weyl commutation relation:
mirroring the algebra of qudit Pauli operators. In this way, the GKP code enables encoding of DV logical states (such as qubits or qudits) into structured CV states.
Transmission model
We model the crosstalk arising from mode mixing interfecrence by a beam splitter \({\hat{U}}_{\eta }\), jointly transforming the modes, while η relflecting the strength of mode mixing is considered to be stochastic. The beam splitter model, schematized in Fig. 7, acts as a linear symplectic transformation:
where η is modeled by a log-normal distribution, characterized by the probability density function:
with μ being the mean of \(\cos \eta\), and σc is its standard deviation reflecting the strength of fading. This operation introduces undesired correlation between the two modes A and B reflected in the displacement, which potentially disrupts independent logical recovery. The effect of this crosstalk mixing on the lattice vectors is highlighted in Fig. 8.
Data availability
No datasets were generated or analysed during the current study.
References
Kimble, H. J. The quantum internet. Nature 453, 1023–1030 (2008).
Wehner, S., Elkouss, D. & Hanson, R. Quantum internet: a vision for the road ahead. Science 362, eaam9288 (2018).
Koudia, S. The quantum internet: an efficient stabilizer states distribution scheme. Phys. Scr. 99, 015115 (2023).
Vischi, M., Di Bartolomeo, G., Proietti, M., Koudia, S., Cerocchi, F., Dispenza, M. & Bassi, A.Simulating photonic devices with noisy optical elements. Phys. Rev. Res. 6, 033337 (2024).
Wengerowsky, S., Joshi, S. K., Steinlechner, F., Hübel, H. & Ursin, R. An entanglement-based wavelength-multiplexed quantum communication network. Nature 564, 225–228 (2018).
Seshadreesan, K. P., Krovi, H. & Guha, S. Continuous-variable quantum repeater based on quantum scissors and mode multiplexing. Phys. Rev. Res. 2, 013310 (2020).
Oleynik, L., Koudia, S., Bayraktar, M. & Chatzinotas, S. Diversity and multiplexing in quantum MIMO channels. EPJ Quantum Technol. 12, 1–11 (2025).
J. U. Rehman, S. M. A. Rizvi, S. Koudia, S. Chatzinotas and H. Shin, MIMO Quantum Communication in Correlated Pure-Loss Channels, in IEEE Communications Letters, vol. 29, no. 7, pp. 1544−1548, July 2025.
Koudia, S., Oleynik, L., ur Rehman, J. & Chatzinotas, S. Spatial-mode diversity and multiplexing for continuous variables quantum communications. Commun. Phys. 8, 351 (2025).
Wang, Z., Ralph, T. C., Aguinaldo, R. & Malaney, R. Exploiting spatial diversity in earth-to-satellite quantum-classical communications. IEEE Trans. Commun. (2025).
Hoch, F. et al. Quantum machine learning with adaptive boson sampling via post-selection. Nat. Commun. 16, 902 (2025).
Koudia, S., Oleynik, L., Bayraktar, M.& Chatzinotas, S. Physical layer aspects of quantum communications: A survey. arXiv preprint arXiv:2407.09244 (2024).
Gottesman, D., Kitaev, A. & Preskill, J. Encoding a qubit in an oscillator. Phys. Rev. A 64, 012310 (2001).
Conrad, J., Eisert, J. & Arzani, F. Gottesman-kitaev-preskill codes: a lattice perspective. Quantum 6, 648 (2022).
Grimsmo, A. L. & Puri, S. Quantum error correction with the Gottesman-Kitaev-Preskill code. PRX Quantum 2, 020101 (2021).
Wang, Z. & Jiang, L. Passive environment-assisted quantum communication with GKP states. Physic. Rev. X 15, 021003 (2025).
Schmidt, F. & van Loock, P. Quantum error correction with higher Gottesman-Kitaev-Preskill codes: Minimal measurements and linear optics. Phys. Rev. A 105, 042427 (2022).
Larsen, M. et al. Integrated photonic source of Gottesman–Kitaev–Preskill qubits. Nature 1–5 (2025).
Labarca, L., Baptiste, R. & Blais, A. Quantum Metrology With Finite-energy GKP States, Vol. 2024, N52–005 (APS March Meeting 2024, 2024).
Schmidt, F., Miller, D. & van Loock, P. Error-corrected quantum repeaters with Gottesman-Kitaev-Preskill qudits. Phys. Rev. A 109, 042427 (2024).
Fukui, K., Alexander, R. N. & van Loock, P. All-optical long-distance quantum communication with Gottesman-Kitaev-Preskill qubits. Phys. Rev. Res. 3, 033118 (2021).
Nielsen, M. A. & Chuang, I. L.Quantum Computation and Quantum Information (Cambridge University Press, 2000).
Samuel, J. Projective representations and the quantum theory of charges. Pramana 12, 609–618 (1979).
Reed, M. & Simon, B. Methods of Modern Mathematical Physics, Vol. II: Fourier Analysis, Self-Adjointness (Academic Press, 1975).
Gyongyosi, L. & Imre, S. Multiple access multicarrier continuous-variable quantum key distribution. Chaos Solit. Fractals 114, 491–505 (2018).
Gyongyosi, L. Multicarrier continuous-variable quantum key distribution. Theor. Comput.Sci. 816, 67–95 (2020).
Gyongyosi, L. & Imre, S. Networked quantum services. Quantum Inf. Comput. 25, 97–140 (2025).
Gyongyosi, L. & Imre, S. Advances in the quantum internet. Commun. ACM 65, 52–63 (2022).
Mensen, L. J., Baragiola, B. Q. & Menicucci, N. C. Phase-space methods for representing, manipulating, and correcting Gottesman-Kitaev-Preskill qubits. Phys. Rev. A 104, 022408 (2021).
Acknowledgements
This work was supported by the project Lux4QCI (GA 101091508) funded by the Digital Europe Program, and the project LUQCIA Funded by the European Union – Next Generation EU, with the collaboration of the Department of Media, Connectivity and Digital Policy of the Luxembourgish Government in the framework of the RRF program.
Author information
Authors and Affiliations
Contributions
S.K. carried the analysis and wrote the paper. S.K. and S.C. discussed the methods and the results and revised the manuscript. S.C. supervised the work.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/.
About this article
Cite this article
Koudia, S., Chatzinotas, S. Crosstalk-resilient quantum MIMO for scalable quantum communications. npj Quantum Inf 11, 162 (2025). https://doi.org/10.1038/s41534-025-01113-x
Received:
Accepted:
Published:
Version of record:
DOI: https://doi.org/10.1038/s41534-025-01113-x










