Pith. sign in

REVIEW 1 cited by

Designing Stochastic Channels

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.07156 v1 pith:SB4DBKTH submitted 2022-01-18 quant-ph

Designing Stochastic Channels

classification quant-ph
keywords channelsstochasticchannelunitaryquantumdesignprovebecause
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Stochastic channels are ubiquitous in the field of quantum information because they are simple and easy to analyze. In particular, Pauli channels and depolarizing channels are widely studied because they can be efficiently simulated in many relevant quantum circuits. Despite their wide use, the properties of general stochastic channels have received little attention. In this paper, we prove that the diamond distance of a general stochastic channel from the identity coincides with its process infidelity to the identity. We demonstrate with an explicit example that there exist multi-qubit stochastic channels that are not unital. We then discuss the relationship between unitary 1-designs and stochastic channels. We prove that the twirl of an arbitrary quantum channel by a unitary 1-design is always a stochastic channel. However, unlike with unitary 2-designs, the twirled channel depends upon the choice of unitary 1-design. Moreover, we prove by example that there exist stochastic channels that cannot be obtained by twirling a quantum channel by a unitary 1-design.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum random walks on d-regular graphs with Haar-random coin operators

    quant-ph 2026-07 accept novelty 6.0

    Haar-random coin quantum walks on d-regular graphs yield a non-ergodic averaged channel that depolarizes the coin while preserving forever-measurable initial-state information in the vertex subspace for Cayley graphs ...