Two New Families of Quantum Synchronizable Codes
share
In this paper, we present two ways of synchronization coding and enrich the variety of available quantum synchronizable codes. Based upon the (u+v|u-v) construction, we show that almost all existing codes with the highest tolerance against synchronization errors can be generalized to larger cases. Furthermore, the latter ones can may better performance in correcting Pauli errors. With the use of cyclic product codes, we produce another family of quantum synchronizable codes with flexible code lengths, in which case, the best attainable misalignment tolerance can also be achieved under certain constraints.
READ FULL TEXT