Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

RaEl

Optimal signals for a digital quantum communication channel with a random phase

S. E. Fedorov, A. N. Martianov

Published Aug 1, 1981• 0 citations
OpenAlex

Related papers

Error Exponents of Quantum Communication System with M-ary PSK Coherent State Signal

Kentaro Kato

The optimal distributions on a channel input that yield the random coding exponent, the expurgation exponent, and the zero-rate reliability function for a discrete classical-quantum channel with M-ary Phase Shift Keying (PSK) coherent state signal are analytically derived. In each case, the optimal distributions are given by a uniform distribution over the channel input alphabet. As a result, the expressions of the error exponents for M-ary PSK coherent state signal are simplified. By using this result, typical behavior of the error exponents is sketched in the case of M = 16.

•Jan 1, 2011•2 citations

Problems in the mathematical theory of quantum communication channels

Alexander Semenovich Holevo

Reports on Mathematical Physics•Oct 1, 1977•82 citations

Classical signal model for quantum channels

Andrei Yu. Khrennikov, Masanori Ohya, Naboru Watanabe

arXiv:1008.3772•Journal of Russian Laser Research•Sep 1, 2010•28 citations

Covert Signaling for Communication and Sensing over the Bosonic Channels

Tianrui Tan, Evan J. D. Anderson, Michael S. Bullock +1 more

Preventing signal detection in communication and active sensing requires careful control of transmission power. In fact, the square-root laws (SRL) for covert classical and quantum communication and sensing prescribe that the average output energy per channel use scales as $1/\sqrt{n}$ for $n$ channel uses. \emph{Diffuse} and \emph{sparse} signaling achieve this. The former transmits signals whose energy decays as $1/\sqrt{n}$ over all $n$ channel uses, which is convenient for mathematical analysis. The latter transmits constant-energy signals only approximately $\propto\sqrt{n}$ times out of $n$ channel uses, remaining silent on the others. This offers significant practical advantages in compatibility with modern digital transmitters. Here, we study sparse signaling over the lossy thermal-noise bosonic channel, which is a quantum model of many practical channels (including optical, microwave, and radio-frequency). We characterize the input signal state that minimizes detectability. We find an unintuitive optimal quantum state structure: a mixture of just two consecutive photon-number states. In particular, in the low-brightness regime, the optimal signal state is a mixture of vacuum and a single photon. Since these states are generally suboptimal for both communication and active sensing, we explore the resulting trade-off and identify input-power thresholds for transitions between optimizing covertness and performance in communication and sensing tasks.

quant-pharXiv:2605.08066•May 11, 2026•1 citation

Application of Quantum Walk for Signal Processing

V. S. Moskvin

Signal processing is important for modern technologies such as digital communication systems and sensor networks, and is used to enhance and optimize the quality of transmitted signals. However, traditional methods and design frameworks are insufficient for the demands of future communication networks, which are expected to be highly complex and constantly changing. Our research focuses on a mathematical model known as a Markov model, which represents a system as a series of states linked by transitions. This model can be applied to various signal processing challenges in telecommunications, such as the modeling of communication channels, sources of information, and the correction of distortion and noise in transmitted signals. We examine the random walk algorithm, a simple and efficient way to simulate the behavior of a Markov chain, as it can provide valuable insights into the performance of communication systems and help to optimize their design. However, it may not be able to accurately model systems with complex transitions or systems that exhibit long-term correlations. In order to address the challenges and limitations of classical random walk, we propose the use of quantum random walk, which is a quantum mechanical version of classical random walk. It describes the motion of particles in a probabilistic way, similar to classical random walk, but with the added complexity of quantum mechanics. We also provide quantum walk algorithm with Hadamard gate implementation for coin operator.

2018Systems of Signal Synchronization, Generating and Processing in Telecommunications (SYNCHROINFO)•Jun 28, 2023•1 citation

Communication over Random-Parameter Quantum Channels with Parameter Estimation

Uzi Pereg

•Jan 1, 2020•0 citations
The optimal distributions on a channel input that yield the random coding exponent, the expurgation exponent, and the zero-rate reliability function for a discrete classical-quantum channel with M-ary Phase Shift Keying (PSK) coherent state signal are analytically derived. In each case, the optimal distributions are given by a uniform distribution over the channel input alphabet. As a result, the expressions of the error exponents for M-ary PSK coherent state signal are simplified. By using this result, typical behavior of the error exponents is sketched in the case of M = 16.
Preventing signal detection in communication and active sensing requires careful control of transmission power. In fact, the square-root laws (SRL) for covert classical and quantum communication and sensing prescribe that the average output energy per channel use scales as 1/n1/\sqrt{n}1/n​ for nnn channel uses. \emph{Diffuse} and \emph{sparse} signaling achieve this. The former transmits signals whose energy decays as 1/n1/\sqrt{n}1/n​ over all nnn channel uses, which is convenient for mathematical analysis. The latter transmits constant-energy signals only approximately ∝n\propto\sqrt{n}∝n​ times out of nnn channel uses, remaining silent on the others. This offers significant practical advantages in compatibility with modern digital transmitters. Here, we study sparse signaling over the lossy thermal-noise bosonic channel, which is a quantum model of many practical channels (including optical, microwave, and radio-frequency). We characterize the input signal state that minimizes detectability. We find an unintuitive optimal quantum state structure: a mixture of just two consecutive photon-number states. In particular, in the low-brightness regime, the optimal signal state is a mixture of vacuum and a single photon. Since these states are generally suboptimal for both communication and active sensing, we explore the resulting trade-off and identify input-power thresholds for transitions between optimizing covertness and performance in communication and sensing tasks.
Signal processing is important for modern technologies such as digital communication systems and sensor networks, and is used to enhance and optimize the quality of transmitted signals. However, traditional methods and design frameworks are insufficient for the demands of future communication networks, which are expected to be highly complex and constantly changing. Our research focuses on a mathematical model known as a Markov model, which represents a system as a series of states linked by transitions. This model can be applied to various signal processing challenges in telecommunications, such as the modeling of communication channels, sources of information, and the correction of distortion and noise in transmitted signals. We examine the random walk algorithm, a simple and efficient way to simulate the behavior of a Markov chain, as it can provide valuable insights into the performance of communication systems and help to optimize their design. However, it may not be able to accurately model systems with complex transitions or systems that exhibit long-term correlations. In order to address the challenges and limitations of classical random walk, we propose the use of quantum random walk, which is a quantum mechanical version of classical random walk. It describes the motion of particles in a probabilistic way, similar to classical random walk, but with the added complexity of quantum mechanics. We also provide quantum walk algorithm with Hadamard gate implementation for coin operator.