Entanglement-assisted quantum quasicyclic low-density parity-check codes

Hsieh, MH; Brun, TA; Devetak, I

Entanglement-assisted quantum quasicyclic low-density parity-check codes

Hsieh, MH Brun, TA Devetak, I

Permalink

Publisher:: AMER PHYSICAL SOC
Publication Type:: Journal Article
Citation:: Physical Review A - Atomic, Molecular, and Optical Physics, 2009, 79, (3)
Issue Date:: 2009-03-03

Closed Access

	Filename	Description	Size
	0803.0100v2.pdf		179.69 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Hsieh, MH
dc.contributor.author	Brun, TA
dc.contributor.author	Devetak, I
dc.date.accessioned	2023-03-13T23:10:58Z
dc.date.available	2023-03-13T23:10:58Z
dc.date.issued	2009-03-03
dc.identifier.citation	Physical Review A - Atomic, Molecular, and Optical Physics, 2009, 79, (3)
dc.identifier.issn	1050-2947
dc.identifier.issn	1094-1622
dc.identifier.uri	http://hdl.handle.net/10453/167236
dc.description.abstract	We investigate the construction of quantum low-density parity-check (LDPC) codes from classical quasicyclic (QC) LDPC codes with girth greater than or equal to 6. We have shown that the classical codes in the generalized Calderbank-Skor-Steane construction do not need to satisfy the dual-containing property as long as preshared entanglement is available to both sender and receiver. We can use this to avoid the many four cycles which typically arise in dual-containing LDPC codes. The advantage of such quantum codes comes from the use of efficient decoding algorithms such as sum-product algorithm (SPA). It is well known that in the SPA, cycles of length 4 make successive decoding iterations highly correlated and hence limit the decoding performance. We show the principle of constructing quantum QC-LDPC codes which require only small amounts of initial shared entanglement. © 2009 The American Physical Society.
dc.language	English
dc.publisher	AMER PHYSICAL SOC
dc.relation.ispartof	Physical Review A - Atomic, Molecular, and Optical Physics
dc.relation.isbasedon	10.1103/PhysRevA.79.032340
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	01 Mathematical Sciences, 02 Physical Sciences, 03 Chemical Sciences
dc.subject.classification	General Physics
dc.title	Entanglement-assisted quantum quasicyclic low-density parity-check codes
dc.type	Journal Article
utslib.citation.volume	79
utslib.for	01 Mathematical Sciences
utslib.for	02 Physical Sciences
utslib.for	03 Chemical Sciences
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	closed_access	*
dc.date.updated	2023-03-13T23:10:57Z
pubs.issue	3
pubs.publication-status	Published
pubs.volume	79
utslib.citation.issue	3

Abstract:

We investigate the construction of quantum low-density parity-check (LDPC) codes from classical quasicyclic (QC) LDPC codes with girth greater than or equal to 6. We have shown that the classical codes in the generalized Calderbank-Skor-Steane construction do not need to satisfy the dual-containing property as long as preshared entanglement is available to both sender and receiver. We can use this to avoid the many four cycles which typically arise in dual-containing LDPC codes. The advantage of such quantum codes comes from the use of efficient decoding algorithms such as sum-product algorithm (SPA). It is well known that in the SPA, cycles of length 4 make successive decoding iterations highly correlated and hence limit the decoding performance. We show the principle of constructing quantum QC-LDPC codes which require only small amounts of initial shared entanglement. © 2009 The American Physical Society.

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

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