dorsal/arxiv
View SchemaStrategies and Networks for State-Dependent Quantum Cloning
| Authors | Anthony Chefles, Stephen M. Barnett |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9812035 |
| URL | https://arxiv.org/abs/quant-ph/9812035 |
| DOI | 10.1103/PhysRevA.60.136 |
Abstract
State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately, or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the maximum global fidelity of $N$ approximate clones given $M$ initial exact copies, where $N>M$. We also consider strategies which interpolate between approximate and exact cloning. A tight inequality is obtained which expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit as $N{\to}{\infty}$, to a known inequality which expresses the trade-off between error and inconclusive result probabilities for state-discrimination measurements. Quantum-computational networks are also constructed for the kinds of cloning machine we describe. For this purpose, we introduce two gates: the distinguishability transfer and state separation gates. Their key properties are described
{
"annotation_id": "e41e9523-8545-4856-9fa2-c7c68bf9fb20",
"date_created": "2026-03-02T18:02:44.975000Z",
"date_modified": "2026-03-02T18:02:44.975000Z",
"file_hash": "40372093bafb80a1465905beb14b22184ef698913586cc45a3dc34299b14c2d0",
"private": false,
"record": {
"abstract": "State-dependent cloning machines that have so far been considered either\ndeterministically copy a set of states approximately, or probablistically copy\nthem exactly. In considering the case of two equiprobable pure states, we\nderive the maximum global fidelity of $N$ approximate clones given $M$ initial\nexact copies, where $N\u003eM$. We also consider strategies which interpolate\nbetween approximate and exact cloning. A tight inequality is obtained which\nexpresses a trade-off between the global fidelity and success probability. This\ninequality is found to tend, in the limit as $N{\\to}{\\infty}$, to a known\ninequality which expresses the trade-off between error and inconclusive result\nprobabilities for state-discrimination measurements. Quantum-computational\nnetworks are also constructed for the kinds of cloning machine we describe. For\nthis purpose, we introduce two gates: the distinguishability transfer and state\nseparation gates. Their key properties are described",
"arxiv_id": "quant-ph/9812035",
"authors": [
"Anthony Chefles",
"Stephen M. Barnett"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.60.136",
"title": "Strategies and Networks for State-Dependent Quantum Cloning",
"url": "https://arxiv.org/abs/quant-ph/9812035"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "829c0da5-75b6-47e8-b008-18f0fa26f724",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}