Cited by 108Quantum Information and CryptographyQuantum Computing Algorithms and ArchitectureQuantum Mechanics and Applications

Quantum-information distributors: Quantum network for symmetric and asymmetric cloning in arbitrary dimension and continuous limit

Open access
Braunstein, Samuel L., Bužek, Vladimír, Hillery, Mark·2001·Physical Review A

Abstract

We show that for any Hilbert-space dimension, the optimal $\stackrel{\ensuremath{\rightarrow}}{1}2$ universal quantum cloner can be constructed from essentially the same quantum circuit, i.e., we find a universal design for universal cloners. In the case of infinite dimensions (which includes continuous variable quantum systems) the universal cloner reduces to an essentially classical device. More generally, we construct a universal quantum circuit for distributing qudits in any dimension which acts covariantly under generalized displacements and momentum kicks. The behavior of this covariant distributor is controlled by its initial state. We show that suitable choices for this initial state yield both universal cloners and optimized cloners for limited alphabets of states related by generalized phase-space displacements.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreva.63.052313

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The two-parameter isometry set U_AB(α, β) generates all possible complementary channel pairs, up to local unitaries.

    “However, the two parameter isometry set with U AB = U AB (α, β ) (for α, β ∈ R) (with circuit as in Fig. 3 below) generates all possible complementary channel pairs, up to local unitaries [60].”

    From Simple formulation of no-cloning and no-hiding that admits efficient and robust verification (2024) · cites this paper as [60]

    The Introduction (p. 2) describes real parameters α and β controlling information transferred to two output systems, and Section III (p. 5) presents a circuit for that distributor. The paper does not establish that this two-parameter construction generates all possible complementary channel pairs up to local unitaries; its stated scope is a covariant information distributor. (LLM, conf=0.85)

    Experimental — accuracy not yet measured
  • For d_X = d_A = d_B = 2, all isometries can be expressed in the form V(α, β, γ) with 0 ≤ α, β, γ ≤ π.

    “For d X = d A = d B = 2, all isometries can be expressed in the above form, where 0 α, β, γ π [60].”

    From Simple formulation of no-cloning and no-hiding that admits efficient and robust verification (2024) · cites this paper as [60]

    Section II (p. 3) says the paper’s formalism reduces to the qubit case when N = 2. Section III (p. 6) describes a QID input state with real parameters α and β, but the passages found do not address whether all three-qubit isometries have a form V(α, β, γ) or specify the claimed angle ranges. I searched for isometries, γ, and a three-angle qubit parameterization. (LLM, conf=0.75)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. [2]See for example: M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000), in press.
  2. [8]S. Albeverio and S. M. Fei, European Phys. J. B 14 , 669 (2000) [see also quant-ph/9912038 ]. · arXiv
  3. [14]P. Deuar and W. J. Monroe, Phys. Rev. A 61 , 010396(R) (2000); see also Los Alamos arXive quant-ph/0008032 (2000). · arXiv
  4. [19]Wan-Li Li, Chuan-Feng Li, Yun-Feng Huang, YongSheng Zhang, Yong Jiang, and Guang-Can Guo, Los Alamos arXive quant-ph/0006032 (2000). · arXiv
  5. [34]P. A. M. Dirac, The Principles of Quantum Mechanics 4 th edition (Clarendon Press, Oxford, 1964).

Cited by

Sorted by citations

Authors
Braunstein, S. L., Bužek, V., & Hillery, M.
Affiliations
  • Bangor University (GB)
  • The University of Queensland (AU)
  • Hunter College (US)
Venue
Physical Review A
Published
2001-04-18
Volume
63
Issue
5
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2164854511
Cited by
108
References
1
Citations by year
2025: 4 · 2024: 2 · 2023: 1 · 2022: 5 · 2021: 2 · 2020: 1 · 2019: 2 · 2018: 6 · 2017: 1 · 2016: 5 · 2015: 2 · 2014: 5 · 2013: 5 · 2012: 4
FWCI
9.31
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
quantum cloning, quantum information distribution, qudits, continuous-variable quantum systems, momentum kick, quantum networks

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review