Strategies and networks for state-dependent quantum cloning

Anthony Chefles, Stephen M. Barnett

Research output: Contribution to journalArticle

61 Citations (Scopus)

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 that interpolate between approximate and exact cloning. A tight inequality is obtained that expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit N → ∞, to a known inequality that 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 and we show how they may be decomposed into basic operations.
LanguageEnglish
Pages136-144
JournalPhysical Review A
Volume60
Issue number1
DOIs
Publication statusPublished - Jul 1999

Fingerprint

discrimination

Keywords

  • quantum cloning
  • quantum physics
  • optics

Cite this

Chefles, Anthony ; Barnett, Stephen M. / Strategies and networks for state-dependent quantum cloning. In: Physical Review A. 1999 ; Vol. 60, No. 1. pp. 136-144.
@article{7ae3a374aff14d81a18f2e81d8da6a61,
title = "Strategies and networks for state-dependent quantum cloning",
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 that interpolate between approximate and exact cloning. A tight inequality is obtained that expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit N → ∞, to a known inequality that 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 and we show how they may be decomposed into basic operations.",
keywords = "quantum cloning, quantum physics, optics",
author = "Anthony Chefles and Barnett, {Stephen M.}",
year = "1999",
month = "7",
doi = "10.1103/PhysRevA.60.136",
language = "English",
volume = "60",
pages = "136--144",
journal = "Physical Review A - Atomic, Molecular, and Optical Physics",
issn = "1050-2947",
number = "1",

}

Strategies and networks for state-dependent quantum cloning. / Chefles, Anthony; Barnett, Stephen M.

In: Physical Review A, Vol. 60, No. 1, 07.1999, p. 136-144.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Strategies and networks for state-dependent quantum cloning

AU - Chefles, Anthony

AU - Barnett, Stephen M.

PY - 1999/7

Y1 - 1999/7

N2 - 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 that interpolate between approximate and exact cloning. A tight inequality is obtained that expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit N → ∞, to a known inequality that 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 and we show how they may be decomposed into basic operations.

AB - 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 that interpolate between approximate and exact cloning. A tight inequality is obtained that expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit N → ∞, to a known inequality that 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 and we show how they may be decomposed into basic operations.

KW - quantum cloning

KW - quantum physics

KW - optics

UR - http://arxiv.org/PS_cache/quant-ph/pdf/9812/9812035v1.pdf

UR - http://dx.doi.org/10.1103/PhysRevA.60.136

U2 - 10.1103/PhysRevA.60.136

DO - 10.1103/PhysRevA.60.136

M3 - Article

VL - 60

SP - 136

EP - 144

JO - Physical Review A - Atomic, Molecular, and Optical Physics

T2 - Physical Review A - Atomic, Molecular, and Optical Physics

JF - Physical Review A - Atomic, Molecular, and Optical Physics

SN - 1050-2947

IS - 1

ER -