dorsal/arxiv
View SchemaOptimal asymmetric cloning machine on a great circle using no-signalling condition
| Authors | Samir Kunkri, Md. Manirul Ali, Geetu Narang, Debasis Sarkar |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0211169 |
| URL | https://arxiv.org/abs/quant-ph/0211169 |
Abstract
Assuming the condition of no superluminal signalling, we got an upper bound on the quality of all asymmetric $ 1\to 2$ cloning machines, acting on qubits whose Bloch vectors lie on a great circle. Then we constructed an $ 1\to 2$ cloning machine, which asymmetrically clone all qubits corresponding to this great circle, and this machine matches with that upper bound, and hence this is optimal one.
{
"annotation_id": "57ef0a33-e40d-4e58-9ba8-1953b5ab85a1",
"date_created": "2026-03-02T18:01:55.463000Z",
"date_modified": "2026-03-02T18:01:55.463000Z",
"file_hash": "3441883ca5c58a9c56947d80deab12132a55b56eb430ddce679547fddb153579",
"private": false,
"record": {
"abstract": "Assuming the condition of no superluminal signalling, we got an upper bound\non the quality of all asymmetric $ 1\\to 2$ cloning machines, acting on qubits\nwhose Bloch vectors lie on a great circle. Then we constructed an $ 1\\to 2$\ncloning machine, which asymmetrically clone all qubits corresponding to this\ngreat circle, and this machine matches with that upper bound, and hence this is\noptimal one.",
"arxiv_id": "quant-ph/0211169",
"authors": [
"Samir Kunkri",
"Md. Manirul Ali",
"Geetu Narang",
"Debasis Sarkar"
],
"categories": [
"quant-ph"
],
"title": "Optimal asymmetric cloning machine on a great circle using no-signalling condition",
"url": "https://arxiv.org/abs/quant-ph/0211169"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "bb43bb4d-f63a-41d8-99f5-ff4059746030",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}