dorsal/arxiv
View SchemaHighly asymmetric quantum cloning in arbitrary dimension
| Authors | Jaromir Fiurasek, Radim Filip, Nicolas J. Cerf |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0505212 |
| URL | https://arxiv.org/abs/quant-ph/0505212 |
| Journal | Quant. Inform. Comp. 5, 583 (2005). |
Abstract
We investigate the universal asymmetric cloning of states in a Hilbert space of arbitrary dimension. We derive the class of optimal and fully asymmetric 1->3 cloners, which produce three copies, each having a different fidelity. A simple parametric expression for the maximum achievable cloning fidelity triplets is then provided. As a side-product, we also prove the optimality of the 1->2 asymmetric cloning machines that have been proposed in the literature.
{
"annotation_id": "c8d61276-b8fc-4865-9ca3-f242ab400b5d",
"date_created": "2026-03-02T18:02:17.057000Z",
"date_modified": "2026-03-02T18:02:17.057000Z",
"file_hash": "082197795a7fd2937b685b2bfd55061c8b6c661eb653cec1dd70d777d92ba13d",
"private": false,
"record": {
"abstract": "We investigate the universal asymmetric cloning of states in a Hilbert space\nof arbitrary dimension. We derive the class of optimal and fully asymmetric\n1-\u003e3 cloners, which produce three copies, each having a different fidelity. A\nsimple parametric expression for the maximum achievable cloning fidelity\ntriplets is then provided. As a side-product, we also prove the optimality of\nthe 1-\u003e2 asymmetric cloning machines that have been proposed in the literature.",
"arxiv_id": "quant-ph/0505212",
"authors": [
"Jaromir Fiurasek",
"Radim Filip",
"Nicolas J. Cerf"
],
"categories": [
"quant-ph"
],
"journal_ref": "Quant. Inform. Comp. 5, 583 (2005).",
"title": "Highly asymmetric quantum cloning in arbitrary dimension",
"url": "https://arxiv.org/abs/quant-ph/0505212"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "ff238b46-5c29-4f59-b316-d2c84a72cb11",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}