---
title: Quantum Code-Division Multiple Access
url: https://www.emergentmind.com/topics/quantum-code-division-multiple-access-q-cdma
type: topic
---

# Quantum Code-Division Multiple Access

Searching arXiv for the cited q-CDMA papers to ground the article in current literature.
Quantum code-division multiple access (q-CDMA) denotes a family of quantum networking and communication schemes in which multiple sender–receiver pairs share a common physical transmission medium while distinguishing users by code-domain operations rather than by strict separation in time, frequency, or wavelength. Across the literature, q-CDMA is realized by applying user-specific unitary spreading operations to quantum states, transmitting the encoded states through a shared quantum channel or star-coupler, and then applying matched decoding operations that recover the intended user while suppressing cross-talk from other users. The concept appears in several forms, including chaotic phase encoding with chaos synchronization for shared-channel quantum transmission [1204.1742], direct-sequence single-photon spread-spectrum multiplexing with add–drop functionality [1401.1756], code-division architectures for QKD networks [1112.3218], and continuous-variable quantum key distribution (CV-QKD) based on chaotic phase shifters in a two-user setting [2502.09019].

## 1. Conceptual basis and historical formulations

The central q-CDMA idea is to map the classical code-division principle into the quantum domain by replacing classical spreading sequences or spectral masks with quantum-compatible unitary transformations. In the 2012 formulation of “Quantum internet using code division multiple access,” each sender \(k\) applies a chaotic phase modulation generated by a “chaotic phase shifter,” with interaction Hamiltonian
\[
U_k=\exp\!\Bigl[-\,i\!\int_0^T f_k(t)\,a_k^\dagger a_k\,dt\Bigr],
\]
so that an input state \(\ket{\psi_k}\) acquires a broadband time-dependent phase \(\theta_k(t)=\int_0^t f_k(\tau)\,d\tau\) and its spectral content is spread over a large band [1204.1742]. At the receiver, a synchronized inverse operation
\[
U_k^{-1}=\exp\Bigl[ +\,i\!\int_0^T f_k(t)\,a_k^\dagger a_k\,dt\Bigr]
\]
recovers the intended state [1204.1742].

A distinct direct-sequence single-photon formulation was given in “Quantum spread spectrum multiple access,” where each user \(i\) is assigned a binary code \(c_i\in\{\pm1\}^S\), and spreading is implemented by unitary phase modulators acting on \(S\) successive chip intervals of a single-photon wavepacket. The corresponding unitary
\[
U_i=\exp\!\Bigl[
i\sum_{k=1}^S \phi_i(k)\,\int_{(k-1)\Delta t}^{k\Delta t}\!
\hat a^\dagger(t)\hat a(t)\,dt
\Bigr]
\]
applies chip-dependent phases \(0\) or \(\pi\), and despreading is achieved by applying \(U_i\) again, using \(U_i^\dagger=U_i\) and \(U_i^2=\openone\) up to an overall phase [1401.1756].

In QKD networking, “Multiple-Access Quantum Key Distribution Networks” treated quantum CDMA as a multi-user access method in which each raw key bit is replaced by a superposition of \(w\) sub-pulses (“chips”) of mean photon number \(\mu/w\), with Optical Orthogonal Codes (OOCs) of length \(N\) and weight \(w\) controlling chip occupancy [1112.3218]. This line of work emphasized medium-access behavior, collision statistics, and key-rate optimization rather than coherent phase recovery.

A later spectral formalization, “Quantum CDMA Communication Systems,” described q-CDMA in terms of continuous-mode pure states of light whose spectral amplitudes \(\xi(\omega)\) are encoded by pseudorandom spectral phase masks \(\phi_k(\omega)\), implemented by dispersing the pulse, imposing piecewise phases on each of the \(N_c\) chips, and recombining [2106.10028]. This formulation unified coherent-state and number-state signaling under a common operator framework.

