Pith. sign in

REVIEW 1 cited by

Optimal linear optical implementation of a single-qubit damping channel

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 1109.2070 v1 pith:C62DAL5X submitted 2011-09-09 quant-ph

Optimal linear optical implementation of a single-qubit damping channel

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

We experimentally demonstrate a single-qubit decohering quantum channel using linear optics. We implement the channel, whose special cases include both the amplitude-damping channel and the bit-flip channel, using a single, static optical setup. Following a recent theoretical result [M. Piani et al., Phys. Rev. A, 84, 032304 (2011)], we realize the channel in an optimal way, maximizing the probability of success, i.e., the probability for the photonic qubit to remain in its encoding. Using a two-photon entangled resource, we characterize the channel using ancilla-assisted process tomography and find average process fidelities of 0.9808 \pm 0.0002 and 0.9762 \pm 0.0002 for amplitude-damping and the bit-flip case, respectively.

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. The Geometry of Quantum Complexity in Open Systems

    quant-ph 2026-07 accept novelty 7.0

    Nielsen complexity for Lindbladian open systems induces a sub-Finslerian geometry on mixed states whose flag curvature depends on control penalty factors.