A scheme to protect against multiple quantum erasures
arXiv:1111.1555
Abstract
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.
arXiv comment31 pages
References in corpus (15)
- Quantum Computation with Quantum Dots
- Observation of three-photon Greenberger-Horne-Zeilinger entanglement
- Quantum Logic Gates in Optical Lattices
- Codes for the Quantum Erasure Channel
- Efficient many-party controlled teleportation of multi-qubit quantum information via entanglement
- Thresholds for topological codes in the presence of loss
- Multiparty Quantum Communication Complexity
- Fidelity and leakage of Josephson qubits
- Quantum optical coherence can survive photon losses: a continuous-variable quantum erasure correcting code
- Protecting an optical qubit against photon loss
- Experimentally feasible quantum erasure-correcting code for continuous variables
- Anonymous quantum communication
- Quantum Error Correction of a Qubit Loss in an Addressable Atomic System
- Information-theoretic interpretation of quantum error-correcting codes
- Quantum manipulation and simulation using Josephson junction arrays