The 2025 two-user CV-QKD proposal explicitly specialized q-CDMA to Gaussian-modulated coherent states and reverse-reconciliation security analysis. There, two senders \((\text{Alice}_{1,2})\) encode their states using chaotic phase shifters, combine them on a 50:50 beam splitter, send the multiplexed state through a lossy quantum channel under an entangling-cloner attack, and decode at matched receivers \((\text{Bob}_{1,2})\) through chaos synchronization [2502.09019].

## 2. Physical realizations of spreading, multiplexing, and decoding

Two implementation families dominate the q-CDMA literature: chaotic phase encoding and direct-sequence chip coding.

In the chaotic-phase family, each sender modulates the phase of its optical mode with a broadband classical chaotic drive. In the two-user CV-QKD system, the output field \(\hat a_i\) passes through a chaotic phase shifter \(\text{CPS}_i\), whose instantaneous classical drive \(\delta_i(t)\) induces a phase \(\theta_i(t)=\int_0^t\delta_i(\tau)d\tau\). Under the Hamiltonian \(H=\hbar\,\delta_i\,\hat a_i^\dagger \hat a_i\), the annihilation operator transforms as
\[
\hat a_i'=\hat a_i e^{-i\theta_i(t)}.
\]
The encoded outputs are then mixed on a 50:50 beam splitter according to
\[
\hat a_5=\frac{\hat a_1'+\hat a_2'}{\sqrt2},\qquad
\hat a_6=\frac{\hat a_1'-\hat a_2'}{\sqrt2},
\]
and, after transmission, decoded by matched chaotic phase shifters satisfying \(\delta_1=\delta_3\) and \(\delta_2=\delta_4\), so that the imposed phase is removed at the intended receiver [2502.09019].

The same broad structure underlies the entanglement-distribution protocol of Zhu et al., where electro-optic modulators (EOMs) driven by chaotic Colpitts circuits apply broadband chaotic phase shifts, beam splitters multiplex and demultiplex the users, and synchronized receiver-side phase shifts cancel the sender-side masking [1507.02004]. In that work, independent chaotic phase shifts are “almost uncorrelated,” enabling two pairs of users to share a single quantum channel [1507.02004].

In the direct-sequence family, spreading is defined over chip intervals. In the Garcia-Escartin–Chamorro-Posada add–drop architecture, each photon’s wavefunction is segmented into \(S\) chips of duration \(\Delta t=T/S\), and user-specific phase modulators impose code-controlled phases on each chip [1401.1756]. Orthogonality follows from code design:
\[
\langle\phi_i|\phi_j\rangle
=\frac1S\sum_{k=1}^S c_i(k)c_j(k)
=\delta_{ij},
\]
in the ideal, lossless limit [1401.1756]. Optical circulators and Fiber Bragg gratings (FBGs) then implement add–drop multiplexing: a user’s narrowband despread photon is reflected into or out of the shared fiber, while the spread photons of other users are largely transmitted [1401.1756].

Sharma and Banerjee described a related OADM architecture using two optical circulators and an FBG. Their phase modulators impose phase shifts \(\{0,\pi/2,\pi,-\pi/2\}\) on the \(S\) time bins, with spreading codes drawn from maximal-length sequences generated by an \(n\)-stage Linear-Feedback Shift Register, so that \(S=2^n-1\) [1905.12829]. The receiver uses despreading and Gaussian-shaped FBG filtering to recover the desired photon while suppressing adjacent-channel overlap and spread noise [1905.12829].

A more general spectral implementation appears in the continuous-mode formalism of Rezai and Salehi, in which each encoding operator is
\[
\hat U_{\rm enc}^{(k)}[\phi_k(\omega)]
=
\exp\!\Bigl[-\,i\!\int d\omega\,\phi_k(\omega)\,\hat a^\dagger(\omega)\hat a(\omega)\Bigr],
\]
with inverse decoding given by its adjoint. Under encoding, \(\hat a^\dagger(\omega)\mapsto e^{-i\phi_k(\omega)}\hat a^\dagger(\omega)\), and an input wavepacket \(\xi(\omega)\) is mapped to \(\xi^e(\omega)=\xi(\omega)e^{-i\phi_k(\omega)}\) [2106.10028].

