A scheme to protect against multiple quantum erasures

Details A scheme to protect against multiple quantum erasures A scheme to protect against multiple quantum erasures

2011-11-07

arxiv.org/abs/1111.1555v3

Computer Science

Information Theory

31 pages

Scientific paper

We present a scheme able to protect k >= 3 qubits of information against the occurrence of multiple erasures, based on the code proposed by Yang et al. (2004 JETP Letters 79 236). In this scheme redundant blocks are used and we restrict to the case that each erasure must occur in distinct blocks. We explicitly characterize the encoding operation and the restoring operation required to implement this scheme. The operators used in these operations can be adjusted to construct different quantum erasure-correcting codes. A special feature of this scheme is that no measurement is required. To illustrate our scheme, we present an example in which five-qubits of information are protected against the occurrence of two erasures.

Affiliated with

Also associated with

No associations

Rating

A scheme to protect against multiple quantum erasures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A scheme to protect against multiple quantum erasures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A scheme to protect against multiple quantum erasures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-691298