dorsal/arxiv
View SchemaIdentification via Quantum Channels in the Presence of Prior Correlation and Feedback
| Authors | Andreas Winter |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0403203 |
| URL | https://arxiv.org/abs/quant-ph/0403203 |
| Journal | In: "General Theory of Information Transfer and Combinatorics" (eds. R. Ahlswede, L. B\"aumer, N. Cai, H. K. Aydinian, V. Blinovsky, C. Deppe and H. Mashurian), Springer LNCS 4123, pp. 486-504, 2006 |
Abstract
Continuing our earlier work (quant-ph/0401060), we give two alternative proofs of the result that a noiseless qubit channel has identification capacity 2: the first is direct by a "maximal code with random extension" argument, the second is by showing that 1 bit of entanglement (which can be generated by transmitting 1 qubit) and negligible (quantum) communication has identification capacity 2. This generalises a random hashing construction of Ahlswede and Dueck: that 1 shared random bit together with negligible communication has identification capacity 1. We then apply these results to prove capacity formulas for various quantum feedback channels: passive classical feedback for quantum-classical channels, a feedback model for classical-quantum channels, and "coherent feedback" for general channels.
{
"annotation_id": "b38707b2-7e62-4388-bb33-b395318c9f08",
"date_created": "2026-03-02T18:02:07.106000Z",
"date_modified": "2026-03-02T18:02:07.106000Z",
"file_hash": "55defd879b8ac79ada4e6968d30442a9aac84e15ae7b11d99d308958aabc8901",
"private": false,
"record": {
"abstract": "Continuing our earlier work (quant-ph/0401060), we give two alternative\nproofs of the result that a noiseless qubit channel has identification capacity\n2: the first is direct by a \"maximal code with random extension\" argument, the\nsecond is by showing that 1 bit of entanglement (which can be generated by\ntransmitting 1 qubit) and negligible (quantum) communication has identification\ncapacity 2.\n This generalises a random hashing construction of Ahlswede and Dueck: that 1\nshared random bit together with negligible communication has identification\ncapacity 1.\n We then apply these results to prove capacity formulas for various quantum\nfeedback channels: passive classical feedback for quantum-classical channels, a\nfeedback model for classical-quantum channels, and \"coherent feedback\" for\ngeneral channels.",
"arxiv_id": "quant-ph/0403203",
"authors": [
"Andreas Winter"
],
"categories": [
"quant-ph"
],
"journal_ref": "In: \"General Theory of Information Transfer and Combinatorics\"\n (eds. R. Ahlswede, L. B\\\"aumer, N. Cai, H. K. Aydinian, V. Blinovsky, C.\n Deppe and H. Mashurian), Springer LNCS 4123, pp. 486-504, 2006",
"title": "Identification via Quantum Channels in the Presence of Prior Correlation and Feedback",
"url": "https://arxiv.org/abs/quant-ph/0403203"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "9e983a2b-27ea-4ff5-bad3-e13c2674d818",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}