Search arXivSearch

arXiv · 2606.04247

An Effective Pauli-Channel Model for Passive-User Loop-Back QKD

Abstract

This work develops an effective channel model for distributed passive-user Loop-Back quantum key distribution. In the intended key-establishment setting, the two passive users \(B_1\) and \(B_2\) are the legitimate lightweight parties that establish a shared secret key by using Alice as an active quantum preparation-and-measurement infrastructure. A single active station prepares and measures BB84 states, while two remote users apply only local polarization rotations. We show that the passive-user pair can be externally encapsulated as an effective Loop-Back node whose observable action is a balanced mixture of conjugate-basis dephasings, equivalently represented as an anisotropic Pauli channel with identity, \(X\), and \(Z\) components and no \(Y\) component. This structure differs from isotropic depolarization and recovers the ideal conclusive-event probability \(P_{\mathrm{conc}}=1/4\). The model also clarifies why non-orthogonal intermediate states are necessary for passive-user security. This channel-level description characterizes Alice's observable statistics and provides a compact basis for subsequent analysis of passive-user Loop-Back QKD under realistic optical and adversarial conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luis Adrián Lizama-Pérez. 2026-06-02. An Effective Pauli-Channel Model for Passive-User Loop-Back QKD. https://arxiv.org/abs/2606.04247

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT