Search arXivSearch

arXiv · 2606.13286

Error Probability Analysis of Quantum Communication with Phase-squeezed M-PSK

Abstract

In this paper, we investigate the symbol error probability (SEP) of phase-squeezed M-ary phase-shift keying (M-PSK). Since the relevant observable for M-PSK detection is the optical phase, we adopt the adaptive Mark-II receiver which is a physically realizable phase measurement. First, we develop a theoretical analysis based on the phase probability operator measure (POM) of the Mark-II scheme in the Fock basis. Then, we develop two SEP methods based on the statistics of the received PSK symbol and the error introduced by the Mark-II measurement. The first method derives the phase probability density induced by the squeezed state noise and incorporates the additional Mark-II phase uncertainty through an angular convolution. Since this convolution does not admit a simple closed form, we also introduce an effective tangential-variance model, which yields a closed form SEP expression in terms of the Owen's T-function. Numerical results show that phase squeezing substantially reduces the SEP of M-PSK compared to coherent state transmission, with greater gains for higher constellation orders. Notably, for the investigated scenario, squeezing can almost double the photon efficiency of M-PSK as the mean number of transmitted photons increases. Finally, the proposed approximations closely follow the Mark-II POM analysis, typically within an accuracy of 2-4 photons, and therefore provide accurate and computationally efficient tools for analyzing phase squeezed quantum M-PSK communication.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nikos A. Mitsiou, Ioannis Krikidis. 2026-06-11. Error Probability Analysis of Quantum Communication with Phase-squeezed M-PSK. https://arxiv.org/abs/2606.13286

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