{"title":"克利福德子系统代码","authors":"A. Klappenecker","doi":"10.1109/ISIT.2010.5513672","DOIUrl":null,"url":null,"abstract":"Subsystem codes are a generalization of decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. The known constructions of subsystem codes from classical codes are limited to quantum systems that all have the same dimension, and this dimension must be a power of a prime. It is shown that one can remove these restrictions and obtain subsystem codes in quantum systems of arbitrary finite dimension from classical codes that are subgroups of an abelian group. The constructions are derived from Clifford codes over abstract error groups with abelian index groups.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"626 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Clifford subsystem codes\",\"authors\":\"A. Klappenecker\",\"doi\":\"10.1109/ISIT.2010.5513672\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Subsystem codes are a generalization of decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. The known constructions of subsystem codes from classical codes are limited to quantum systems that all have the same dimension, and this dimension must be a power of a prime. It is shown that one can remove these restrictions and obtain subsystem codes in quantum systems of arbitrary finite dimension from classical codes that are subgroups of an abelian group. The constructions are derived from Clifford codes over abstract error groups with abelian index groups.\",\"PeriodicalId\":147055,\"journal\":{\"name\":\"2010 IEEE International Symposium on Information Theory\",\"volume\":\"626 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2010.5513672\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2010.5513672","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Subsystem codes are a generalization of decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. The known constructions of subsystem codes from classical codes are limited to quantum systems that all have the same dimension, and this dimension must be a power of a prime. It is shown that one can remove these restrictions and obtain subsystem codes in quantum systems of arbitrary finite dimension from classical codes that are subgroups of an abelian group. The constructions are derived from Clifford codes over abstract error groups with abelian index groups.