## 3. Mathematical structure and interference suppression

The mathematical signature of q-CDMA is that intended-user components are restored by matched decoding while cross-user terms are attenuated by code orthogonality or by averaging over broadband chaotic phases.

In the 2012 chaotic q-CDMA model, the suppression of multiuser interference is quantified by a factor
\[
M\approx e^{-\pi\int S_f(\omega)/\omega^2d\omega},
\]
which arises because cross-talk terms average out under chaotic spreading [1204.1742]. More generally, the 2025 CV-QKD paper defines per-user correction factors
\[
M_i=\exp\!\Bigl[-\pi \int_{\omega_{li}}^{\omega_{ui}} S_{\delta_i}(\omega)/\omega^2\, d\omega\Bigr],
\]
and shows that, after perfect synchronization and averaging over fast chaotic phases, the two-user input–output relation becomes
\[
\hat a_{3,4} =  \frac{\sqrt\eta}{2}\,\hat a_{1,2}
 +  \frac{\sqrt{M_1M_2\eta}}{2}\,\hat a_{2,1}
 +  \sqrt{\frac{M_1(1-\eta)}{2}}\,\hat a_N
 \pm  \sqrt{\frac{M_{1,2}}{2}}\,\hat a_{BS}.
\]
The desired-user term scales as \(\sqrt{\eta}/2\), while interference and environmental terms are attenuated by \(\sqrt{M_1M_2}\) or \(\sqrt{M_i}\) [2502.09019].

Expressed in quadratures, with \(\hat a_k=(X_k+iY_k)/\sqrt2\), Bob’s measured outcome for one quadrature is
\[
X_{B1,2} = \frac{\sqrt\eta}{2}\,X_{A1,2}
 + \sqrt{\frac{M_1(1-\eta)}{2}}\,X_N
 + \frac{\sqrt{M_1M_2\eta}}{2}\,X_I
 \pm \sqrt{\frac{M_{1,2}}{2}}\,X_{BS},
\]
so that the received variable consists of the intended signal, Eve’s injected noise, interference \(\Gamma\), and beam-splitter environmental noise \(\sigma\) [2502.09019].

In the direct-sequence single-photon setting, orthogonality is achieved by code inner products. For orthogonal codes of length \(S\),
\[
c_i\cdot c_j^T=
\begin{cases}
S,&i=j,\\
0,&i\neq j,
\end{cases}
\]
and despreading re-concentrates the intended signal while keeping interferers spread [1401.1756]. Sharma and Banerjee instead use maximal-length sequences with correlation
\[
c_p\cdot c_q^T=
\begin{cases}
S,&p=q,\\
-1,&p\neq q,
\end{cases}
\]
so that despreading by \(c_p\) yields gain \(S\) for the desired photon, whereas other users remain at level \(-1\) and largely cancel out [1905.12829].

The 2024 “chip-time interval decomposition” framework reformulates direct-sequence q-CDMA at the operator level. A creation operator \(\hat a^\dagger[\phi]\) is decomposed into chip creation operators \(\hat a_k^\dagger\), yielding
\[
\hat a^\dagger[\phi]=\frac{1}{\sqrt{N_c}}\sum_{k=0}^{N_c-1}\hat a_k^\dagger,
\]
with orthogonal-chip commutation relations \([\,\hat a_k,\hat a_l^\dagger\,]=\delta_{kl}\). A binary spreading code \(\lambda_k\in\{\pm1\}\) is implemented by a phase-shifter unitary, producing
\[
\hat U\,\hat a^\dagger[\phi]\,\hat U^\dagger
=\frac1{\sqrt{N_c}}\sum_{k=0}^{N_c-1}\lambda_k\,\hat a_k^\dagger
\]
[2410.21450]. This decomposition makes explicit that chip operators are the invariant building blocks of direct-sequence q-CDMA.

