The Multiplicative Domain in Quantum Error Correction
نویسنده
چکیده
We show that the multiplicative domain of a completely positive map yields a new class of quantum error correcting codes. In the case of a unital quantum channel, these are precisely the codes that do not require a measurement as part of the recovery process, the so-called unitarily correctable codes. Whereas in the arbitrary, not necessarily unital case they form a proper subset of unitarily correctable codes that can be computed from properties of the channel. As part of the analysis we derive a representation theoretic characterization of subsystem codes. We also present a number of illustrative examples.
منابع مشابه
Five Quantum Register Error Correction Code For Higher Spin Systems
I construct a quantum error correction code (QECC) in higher spin systems using the idea of multiplicative group character. Each N state quantum particle is encoded as five N state quantum registers. By doing so, this code can correct any quantum error arising from any one of the five quantum registers. This code generalizes the well-known five qubit perfect code in spin-1/2 systems and is show...
متن کاملQuantum Error-Correction Codes on Abelian Groups
We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.
متن کاملToric Codes, Multiplicative Structure and Decoding
Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for decoding, resembling the decoding of Reed-Solomon codes and aligns with decoding by error correcting pairs. We have used the multiplicative structure on toric codes to c...
متن کاملGENERALIZED JOINT HIGHER-RANK NUMERICAL RANGE
The rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. For noisy quantum channel, a quantum error correcting code of dimension k exists if and only if the associated joint rank-k numerical range is non-empty. In this paper the notion of joint rank-k numerical range is generalized and some statements of [2011, Generaliz...
متن کاملFrequency domain analysis of transient flow in pipelines; application of the genetic programming to reduce the linearization errors
The transient flow analyzing by the frequency domain method (FDM) is computationally much faster than the method of characteristic (MOC) in the time domain. FDM needs no discretization in time and space, but requires the linearization of governing equations and boundary conditions. Hence, the FDM is only valid for small perturbations in which the system’s hydraulics is almost linear. In this st...
متن کامل