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

Elsevier eBooks

ERROR PROBABILITY FOR A CHANNEL WITH TWO NON-ORTHOGONAL SIGNALS OF RANDOM PHASES

Published Jan 1, 1968• 0 citations
Publisher
DOI
10.1016/b978-0-08-013265-5.50024-0

Related papers

Information-theoretic results for phase noise channels

Luca Barletta

•Jan 1, 2014•0 citations

PROBABILITY REPRESENTATION OF OPTICAL SIGNALS AND NEW ENTROPY OF QUANTUM STATES

Margarita A. Man’ko, Olga V. Man’ko, Vladimir I. Man’ko

Probability distributions (tomograms) associated to classical and quantum optical signals are introduced. Nonlinear evolution equations are discussed in the probability representation. For spin states, entropy and information corresponding to spin tomograms are studied.

International Journal of Modern Physics B•May 20, 2006•9 citations

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

S. E. Fedorov, A. N. Martianov

RaEl•Aug 1, 1981•0 citations

Sequential Quantum Channel Discrimination

Yonglong Li, Christoph Hirche, Marco Tomamichel

We consider the sequential quantum channel discrimination problem using adaptive and non-adaptive strategies. In this setting the number of uses of the underlying quantum channel is not fixed but a random variable that is either bounded in expectation or with high probability. We show that, by using adaptive strategies for the discrimination problem, both types of error probabilities decrease to zero exponentially fast and the rates are characterized by the measured relative entropy between two quantum channels. Allowing for quantum memory, we see that the optimal rates are given by the regularized channel relative entropy. We also characterize the error exponents in the discrimination problem if non-adaptive strategies are used.

arXiv:2210.11079•IEEE International Symposium on Information Theory (ISIT)•Jun 26, 2022•10 citations

Arbitrarily Varying Wiretap Channels with and without Non-Causal Side Information at the Jammer

Carsten Rudolf Janda, Eduard Axel Jorswieck, Moritz Wiese +1 more

We investigate the Arbitrarily Varying Wiretap Channel (AVWC) with non-causal side information at the jammer for the case that there exists a best channel to the eavesdropper. Non-causal side information means that codewords are known at an active adversary before they are transmitted. By considering the maximum error criterion, we allow also messages to be known at the jammer before the corresponding codeword is transmitted. A multi letter formula for the common randomness secrecy capacity is derived. Furthermore, we compare our results to the random code secrecy capacity for the cases of maximum error criterion but without non-causal side information at the jammer, maximum error criterion with non-causal side information of the messages at the jammer, and the case of average error criterion without non-causal side information at the jammer.

IEEE Conference on Communications and Network Security•Jun 1, 2020•3 citations

Bounds on the capacity of Wiener phase noise channels

Luca Barletta

•Jan 1, 2015•0 citations
We consider the sequential quantum channel discrimination problem using adaptive and non-adaptive strategies. In this setting the number of uses of the underlying quantum channel is not fixed but a random variable that is either bounded in expectation or with high probability. We show that, by using adaptive strategies for the discrimination problem, both types of error probabilities decrease to zero exponentially fast and the rates are characterized by the measured relative entropy between two quantum channels. Allowing for quantum memory, we see that the optimal rates are given by the regularized channel relative entropy. We also characterize the error exponents in the discrimination problem if non-adaptive strategies are used.
We investigate the Arbitrarily Varying Wiretap Channel (AVWC) with non-causal side information at the jammer for the case that there exists a best channel to the eavesdropper. Non-causal side information means that codewords are known at an active adversary before they are transmitted. By considering the maximum error criterion, we allow also messages to be known at the jammer before the corresponding codeword is transmitted. A multi letter formula for the common randomness secrecy capacity is derived. Furthermore, we compare our results to the random code secrecy capacity for the cases of maximum error criterion but without non-causal side information at the jammer, maximum error criterion with non-causal side information of the messages at the jammer, and the case of average error criterion without non-causal side information at the jammer.