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

One-to-one parametrization of quantum channels

Fujiwara, Akio, Algoet, Paul·1999·Physical Review A

Abstract

In contrast to the many-to-one and quadratic nature of correspondence in the conventional representation of quantum channels, such as the operator-sum or the unitary representation, we present a one-to-one and linear (affine) parametrization of quantum channels. This parametrization enables us to visualize the convex structure of the space of quantum channels. To demonstrate its usefulness, we apply it to the analysis of quantum binary channels.

Integrity signals

Registry

Crossref · 10.1103/physreva.59.3290

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

This paper’s full text isn’t openly available, 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 expression of M_Δ given in Eq. (26) is not the most general possible, but it is the correct one for the representation of pure depolarizers with zero polarizance, such as the ones used in Ref. [21].

    “Actually, the expression of M ⌬ given in Eq. ͑26͒ is not the most general possible ͓26͔, but it is the correct one for the representation of pure depolarizers with zero polarizance, such as the ones used in Ref. ͓21͔.”

    From Linear optics and quantum maps (2007) · cites this paper as [26]

  • Lu and Chipman have shown that any given Mueller matrix M can be decomposed in the product M = M_D M_B M_Δ, where M_Δ, M_B, and M_D are complex-valued Mueller matrices representing a pure depolarizer, a retarder, and a diattenuator, respectively.

    “In Ref. ͓26͔, Lu and Chipman have shown that any given Mueller matrix M can be decomposed in the product M = M D M B M ⌬ ,͑25͒”

    From Linear optics and quantum maps (2007) · cites this paper as [26]

  • The Algoet-Fujiwara condition (11) always holds.

    “This implies that the Algoet-Fujiwara condition [1] (λ 1 ± λ 2 ) 2 (1 ± λ 3 ) 2 -t 2 3 (11 )”
  • For bistochastic maps, the extreme points are known to be unitary conjugations and to correspond to the four corners of a tetrahedron in the λk representation.

    “For bistochastic maps, the extreme points are known [1,11] to consist of the maps that conjugate by a unitary matrix and in the λ k”
  • The parameters are constrained by the Algoet-Fujiwara inequalities (λ1 ± λ2)^2 ≤ (1 ± λ3)^2.

    “It was shown in [1,11] that the λ k 's are limited by the inequalities (λ 1 ± λ 2 ) 2 (1 ± λ 3 ) 2 .”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Fujiwara, A., & Algoet, P.
Affiliations
Stanford University (US)
Venue
Physical Review A
Published
1999-05-01
Volume
59
Issue
5
Pages
3290-3294
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2023747038
Cited by
156
References
3
Citations by year
2026: 5 · 2025: 3 · 2024: 6 · 2023: 3 · 2022: 6 · 2021: 10 · 2020: 11 · 2019: 8 · 2018: 6 · 2017: 4 · 2016: 6 · 2015: 6 · 2014: 2 · 2013: 6 · 2012: 1
FWCI
6.19
Type
journal article
Language
en
Open access
closed
Locations
Physical Review A (publishedVersion)
Funders
Telecommunications Advancement Foundation
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 channels, operator-sum representation, unitary representations

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