A Search Algorithm for Bases of Calderbank-Shor-Steane Type Quantum Error-Correcting Codes
Summary :
Recently, Vatan, Roychowdhury and Anantram have presented two types of revised versions of the Calderbank-Shor-Steane code construction, and have also provided an exhaustive procedure for determining bases of quantum error-correcting codes. In this paper, we investigate the revised versions given by Vatan et al., and point out that there is no essential difference between them. In addition, we propose an efficient algorithm for searching for bases of quantum error-correcting codes. The proposed algorithm is based on some fundamental properties of classical linear codes, and has much lower complexity than Vatan et al.'s procedure.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.3 pp.860-865
- Publication Date
- 2001/03/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kin-ichiroh TOKIWA, Hatsukazu TANAKA, "A Search Algorithm for Bases of Calderbank-Shor-Steane Type Quantum Error-Correcting Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 3, pp. 860-865, March 2001, doi: .
Abstract: Recently, Vatan, Roychowdhury and Anantram have presented two types of revised versions of the Calderbank-Shor-Steane code construction, and have also provided an exhaustive procedure for determining bases of quantum error-correcting codes. In this paper, we investigate the revised versions given by Vatan et al., and point out that there is no essential difference between them. In addition, we propose an efficient algorithm for searching for bases of quantum error-correcting codes. The proposed algorithm is based on some fundamental properties of classical linear codes, and has much lower complexity than Vatan et al.'s procedure.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_3_860/_p
Copy
@ARTICLE{e84-a_3_860,
author={Kin-ichiroh TOKIWA, Hatsukazu TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Search Algorithm for Bases of Calderbank-Shor-Steane Type Quantum Error-Correcting Codes},
year={2001},
volume={E84-A},
number={3},
pages={860-865},
abstract={Recently, Vatan, Roychowdhury and Anantram have presented two types of revised versions of the Calderbank-Shor-Steane code construction, and have also provided an exhaustive procedure for determining bases of quantum error-correcting codes. In this paper, we investigate the revised versions given by Vatan et al., and point out that there is no essential difference between them. In addition, we propose an efficient algorithm for searching for bases of quantum error-correcting codes. The proposed algorithm is based on some fundamental properties of classical linear codes, and has much lower complexity than Vatan et al.'s procedure.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - A Search Algorithm for Bases of Calderbank-Shor-Steane Type Quantum Error-Correcting Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 860
EP - 865
AU - Kin-ichiroh TOKIWA
AU - Hatsukazu TANAKA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2001
AB - Recently, Vatan, Roychowdhury and Anantram have presented two types of revised versions of the Calderbank-Shor-Steane code construction, and have also provided an exhaustive procedure for determining bases of quantum error-correcting codes. In this paper, we investigate the revised versions given by Vatan et al., and point out that there is no essential difference between them. In addition, we propose an efficient algorithm for searching for bases of quantum error-correcting codes. The proposed algorithm is based on some fundamental properties of classical linear codes, and has much lower complexity than Vatan et al.'s procedure.
ER -
English