A further distinction arises from the input state class. For coherent-state inputs, inter-user interference appears as an additive term in the output coherent-state amplitude [2106.10028; 2410.21450]. For number-state inputs, Rezai and Salehi show that all cross-terms vanish in the instantaneous intensity:
\[
I_{r_0}(t)
=\frac{1}{M}\sum_{s=1}^M
n_s\,\bigl|\,\xi^{\,e_s d_{r_0}_s}(t)\bigr|^2,
\]
with no interference term, which they attribute to complete phase uncertainty at detection for Fock states [2106.10028]. Dastgheib, Salehi, and Rezai further identify a spread-spectrum version of the Hong–Ou–Mandel effect in the chip-time formalism [2410.21450].

## 4. q-CDMA in quantum key distribution

QKD is one of the main application domains of q-CDMA, but the literature splits into weak-coherent-pulse / single-photon network architectures and continuous-variable schemes.

In “Multiple-Access Quantum Key Distribution Networks,” quantum CDMA QKD uses OOCs of length \(N\) and weight \(w\). In an asynchronous network, the probability that two weight-\(w\) codes collide in at least one chip is
\[
p=\frac{w^2}{N}.
\]
If \(m\) other users collide on one chip, the total background yield becomes
\[
Y_{\rm CDMA}^{(m)}
=
Y_{\rm TDMA}+m\,\frac{\eta\mu}{w},
\]
and the average effective rate per user is
\[
\bar R_{\rm CDMA}
=
\sum_{m=0}^{N_A-1}
\binom{N_A-1}{m} p^m (1-p)^{N_A-1-m}
R_{\rm CDMA}^{(m)}.
\]
In the regime where any \(m>0\) drives the key rate to zero, this simplifies to
\[
\bar R_{\rm CDMA}
\approx
\Bigl(1-\frac{w^2}{N}\Bigr)^{N_A-1}R_{\rm TDMA},
\]
from which the paper concludes that the optimal performance is achieved at unity code weight, \(w=1\) [1112.3218]. That work also introduced a listen-before-send protocol reducing the collision probability to
\[
p'=\frac{[1-Y_{\rm CDMA}^{(1)}]^k}{N},
\]
with the effective rate approaching \(R_{\rm TDMA}\) as \(k\to\infty\) [1112.3218].

The 2025 CV-QKD proposal adopts a different q-CDMA mechanism based on chaotic phase encoding. Each Alice prepares a Gaussian-modulated coherent state \(|\alpha_i\rangle\) with quadrature variance \(V_{A_i}=V_S+V_0\), the states are multiplexed through beam splitters, and the channel is modeled by an entangling-cloner attack in which Eve injects an ancilla mode \(\hat a_N\) [2502.09019]. For each user pair, the reverse-reconciliation secret key rate is
\[
R^{\leftarrow}_{1,2}=I(X_{A1,2}:X_{B1,2})-\chi(X_{B1,2}:E),
\]
with total rate
\[
R^{\leftarrow}=R_1^{\leftarrow}+R_2^{\leftarrow}.
\]
The mutual information is
\[
I(X_A:X_B)=\frac12\log_2\!\Bigl[\frac{V_B}{V_{B|A}}\Bigr],
\]
where
\[
V_{B1,2} = \frac{\eta}{4}V_A
 + \frac{M_{1,2}(1-\eta)}{2}W
 + \frac{M_1M_2\eta}{4}\Gamma
 + \frac{M_{1,2}}{2}\sigma,
\]
and
\[
V_{B|A} = \frac{\eta}{4}V_0
 + \frac{M_{1,2}(1-\eta)}{2}W
 + \frac{M_1M_2\eta}{4}\Gamma_0
 + \frac{M_{1,2}}{2}\sigma.
\]
The Holevo term is computed from Eve’s covariance matrix, using symplectic eigenvalues \(\nu_{1,2}\) and \(\nu_{3,4}\) through entropic functions \(g(\nu_k)\) [2502.09019].

