dorsal/arxiv
View SchemaUnconditionally Secure Quantum Key Distribution In Higher Dimensions
| Authors | H. F. Chau |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0212055 |
| URL | https://arxiv.org/abs/quant-ph/0212055 |
Abstract
In search of a quantum key distribution scheme that could stand up for more drastic eavesdropping attack, I discover a prepare-and-measure scheme using $N$-dimensional quantum particles as information carriers where $N$ is a prime power. Using the Shor-Preskill-type argument, I prove that this scheme is unconditional secure against all attacks allowed by the laws of quantum physics. Incidentally, for $N = 2^n > 2$, each information carrier can be replaced by $n$ entangled qubits. And in this case, I discover an eavesdropping attack on which no unentangled-qubit-based prepare-and-measure quantum key distribution scheme known to date can generate a provably secure key. In contrast, this entangled-qubit-based scheme produces a provably secure key under the same eavesdropping attack whenever $N \geq 16$. This demonstrates the advantage of using entangled particles as information carriers to combat certain eavesdropping strategies.
{
"annotation_id": "bbaf1785-a0ec-45d1-b5d1-bc01ecc543ed",
"date_created": "2026-03-02T18:01:56.665000Z",
"date_modified": "2026-03-02T18:01:56.665000Z",
"file_hash": "85a2aaebcbda464b2785157cecbd38d84427b88bad55cdfea1c23bf19d9739cf",
"private": false,
"record": {
"abstract": "In search of a quantum key distribution scheme that could stand up for more\ndrastic eavesdropping attack, I discover a prepare-and-measure scheme using\n$N$-dimensional quantum particles as information carriers where $N$ is a prime\npower. Using the Shor-Preskill-type argument, I prove that this scheme is\nunconditional secure against all attacks allowed by the laws of quantum\nphysics. Incidentally, for $N = 2^n \u003e 2$, each information carrier can be\nreplaced by $n$ entangled qubits. And in this case, I discover an eavesdropping\nattack on which no unentangled-qubit-based prepare-and-measure quantum key\ndistribution scheme known to date can generate a provably secure key. In\ncontrast, this entangled-qubit-based scheme produces a provably secure key\nunder the same eavesdropping attack whenever $N \\geq 16$. This demonstrates the\nadvantage of using entangled particles as information carriers to combat\ncertain eavesdropping strategies.",
"arxiv_id": "quant-ph/0212055",
"authors": [
"H. F. Chau"
],
"categories": [
"quant-ph"
],
"title": "Unconditionally Secure Quantum Key Distribution In Higher Dimensions",
"url": "https://arxiv.org/abs/quant-ph/0212055"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "23813e51-1014-4424-b657-d9edb07ebe97",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}