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

arXiv:2604.22804

Deterministic Multi-User Identification over Bosonic Channels

Gökhan Elmas, Janis Nötzel

quant-phcs.ITSubmitted Apr 13, 2026• Announced Apr 15, 2026• 0 citations
arXivHTMLPDF

Abstract

We study deterministic multi-user identification over bosonic channels using coherent-state signatures. Each user is assigned a coherent product state under an average energy constraint, and identification is performed by a user-specific binary quantum test. In contrast to classical multi-user identification models based on shared codebooks, this formulation associates each receiver with a geometric signature in high-dimensional phase space. Using metric entropy bounds, we show that the identification capacity exhibits a near-k log k scaling behavior.

Related papers

Achievable Identification Rates in Noisy Bosonic Broadcast Channels

Zuhra Amiri, Janis Nötzel

Identification in quantum communication enables receivers to verify the presence of a message without decoding its entire content. While identification capacity has been explored for classical and finite-dimensional quantum channels, its behaviour in bosonic systems remains less understood. This work analyses identification over noisy bosonic broadcast channels using coherent states. We derive achievable identification rate regions while ensuring error probabilities remain bounded, even in an infinite-dimensional setting. Our approach leverages quantum hypothesis testing and approximates the infinite sender alphabet with discrete subsets to maintain power constraints.

quant-pharXiv:2512.01833•Globecom•Dec 2, 2025•0 citations

Energy-Efficient Satellite Wake-Up via Bosonic Identification: The Role of Synchronization

Gökhan Elmas, Janis Nötzel

The information-theoretic concept of identification describes a sender-receiver architecture in which the receiver only checks whether a particular message was sent or not, thereby promising a low-energy receiver design. In low received-energy regimes, quantum receivers are a promising tool for studying the system limits. However, the known information-theoretically optimal identification codes typically assume perfect synchronization. In this work, we study deterministic identification in a satellite setting under explicit synchronization constraints, where a satellite broadcasts the signature of a specific User Equipment (UE) which it assumes to be attached to one out of several possible Ground Station (GS), with the goal of establishing communication with the target UE. Within the proposed design, and assuming a specific phase-encoded coherent-state clock scheme in which the discrete time index is represented by equidistant phase rotations on the unit circle, our results reveal a fundamental asymmetry: At any transmission power, identification performance improves with blocklength, whereas synchronization accuracy degrades. In particular, the energy needed for transmitting the satellite clock to the GS can be several orders of magnitude higher than the one needed for the identification signal. This indicates that synchronization strongly impacts identification performance and motivates the investigation of the error-correcting capabilities of bosonic codes under jitter.

quant-pharXiv:2606.08845•Jun 9, 2026•0 citations

Quantum Multi-User Detection Based on Coherent State Signals

Wenbin Yu, Yinsong Xu, Wenjie Liu +2 more

Multi-user detection is one of the important technical problems for modern communications. In the field of quantum communication, the multi-access channel on which we apply the technology of quantum information processing is still an open question. In this work, we investigate the multi-user detection problem based on the binary coherent-state signals whose communication way is supposed to be seen as a quantum channel. A binary phase shift keying model of this multi-access channel is studied and a novel method of quantum detection proposed according to the conclusion of the quantum measurement theory. As a result, the average interference between deferent users is presented and the average error probability of the quantum detection is derived theoretically. Finally, we show the maximum channel capacity of this effective detection for a two-access quantum channel

Journal of quantum computing•Jan 1, 2019•0 citations

Deterministic Identification Over Channels with Finite Output: A Dimensional Perspective on Superlinear Rates

Pau Colomer, Christian Deppe, Holger Boche +1 more

Following initial work by JaJa, and Ahlswede and Cai, and inspired by a recent renewed surge in interest in deterministic identification (DI) via noisy channels, we consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets. Such a channel is essentially given by (the closure of) the subset of its output distributions in the probability simplex. Our main findings are that the maximum number of messages thus identifiable scales super-exponentially as$2^{Rn\log n}$with the block length$n$, and that the optimal rate$R$is upper and lower bounded in terms of the covering (aka Minkowski, or Kolmogorov, or entropy) dimension$d$of a certain algebraic transformation of the output set:$\frac{1}{4}d\leq R\leq\frac{1}{2}d$, Along the way, we present a Hypothesis Testing Lemma that shows it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code. Although we do not know the exact capacity formula, we can conclude that the DI capacity exhibits super-activation: there exist channels whose capacity is zero, but whose product has positive capacity. These results are then generalised to classical-quantum channels with finite-dimensional output quantum system (but arbitrary input alphabet), and in particular to quantum channels on finite-dimensional quantum systems under the constraint that the identification code can only use tensor product inputs.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•12 citations

Deterministic Identification Over Channels With Finite Output: A Dimensional Perspective on Superlinear Rates

Pau Colomer, Christian Deppe, Holger Boche +1 more

Following initial work by JaJa, Ahlswede and Cai, and inspired by a recent renewed surge in interest in deterministic identification (DI) via noisy channels, we consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets. Such a channel is essentially given by its output distributions as a subset in the probability simplex. Our main findings are that the maximum length of messages thus identifiable scales superlinearly as$R\,n\log n$with the block length n, and that the optimal rate R is bounded in terms of the covering (aka Minkowski, or Kolmogorov, or entropy) dimension d of a certain algebraic transformation of the output set:$\frac {1}{4} d \leq R \leq \frac {1}{2} d$. Remarkably, both the lower and upper Minkowski dimensions play a role in this result. Along the way, we present a Hypothesis Testing Lemma showing that it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code. Although we do not know the exact capacity formula, we can conclude that the DI capacity exhibits superactivation: there exist channels whose capacities individually are zero, but whose product has positive capacity. We also generalise these results to classical-quantum channels with finite-dimensional output quantum system, in particular to quantum channels on finite-dimensional quantum systems under the constraint that the identification code can only use tensor product inputs.

arXiv:2402.09117•IEEE Transactions on Information Theory•Jan 17, 2025•13 citations

Gaussian mean width strong converse bound on the classical identification capacity of quantum channels

Satvik Singh

We establish a single-letter and efficiently computable strong converse bound on the classical identification capacity of quantum channels. By equipping the $n$-fold channel output space with a product state-weighted $σ$-Euclidean geometry, we allow trace-distance separation constraints for identification codes to be controlled by Euclidean covering estimates. Using Sudakov's inequality, we bound the covering numbers of the $n$-fold channel outputs via their Gaussian mean widths in the weighted geometry, whose exponential growth in $n$ is governed by the operator norm of a single-letter positive operator. Upon optimizing over all weighing states $σ$, this yields a strong converse bound on the identification capacity of the channel, which also admits a semidefinite representation. Our method improves the best known converse bounds on the identification capacity of several important examples, such as depolarizing, Pauli, erasure, and amplitude damping channels. We also discuss extensions of this method to more general Euclidean geometries on the output space.

quant-pharXiv:2606.05032•Jun 4, 2026•0 citations
We study deterministic multi-user identification over bosonic channels using coherent-state signatures. Each user is assigned a coherent product state under an average energy constraint, and identification is performed by a user-specific binary quantum test. In contrast to classical multi-user identification models based on shared codebooks, this formulation associates each receiver with a geometric signature in high-dimensional phase space. Using metric entropy bounds, we show that the identification capacity exhibits a near-k log k scaling behavior.
Identification in quantum communication enables receivers to verify the presence of a message without decoding its entire content. While identification capacity has been explored for classical and finite-dimensional quantum channels, its behaviour in bosonic systems remains less understood. This work analyses identification over noisy bosonic broadcast channels using coherent states. We derive achievable identification rate regions while ensuring error probabilities remain bounded, even in an infinite-dimensional setting. Our approach leverages quantum hypothesis testing and approximates the infinite sender alphabet with discrete subsets to maintain power constraints.
The information-theoretic concept of identification describes a sender-receiver architecture in which the receiver only checks whether a particular message was sent or not, thereby promising a low-energy receiver design. In low received-energy regimes, quantum receivers are a promising tool for studying the system limits. However, the known information-theoretically optimal identification codes typically assume perfect synchronization. In this work, we study deterministic identification in a satellite setting under explicit synchronization constraints, where a satellite broadcasts the signature of a specific User Equipment (UE) which it assumes to be attached to one out of several possible Ground Station (GS), with the goal of establishing communication with the target UE. Within the proposed design, and assuming a specific phase-encoded coherent-state clock scheme in which the discrete time index is represented by equidistant phase rotations on the unit circle, our results reveal a fundamental asymmetry: At any transmission power, identification performance improves with blocklength, whereas synchronization accuracy degrades. In particular, the energy needed for transmitting the satellite clock to the GS can be several orders of magnitude higher than the one needed for the identification signal. This indicates that synchronization strongly impacts identification performance and motivates the investigation of the error-correcting capabilities of bosonic codes under jitter.
Multi-user detection is one of the important technical problems for modern communications. In the field of quantum communication, the multi-access channel on which we apply the technology of quantum information processing is still an open question. In this work, we investigate the multi-user detection problem based on the binary coherent-state signals whose communication way is supposed to be seen as a quantum channel. A binary phase shift keying model of this multi-access channel is studied and a novel method of quantum detection proposed according to the conclusion of the quantum measurement theory. As a result, the average interference between deferent users is presented and the average error probability of the quantum detection is derived theoretically. Finally, we show the maximum channel capacity of this effective detection for a two-access quantum channel
Following initial work by JaJa, and Ahlswede and Cai, and inspired by a recent renewed surge in interest in deterministic identification (DI) via noisy channels, we consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets. Such a channel is essentially given by (the closure of) the subset of its output distributions in the probability simplex. Our main findings are that the maximum number of messages thus identifiable scales super-exponentially as2Rnlog⁡n2^{Rn\log n}2Rnlognwith the block lengthnnn, and that the optimal rateRRRis upper and lower bounded in terms of the covering (aka Minkowski, or Kolmogorov, or entropy) dimensiondddof a certain algebraic transformation of the output set:14d≤R≤12d\frac{1}{4}d\leq R\leq\frac{1}{2}d41​d≤R≤21​d, Along the way, we present a Hypothesis Testing Lemma that shows it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code. Although we do not know the exact capacity formula, we can conclude that the DI capacity exhibits super-activation: there exist channels whose capacity is zero, but whose product has positive capacity. These results are then generalised to classical-quantum channels with finite-dimensional output quantum system (but arbitrary input alphabet), and in particular to quantum channels on finite-dimensional quantum systems under the constraint that the identification code can only use tensor product inputs.
Following initial work by JaJa, Ahlswede and Cai, and inspired by a recent renewed surge in interest in deterministic identification (DI) via noisy channels, we consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets. Such a channel is essentially given by its output distributions as a subset in the probability simplex. Our main findings are that the maximum length of messages thus identifiable scales superlinearly asR nlog⁡nR\,n\log nRnlognwith the block length n, and that the optimal rate R is bounded in terms of the covering (aka Minkowski, or Kolmogorov, or entropy) dimension d of a certain algebraic transformation of the output set:14d≤R≤12d\frac {1}{4} d \leq R \leq \frac {1}{2} d41​d≤R≤21​d. Remarkably, both the lower and upper Minkowski dimensions play a role in this result. Along the way, we present a Hypothesis Testing Lemma showing that it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code. Although we do not know the exact capacity formula, we can conclude that the DI capacity exhibits superactivation: there exist channels whose capacities individually are zero, but whose product has positive capacity. We also generalise these results to classical-quantum channels with finite-dimensional output quantum system, in particular to quantum channels on finite-dimensional quantum systems under the constraint that the identification code can only use tensor product inputs.
We establish a single-letter and efficiently computable strong converse bound on the classical identification capacity of quantum channels. By equipping the nnn-fold channel output space with a product state-weighted σσσ-Euclidean geometry, we allow trace-distance separation constraints for identification codes to be controlled by Euclidean covering estimates. Using Sudakov's inequality, we bound the covering numbers of the nnn-fold channel outputs via their Gaussian mean widths in the weighted geometry, whose exponential growth in nnn is governed by the operator norm of a single-letter positive operator. Upon optimizing over all weighing states σσσ, this yields a strong converse bound on the identification capacity of the channel, which also admits a semidefinite representation. Our method improves the best known converse bounds on the identification capacity of several important examples, such as depolarizing, Pauli, erasure, and amplitude damping channels. We also discuss extensions of this method to more general Euclidean geometries on the output space.