Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2510.02134

Interference Resilient Quantum Receivers with Rydberg Atoms

Javane Rostampoor·Raviraj Adve
View original source ↗Read source document ↗Export metadata ↓

Abstract

Quantum sensing has attracted significant attention due to its ability to measure physical quantities with extremely high accuracy. Rydberg atoms - typically alkali atoms with a highly excited valence electron that is far from the nucleus - exhibit strong sensitivity to external electromagnetic fields. This sensitivity leads to coupling between different atomic energy levels, which can be observed by monitoring changes in a control laser beam before and after it passes through a vapor cell containing the Rydberg atoms. By analyzing the transmitted laser signal with a photodetector, variations in transmission can be attributed to the presence and characteristics of the external electromagnetic field. Because Rydberg atoms operate in a highly excited quantum state without relying on traditional electronic circuitry, they inherently avoid thermal noise, thereby enabling more sensitive detection. In this paper, we investigate the performance of a Rydberg atomic receiver based on Rb-85 and compare it with that of a conventional receiver in detecting an 8-level pulse amplitude modulation (8-PAM) signal in the presence of off-resonant interference. We demonstrate that the Rydberg receiver can suppress interference without the need for an additional filter. Effectively, our results show that the Rydberg receiver serves as an integrated filter and demodulator, outperforming conventional circuit-based receivers in terms of achievable symbol error rate

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Javane Rostampoor, Raviraj Adve. 2025-10-02. Interference Resilient Quantum Receivers with Rydberg Atoms. https://arxiv.org/abs/2510.02134

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