The paper’s numerical results identify a regime in which two-user q-CDMA improves over a single-user baseline. For \(M=0.01\) and \(V_S=100\,\mathrm{SNU}\), the zero-SKR cutoff distance without q-CDMA is approximately \(20\,\mathrm{km}\), whereas with q-CDMA it extends beyond \(40\,\mathrm{km}\); at \(30\,\mathrm{km}\), q-CDMA yields approximately \(10^{-1}\,\mathrm{bits/use}\) versus approximately \(10^{-2}\) for the one-user case [2502.09019]. The same study reports that larger modulation \(V_S\) greatly boosts the SKR, while higher \(M\) degrades performance [2502.09019].

A 2026 generalization extends the chaotic-phase CV-QKD framework to an arbitrary number of users, deriving multiuser quadrature input–output relations and finite-size secret-key expressions. In that model, the asymptotic per-user SKR under collective attacks is
\[
R_i=I(X_{A_i}:X_{B_i})-\chi(X_{B_i}:E),
\]
with total SKR \(R=\sum_i R_i\), and the finite-size rate is
\[
R_{i,\mathrm{finite}}
=\frac{n}{K}\Bigl[\beta I(X_{A_i}:X_{B_i})
-S_{\epsilon_{\rm PE}}(X_{B_i}:E)-\Delta(n)\Bigr]
\]
[2603.12777]. This suggests a broader q-CDMA QKD program in which chaotic spreading is analyzed not only asymptotically but also under estimation penalties and composable-security corrections.

## 5. Network architectures and representative applications

Different q-CDMA variants serve different network objectives, and the literature spans quantum internet transport, entanglement distribution, single-photon multiplexing, and multiuser QKD.

The 2012 “Quantum internet using code division multiple access” paper frames q-CDMA as a solution to the open problem of efficiently transmitting quantum data among many pairs of users via a common medium. Its architecture assumes \(N\) sender–receiver pairs, with all \(N\) senders coupling their photonic signals into a single common quantum channel, each sender using an encoder port \(\mathrm{CPS}_k\) and each receiver a matched decoder port \(\mathrm{CPS}_{k+N}\), synchronized through an auxiliary classical channel [1204.1742]. The paper compares q-CDMA with frequency division multiple access and states that q-CDMA can greatly increase the information rates per channel used, especially for very noisy quantum channels [1204.1742].

The Garcia-Escartin–Chamorro-Posada scheme focuses on reversible add–drop multiplexing for single-photon qubits. A user’s spread photon can be inserted into a fiber carrying the qubits of other users and later extracted without disturbing the rest, up to a small unavoidable filtering loss \(O(1/S)\) [1401.1756]. The add–drop architecture combines electro-optic phase modulators, three-port circulators, and FBGs that reflect only a narrow band \(\Delta f=W\) corresponding to a despread photon [1401.1756].

The Sharma–Banerjee work likewise addresses multiuser single-photon QKD over a single fiber, emphasizing that spreading disperses channel noise and that FBG filters stop the overlapping of adjacent channels, improving signal-to-noise ratio without amplifiers and modulators in the reported architecture [1905.12829]. Their simulations examine photon-loss, crosstalk, fidelity, QBER, and key rate as functions of the spreading factor \(S\) and the number of users \(N\) [1905.12829].

The entanglement-distribution protocol of Zhu et al. uses q-CDMA to let two sender–receiver pairs share a single quantum channel while distributing two maximally entangled states mediated by bright coherent lights [1507.02004]. Each sender and receiver contains an optical cavity and a three-level atom, beam splitters multiplex and demultiplex the optical modes, and synchronized chaotic EOMs encode and decode two independent quantum channels [1507.02004]. After dispersive atom–cavity interactions and homodyne-based post-selection, the protocol yields Bell pairs \(|\Psi^+_{13}\rangle\) and \(|\Psi^+_{24}\rangle\) with high fidelity under appropriate bandwidth and loss conditions [1507.02004].

The continuous-mode spectral formalism of Rezai and Salehi presents q-CDMA modules more abstractly: quantum signal sources, quantum spectral encoding phase operators, an \(M\times M\) quantum broadcasting star-coupler, spectral phase decoding operators, and quantum receivers [2106.10028]. The authors identify potential applications in point-to-point quantum communications, quantum pulse shaping, quantum radar signals and systems, quantum local-area networks, point-to-point QKD with low probability of intercept, and distributed quantum computing [2106.10028].

