Cited by 122Quantum Information and CryptographyQuantum Mechanics and ApplicationsQuantum Computing Algorithms and Architecture

The Information-Disturbance Tradeoff and the Continuity of Stinespring's Representation

Open access
Kretschmann, Dennis, Schlingemann, Dirk, Werner, Reinhard F.·2008·IEEE Transactions on Information Theory

Abstract

Stinespring's dilation theorem is the basic structure theorem for quantum channels: it states that any quantum channel arises from a unitary evolution on a larger system. Here we prove a continuity theorem for Stinespring's dilation: if two quantum channels are close in cb-norm, then it is always possible to find unitary implementations which are close in operator norm, with dimension-independent bounds. This result generalizes Uhlmann's theorem from states to channels and allows to derive a formulation of the information-disturbance tradeoff in terms of quantum channels, as well as a continuity estimate for the no-broadcasting theorem. We briefly discuss further implications for quantum cryptography, thermalization processes, and the black hole information loss puzzle.

Integrity signals

Registry

Crossref · 10.1109/tit.2008.917696

Cites

41 of 41 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • For any input system X and output systems A and B, the full quantum CUP set C* is confined such that (u, ū)=(1,x) implies x=0.

    “Theorem B.2 (No-cloning bound on full quantum CUP set C * ).Given any input system X and output systems A and B. The associated full quantum CUP set C * is confined such that for”
  • The channel tr_A • V is complementary to E and, from Theorem IV.1 and [5], must be completely depolarizing to some fixed state.

    “The channel tr A • V is complementary to E and from Theorem IV.1 (and as a consequence of [5]) must therefore be completely depolarizing, tr A • V = D, to some fixed state.”

Cites

Flagged first, then by citations

2 of the 43 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Kretschmann, D., Schlingemann, D., & Werner, R. F.
Affiliations
  • University of Cambridge (GB)
  • Institute for Scientific Interchange (IT)
  • Technische Universität Braunschweig (DE)
Venue
IEEE Transactions on Information Theory
Published
2008-04
Volume
54
Issue
4
Pages
1708-1717
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2102077152
Cited by
122
References
43
Citations by year
2026: 6 · 2025: 9 · 2024: 10 · 2023: 6 · 2022: 9 · 2021: 5 · 2020: 7 · 2019: 5 · 2018: 10 · 2017: 8 · 2016: 7 · 2015: 4 · 2014: 7 · 2013: 5 · 2012: 2
FWCI
10.04
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Information Theory (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • European Commission
  • Deutscher Akademischer Austauschdienst
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
quantum channels, quantum cryptography, thermalization, black hole information loss

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