Construction and Performance of Quantum Burst Error Correction Codes for Correlated Errors

Fan, J; Hsieh, MH; Chen, H; Li, Y

Construction and Performance of Quantum Burst Error Correction Codes for Correlated Errors

Fan, J Hsieh, MH

Chen, H Li, Y

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE International Symposium on Information Theory - Proceedings, 2018, 2018-June pp. 2336 - 2340
Issue Date:: 2018-08-15

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted manuscriptAdobe PDF (551.94 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Fan, J	en_US
dc.contributor.author	Hsieh, MH https://orcid.org/0000-0002-3396-8427	en_US
dc.contributor.author	Chen, H	en_US
dc.contributor.author	Li, Y	en_US
dc.date.available	2020-08-31T19:03:41Z
dc.date.issued	2018-08-15	en_US
dc.identifier.citation	IEEE International Symposium on Information Theory - Proceedings, 2018, 2018-June pp. 2336 - 2340	en_US
dc.identifier.isbn	9781538647806	en_US
dc.identifier.issn	2157-8095	en_US
dc.identifier.uri	http://hdl.handle.net/10453/131292
dc.description.abstract	© 2018 IEEE. In practical communication and computation systems, errors occur predominantly in adjacent positions rather than in a random manner. In this paper, we develop a stabilizer formalism for quantum burst error correction codes (QBECC) to combat such error patterns in the quantum regime. Our contributions are as follows. Firstly, we derive an upper bound for the correctable burst errors of QBECCs, the quantum Reiger bound (QRB). Secondly, we propose two constructions of QBECCs: one by heuristic computer search and the other by concatenating two quantum tensor product codes (QTPCs). We obtain several new QBECCs with better parameters than existing codes with the same coding length. Moreover, some of the constructed codes can saturate the quantum Reiger bounds. Finally, we perform numerical experiments for our constructed codes over Markovian correlated depolarizing quantum memory channels, and show that QBECCs indeed outperform standard QECCs in this scenario.	en_US
dc.relation.ispartof	IEEE International Symposium on Information Theory - Proceedings	en_US
dc.relation.isbasedon	10.1109/ISIT.2018.8437493	en_US
dc.rights	info:eu-repo/semantics/openAccess
dc.title	Construction and Performance of Quantum Burst Error Correction Codes for Correlated Errors	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2018-June	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	open_access	*
pubs.publication-status	Published	en_US
pubs.volume	2018-June	en_US

Abstract:

© 2018 IEEE. In practical communication and computation systems, errors occur predominantly in adjacent positions rather than in a random manner. In this paper, we develop a stabilizer formalism for quantum burst error correction codes (QBECC) to combat such error patterns in the quantum regime. Our contributions are as follows. Firstly, we derive an upper bound for the correctable burst errors of QBECCs, the quantum Reiger bound (QRB). Secondly, we propose two constructions of QBECCs: one by heuristic computer search and the other by concatenating two quantum tensor product codes (QTPCs). We obtain several new QBECCs with better parameters than existing codes with the same coding length. Moreover, some of the constructed codes can saturate the quantum Reiger bounds. Finally, we perform numerical experiments for our constructed codes over Markovian correlated depolarizing quantum memory channels, and show that QBECCs indeed outperform standard QECCs in this scenario.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/131292