We discuss concepts of message identification in the sense of Ahlswede and Dueck via general quantum channels, extending investigations for classical channels, initial work for classical-quantum (cq) channels and "quantum fingerprinting". We show that the identification capacity of a discrete memoryless quantum channel for classical information can be larger than that for transmission; this is in contrast to all previously considered models, where it turns out to equal the common randomness capacity (equals transmission capacity in our case): in particular, for a noiseless qubit, we show the identification capacity to be 2, while transmission and common randomness capacity are 1. Then we turn to a natural concept of identification of quantum messages (i.e. a notion of "fingerprint" for quantum states). This is much closer to quantum information transmission than its classical counterpart (for one thing, the code length grows only exponentially, compared to double exponentially for classical identification). Indeed, we show how the problem exhibits a nice connection to visible quantum coding. Astonishingly, for the noiseless qubit channel this capacity turns out to be 2: in other words, one can compress two qubits into one and this is optimal. In general however, we conjecture quantum identification capacity to be different from classical identification capacity.We discuss concepts of message identification in the sense of Ahlswede and Dueck via general quantum channels, extending investigations for classical channels, initial work for classical-quantum (cq) channels and "quantum fingerprinting". We show that the identification capacity of a discrete memoryless quantum channel for classical information can be larger than that for transmission; this is in contrast to all previously considered models, where it turns out to equal the common randomness capacity (equals transmission capacity in our case): in particular, for a noiseless qubit, we show the identification capacity to be 2, while transmission and common randomness capacity are 1. Then we turn to a natural concept of identification of quantum messages (i.e. a notion of "fingerprint" for quantum states). This is much closer to quantum information transmission than its classical counterpart (for one thing, the code length grows only exponentially, compared to double exponentially for classical identification). Indeed, we show how the problem exhibits a nice connection to visible quantum coding. Astonishingly, for the noiseless qubit channel this capacity turns out to be 2: in other words, one can compress two qubits into one and this is optimal. In general however, we conjecture quantum identification capacity to be different from classical identification capacity.

arXiv:quant-ph/0401060Jan 11, 20044 citations

Quantum and classical message protect identification via quantum channels

Andreas Winter

We discuss concepts of message identification in the sense of Ahlswede and Dueck via general quantum channels, extending investigations for classical channels, initial work for classical--quantum (cq) channels and ``quantum fingerprinting''. We show that the identification capacity of a discrete memoryless quantum channel for classical information can be larger than that for transmission; this is in contrast to all previously considered models, where it turns out to equal the common randomness capacity (equals transmission capacity in our case): in particular, for a noiseless qubit, we show the identification capacity to be 2, while transmission and common randomness capacity are 1. Then we turn to a natural concept of identification of quantum messages (i.e. a notion of ``fingerprint'' for quantum states). This is much closer to quantum information transmission than its classical counterpart (for one thing, the code length grows only exponentially, compared to double exponentially for classical identification). Indeed, we show how the problem exhibits a nice connection to visible quantum coding. Astonishingly, for the noiseless qubit channel this capacity turns out to be 2: in other words, one can compress two qubits into one and this is optimal. In general however, we conjecture quantum identification capacity to be different from classical identification capacity.We discuss concepts of message identification in the sense of Ahlswede and Dueck via general quantum channels, extending investigations for classical channels, initial work for classical--quantum (cq) channels and ``quantum fingerprinting''. We show that the identification capacity of a discrete memoryless quantum channel for classical information can be larger than that for transmission; this is in contrast to all previously considered models, where it turns out to equal the common randomness capacity (equals transmission capacity in our case): in particular, for a noiseless qubit, we show the identification capacity to be 2, while transmission and common randomness capacity are 1. Then we turn to a natural concept of identification of quantum messages (i.e. a notion of ``fingerprint'' for quantum states). This is much closer to quantum information transmission than its classical counterpart (for one thing, the code length grows only exponentially, compared to double exponentially for classical identification). Indeed, we show how the problem exhibits a nice connection to visible quantum coding. Astonishingly, for the noiseless qubit channel this capacity turns out to be 2: in other words, one can compress two qubits into one and this is optimal. In general however, we conjecture quantum identification capacity to be different from classical identification capacity.

Quantum Information and ComputationDec 1, 200415 citations

The entanglement-assisted transmission capacity is a strong converse bound for identification

Satvik Singh

Classical identification via a noisy channel is a communication task in which the receiver is not required to reconstruct the full transmitted message, but only to decide whether it coincides with a message of interest. This relaxation allows the number of identifiable messages to grow doubly exponentially with the blocklength. For quantum channels, the resulting (doubly exponential) identification capacity $C_{\mathrm{ID}}$ can strictly exceed the ordinary (exponential) transmission capacity $C$ . In this paper, we prove that the entanglement-assisted transmission capacity $C_E$ is a strong converse bound for this task: $C_{\mathrm{ID}}\leq C_E$ . For sufficiently low-noise channels, this bound can also be achieved via the Hayden-Winter (quantum) identification + fingerprinting codes. This yields an exact characterization $C_{\mathrm{ID}}=C_E$ of identification capacity for such channels. However, for general channels, we prove that this upper bound can be strict. We exhibit an explicit family of transpose-depolarizing channels for which $C_{\mathrm{ID}}<C_E$ . As a consequence, we also obtain the first example of strict superadditivity of the identification capacity $C_{\mathrm{ID}}$ .Classical identification via a noisy channel is a communication task in which the receiver is not required to reconstruct the full transmitted message, but only to decide whether it coincides with a message of interest. This relaxation allows the number of identifiable messages to grow doubly exponentially with the blocklength. For quantum channels, the resulting (doubly exponential) identification capacity $C_{\mathrm{ID}}$ can strictly exceed the ordinary (exponential) transmission capacity $C$. In this paper, we prove that the entanglement-assisted transmission capacity $C_E$ is a strong converse bound for this task: $C_{\mathrm{ID}}\leq C_E$. For sufficiently low-noise channels, this bound can also be achieved via the Hayden-Winter (quantum) identification + fingerprinting codes. This yields an exact characterization $C_{\mathrm{ID}}=C_E$ of identification capacity for such channels. However, for general channels, we prove that this upper bound can be strict. We exhibit an explicit family of transpose-depolarizing channels for which $C_{\mathrm{ID}}<C_E$. As a consequence, we also obtain the first example of strict superadditivity of the identification capacity $C_{\mathrm{ID}}$.

quant-pharXiv:2608.11000Aug 12, 20260 citations

Identification via Quantum Channels

Andreas Winter

arXiv:1212.0494Lecture notes in computer scienceJan 1, 201312 citations

Quantum information theory (invited paper)

Charles H. Bennett, Peter W. Shor

IEEE Press eBooksApr 1, 20000 citations

C_{\mathrm{ID}}

can strictly exceed the ordinary (exponential) transmission capacity

C

. In this paper, we prove that the entanglement-assisted transmission capacity

C_E

is a strong converse bound for this task:

C_{\mathrm{ID}}\leq C_E

. For sufficiently low-noise channels, this bound can also be achieved via the Hayden-Winter (quantum) identification + fingerprinting codes. This yields an exact characterization

C_{\mathrm{ID}}=C_E

of identification capacity for such channels. However, for general channels, we prove that this upper bound can be strict. We exhibit an explicit family of transpose-depolarizing channels for which

C_{\mathrm{ID}}<C_E

. As a consequence, we also obtain the first example of strict superadditivity of the identification capacity

C_{\mathrm{ID}}