Presentation | 2008-07-25 Concatenation of Quantum Error-Correcting Codes and Lower Bounds on the Largest Minimum Distance Mitsuru Hamada, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | Lower bounds on the largest minimum distance of quantum error-correcting codes constructible in polynomial time are presented. Concatenated quantum codes attaining these bounds are presented explicitly. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Quantum codes / concatenation / symplectic codes / polynomial time |
Paper # | IT2008-17 |
Date of Issue |
Conference Information | |
Committee | IT |
---|---|
Conference Date | 2008/7/18(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Information Theory (IT) |
---|---|
Language | ENG |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Concatenation of Quantum Error-Correcting Codes and Lower Bounds on the Largest Minimum Distance |
Sub Title (in English) | |
Keyword(1) | Quantum codes |
Keyword(2) | concatenation |
Keyword(3) | symplectic codes |
Keyword(4) | polynomial time |
1st Author's Name | Mitsuru Hamada |
1st Author's Affiliation | Quantum Information Science Research Center Tamagawa University Research Institute() |
Date | 2008-07-25 |
Paper # | IT2008-17 |
Volume (vol) | vol.108 |
Number (no) | 159 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |