Pith. sign in

REVIEW

Unconditional fidelity thresholds in single copy distillation and some aspects of quantum error correction

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 quant-ph/0501105 v1 pith:5UAPYFP4 submitted 2005-01-20 quant-ph

Unconditional fidelity thresholds in single copy distillation and some aspects of quantum error correction

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

Various aspects of distillation of noisy entanglement and some associated effects in quantum error correction are considered. In particular we prove that if only one--way classical communication (from Alice to Bob) is allowed and the shared $d \otimes d$ state is not pure then there is a threshold for optimal entanglement fraction $F$ of the state (being an overlap between the shared state and symmetric maximally entangled state) which can be obtained in single copy distillation process. This implies that to get (probabilistically) arbitrary good conclusive teleportation via mixed state at least one classical bit of backward communication (for Bob to Alice) has to be sent. We provide several other threshold properties in this context including in particular the existence of ultimate threshold of optimal $F$ for states of full rank. Finally the threshold results are linked to those of error correction. Namely it is pointed out that in quantum computer working on fixed number of quantum bits almost any kind of noise can be (probabilistically) corrected only to some threshold error bar though there are some (rare) exceptions.

discussion (0)

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