## 6. Performance characteristics, trade-offs, and limitations

A recurring claim across q-CDMA papers is that spreading enables multiple users to share the same resource while attenuating cross-talk. The exact performance criterion, however, depends strongly on the physical model and task.

In the 2012 chaotic q-CDMA analysis, spectral efficiency is compared with FDMA. For a bosonic Gaussian loss-with-noise channel, the classical capacity per channel use in FDMA is
\[
C_{\rm FDMA}=g(\eta N),
\]
whereas in q-CDMA the full band is reused by all users and cross-talk is suppressed by a factor \(M\ll1\), leading approximately to
\[
\eta_{\rm qCDMA}=\frac{C_{\rm qCDMA}}{C_{\rm single}}\approx N,\qquad
\eta_{\rm FDMA}=1,
\]
so that \(\eta_{\rm qCDMA}/\eta_{\rm FDMA}\approx N\) [1204.1742]. The same study reports that in a hard-chaos regime with \(M\approx0.01\), two-user fidelity reaches \(F\approx0.99\), while FDMA with half-band allocation is limited to \(F\approx0.85\) in the cited example [1204.1742].

For direct-sequence single-photon multiplexing, performance is commonly expressed in loss and cross-talk scaling. In the 2014 add–drop architecture, each FBG stage incurs a fraction \(1/S\) loss for a spread photon, and in a network of \(N\) users the worst-case loss probability is bounded by
\[
P_{\rm loss}\le (2N-2)\frac1S.
\]
Cross-talk scales as \(O(1/S)\) in intensity, and losses can be made arbitrarily small by taking large \(S\) [1401.1756].

Sharma and Banerjee provide explicit numerical tables. For \(S=2^{10}-1=1023\) and \(N=20\) users, they report \(P_{\rm loss}\approx0.372\) and \(P_{\rm xtalk}\approx0.0728\); for the same \(S\), the average fidelity remains above \(0.994\) for the four BB84-type states \(|0\rangle,|1\rangle,|\pm\rangle\) even up to \(50\) users [1905.12829]. They estimate
\[
QBER\approx \frac{P_{\rm xtalk}}{1-P_{\rm loss}+P_{\rm xtalk}},
\]
which for the \(S=1023, N=20\) example gives approximately \(10\%\), and define the raw key-generation rate
\[
R_{\rm key}\approx R_{\rm clock}(1-P_{\rm loss}-P_{\rm xtalk})[1-2H_2(QBER)]
\]
[1905.12829]. Their simulations further show that increasing \(S\) from \(2^8-1\) to \(2^{15}-1\) progressively improves pulse recovery [1905.12829].

In the QKD network model of 2011, the main trade-off is between code weight, frame duration, and collision probability. Increasing the code weight \(w\) raises the collision probability \(p=w^2/N\), and the paper concludes that unity weight is optimal [1112.3218]. The hybrid WDM–T/CDMA architecture considered there indicates that hundreds of users can be supported with less than \(3\,\mathrm{dB}\) penalty per user when router isolation is at least \(30\,\mathrm{dB}\) [1112.3218].

The entanglement-distribution study quantifies performance in terms of chaotic bandwidth, correction factors, and fidelity. It reports that the chaotic correction factor \(M_j\) falls exponentially once the Colpitts circuit bandwidth exceeds approximately \(100\,\mathrm{MHz}\), with \(M_j\sim10^{-3}\) at \(B_j\approx500\,\mathrm{MHz}\), and that for \(n̄=10\) both entanglement fidelities exceed \(0.99\) once each \(B_j>400\,\mathrm{MHz}\) [1507.02004]. With \(\phi=\pi/3\) and \(n̄=10\), high fidelity \(F>0.98\) is maintained up to \(\eta\approx0.3\), while beyond approximately \(50\%\) loss the success rate or fidelity degrades [1507.02004].

The two-user CV-QKD paper identifies a different set of trade-offs. Higher modulation \(V_S\) improves SKR, while larger correction factor \(M\) degrades it; at fixed \(V_S=100\,\mathrm{SNU}\), the curves for \(M=0.001\) outperform those for \(M=0.01\) [2502.09019]. This suggests that broader chaotic spectra, which produce smaller \(M\), are beneficial because they more strongly suppress user-to-user interference and Eve coupling.

The available literature also makes clear that q-CDMA is not free of implementation cost. Recurrent limitations include maintaining robust long-distance chaos synchronization across many nodes [1204.1742], engineering sufficiently broad and stable chaotic spectra without introducing extra quantum noise [1204.1742], hardware realization of broadband chaotic phase modulation at telecom rates over tens of kilometers [2502.09019], classical side-channel overhead for synchronization [1204.1742; 2603.12777], and beam-splitter-tree overhead and vacuum noise in multiuser CV-QKD generalizations [2603.12777].

## 7. Misconceptions, open questions, and research directions

One common misconception is that q-CDMA refers to a single standardized protocol. The literature instead contains several distinct constructs: OOC-based code-domain QKD with incoherent pulse-chip recombination [1112.3218], unitary single-photon spread-spectrum add–drop multiplexing [1401.1756], chaotic spectral spreading and chaos-synchronized recovery for generic quantum communication [1204.1742], entanglement distribution with bright coherent probes [1507.02004], and chaotic-phase CV-QKD with Gaussian security analysis [2502.09019]. These share a code-division philosophy but differ in state families, hardware primitives, channel models, and performance metrics.

A second misconception is that orthogonality or interference suppression is always exact. Exact zero cross-talk appears in idealized orthogonal-code formulations such as the Garcia-Escartin–Chamorro-Posada model in the lossless limit [1401.1756], whereas chaotic-phase approaches typically rely on small correction factors \(M_i\ll1\) obtained after averaging over broadband chaotic spectra [1204.1742; 2502.09019; 1507.02004]. In practical systems, imperfect synchronization, limited bandwidth, channel loss, and filter nonidealities translate into residual excess noise or crosstalk.

A third misconception is that q-CDMA automatically improves all security metrics in QKD. The 2025 CV-QKD results do show higher SKR and longer secure distance than a single-user baseline in the reported two-user model [2502.09019], but the 2011 multiple-access QKD analysis finds that asynchronous collisions can severely reduce rates unless codes are chosen with unity weight and the listen-before-send protocol is used [1112.3218]. The 2026 finite-size extension further indicates that parameter-estimation penalties and finite block lengths can substantially reduce the key rate relative to the asymptotic regime [2603.12777]. A plausible implication is that q-CDMA advantages are highly regime-dependent and must be evaluated jointly with access control, noise statistics, and security proof assumptions.

Several open directions are stated explicitly in the literature. The 2025 CV-QKD work notes that the analysis is restricted to two users and identifies extension to \(K>2\) users, mutually orthogonal chaotic codes, more complex synchronization networks, and experimental validation at telecom wavelengths as future work [2502.09019]. The 2026 multiuser extension adds finite-size analysis, arbitrary user number, and the study of correction factor, interference noise, environmental noise, and transmittance as central system parameters [2603.12777]. Earlier works identify dynamic code assignment, free-space or satellite QKD extensions, rapid programmable phase masks, and hybrid time–wavelength–code schemes as important unresolved problems [1112.3218; 2106.10028].

Taken together, the q-CDMA literature defines a coherent research area rather than a single protocol: a code-domain multiplexing paradigm for quantum communication in which user-specific unitary spreading and matched decoding permit shared-medium operation while controlling multiuser interference. Its current forms range from mathematically clean chip-based single-photon constructions to experimentally motivated chaotic-phase architectures for entanglement distribution and CV-QKD, with scalability, synchronization fidelity, and security under realistic nonidealities remaining the main technical frontiers [1204.1742; 1401.1756; 2502.09019].

Source: https://www.emergentmind.com/topics/quantum-code-division-multiple-access-q-cdma