Entanglement-assisted quantum quasicyclic low-density parity-check

Hsieh, M; Brun, T; Devetak, I

Entanglement-assisted quantum quasicyclic low-density parity-check

Hsieh, M Brun, T Devetak, I

Permalink

Publisher:: American Physical Society
Publication Type:: Journal Article
Citation:: Hsieh, Min-Hsiu, Brun, Todd, and Devetak, Igor 2009, 'Entanglement-assisted quantum quasicyclic low-density parity-check', Physical Review A, vol. 79, no. 3, pp. 032340-1-032340-8.
Issue Date:: 2009

Closed Access

	Filename	Description	Size
	2012004789OK.pdf		96.51 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, M	en_US
dc.contributor.author	Brun, T	en_US
dc.contributor.author	Devetak, I	en_US
dc.date.accessioned	2014-08-17T18:05:30Z
dc.date.available	2014-08-17T18:05:30Z
dc.date.issued	2009	en_US
dc.identifier	2012004789	en_US
dc.identifier.citation	Hsieh, Min-Hsiu, Brun, Todd, and Devetak, Igor 2009, 'Entanglement-assisted quantum quasicyclic low-density parity-check', Physical Review A, vol. 79, no. 3, pp. 032340-1-032340-8.	en_US
dc.identifier.issn	1050-2947	en_US
dc.identifier.other	C1UNSUBMIT	en_US
dc.identifier.uri	http://hdl.handle.net/10453/28839
dc.description.abstract	We investigate the construction of quantum low-density parity-check (LDPC) codes from classical quasi-cyclic (QC) LDPC codes with girth greater than or equal to 6. We have shown that the classical codes in the generalized Calderbank-Shor-Steane (CSS) construction do not need to satisfy the dual-containing property as long as pre-shared entanglement is available to both sender and receiver. We can use this to avoid the many 4-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.	en_US
dc.publisher	American Physical Society	en_US
dc.relation.ispartof	Physical Review A	en_US
dc.relation.ispartof	Verified OK	en_US
dc.relation.isbasedon	http://dx.doi.org/10.1103/PhysRevA.79.032340	en_US
dc.subject	cyclic codes; decoding; error correction codes; polynomial matrices; quantum computing; quantum entanglement	en_US
dc.subject.classification	Quantum Information, Computation and Communication	en_US
dc.title	Entanglement-assisted quantum quasicyclic low-density parity-check	en_US
dc.type	Journal article
utslib.citation.volume	79	en_US
utslib.citation.number	3	en_US
utslib.location	USA	en_US
utslib.citation.startpage	032340-1	en_US
utslib.citation.endpage	032340-8	en_US
utslib.identifier.org	FEIT.A/DRsch Ctr Quantum Computat'n & Intelligent Systs	en_US
utslib.for	020603	en_US
utslib.percentage	100	en_US
utslib.copyright.status	closed_access

Abstract:

We investigate the construction of quantum low-density parity-check (LDPC) codes from classical quasi-cyclic (QC) LDPC codes with girth greater than or equal to 6. We have shown that the classical codes in the generalized Calderbank-Shor-Steane (CSS) construction do not need to satisfy the dual-containing property as long as pre-shared entanglement is available to both sender and receiver. We can use this to avoid the many 4-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.

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

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