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

A Decoupling Approach to the Quantum Capacity

Open access
Hayden, Patrick, Horodecki, Michał, Winter, Andreas, Yard, Jon·2008·Open Systems & Information Dynamics

Abstract

We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective measurement on a typical subspace of a tensor power state. We show that, provided the rank of each measurement operator is sufficiently small, the transmitted data will, with high probability, be decoupled from the channel environment. We also show that our construction leads to random codes whose average input is close to a product state and outline a modification yielding unitarily invariant ensembles of maximally entangled codes.

Integrity signals

Registry

Crossref · 10.1142/s1230161208000043

Cites

3 of 3 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?

  • The decoupling approach essentially involves deriving entanglement wedge reconstruction from the Ryu-Takayanagi formula.

    “Indeed, one of the most popular methods to prove results about error correction in random unitaries, the so-called decoupling approach [71, 72], essentially involves deriving entanglement wedge reconstruction from the Ryu-Takayanagi formula.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Hayden, P., Horodecki, M., Winter, A., & Yard, J.
Affiliations
  • McGill University (CA)
  • University of Gdańsk (PL)
  • University of Bristol (GB)
  • California Institute of Technology (US)
Venue
Open Systems & Information Dynamics
Published
2008-03
Volume
15
Issue
01
Pages
7-19
ISSN
  • 1230-1612 (ISSN-L)
  • 1793-7191
OpenAlex
W1975313455
Cited by
170
References
3
Citations by year
2026: 9 · 2025: 8 · 2024: 8 · 2023: 8 · 2022: 10 · 2021: 18 · 2020: 9 · 2019: 9 · 2018: 9 · 2017: 5 · 2016: 13 · 2015: 7 · 2014: 14 · 2013: 5 · 2012: 7
FWCI
15.33
Type
journal article
Language
en
Open access
Locations
  • Open Systems & Information Dynamics (publishedVersion)
  • arXiv (Cornell University) (publishedVersion)
  • CaltechAUTHORS (California Institute of Technology) (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 channel capacity, coherent information, decoupling, noisy quantum channels

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