Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets

Leung, D; Nayak, A; Shayeghi, A; Touchette, D; Yao, P; Yu, N

Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets

Leung, D Nayak, A Shayeghi, A Touchette, D Yao, P Yu, N

Permalink

Publisher:: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Publication Type:: Journal Article
Citation:: IEEE Transactions on Information Theory, 2021, 67, (8), pp. 5443-5490
Issue Date:: 2021-08-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download PreprintAdobe PDF (1.91 MB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Leung, D
dc.contributor.author	Nayak, A
dc.contributor.author	Shayeghi, A
dc.contributor.author	Touchette, D
dc.contributor.author	Yao, P
dc.contributor.author	Yu, N https://orcid.org/0000-0003-1188-3032
dc.date.accessioned	2022-03-31T04:05:36Z
dc.date.available	2022-03-31T04:05:36Z
dc.date.issued	2021-08-01
dc.identifier.citation	IEEE Transactions on Information Theory, 2021, 67, (8), pp. 5443-5490
dc.identifier.issn	0018-9448
dc.identifier.issn	1557-9654
dc.identifier.uri	http://hdl.handle.net/10453/155770
dc.description.abstract	We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with n messages, designed for a noiseless qudit channel over a size alphabet, our main result is a simulation method that fails with probability less than and uses a qudit channel over the same alphabet n(1 + times, of which an fraction can be corrupted adversarially. The simulation is thus capacity achieving to leading order, and we conjecture that it is optimal up to a constant factor in the term. Furthermore, the simulation is in a model that does not require pre-shared resources such as randomness or entanglement between the communicating parties. Our work improves over the best previously known quantum result where the overhead is a non-explicit large constant [Brassard et al., SICOMP'19] for low.
dc.language	English
dc.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
dc.relation	http://purl.org/au-research/grants/arc/DE180100156
dc.relation	http://purl.org/au-research/grants/arc/DP210102449
dc.relation.ispartof	IEEE Transactions on Information Theory
dc.relation.isbasedon	10.1109/TIT.2021.3086221
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	0801 Artificial Intelligence and Image Processing, 0906 Electrical and Electronic Engineering, 1005 Communications Technologies
dc.subject.classification	Networking & Telecommunications
dc.title	Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets
dc.type	Journal Article
utslib.citation.volume	67
utslib.for	0801 Artificial Intelligence and Image Processing
utslib.for	0906 Electrical and Electronic Engineering
utslib.for	1005 Communications Technologies
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	*
dc.date.updated	2022-03-31T04:05:35Z
pubs.issue	8
pubs.publication-status	Published
pubs.volume	67
utslib.citation.issue	8

Abstract:

We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with n messages, designed for a noiseless qudit channel over a size alphabet, our main result is a simulation method that fails with probability less than and uses a qudit channel over the same alphabet n(1 + times, of which an fraction can be corrupted adversarially. The simulation is thus capacity achieving to leading order, and we conjecture that it is optimal up to a constant factor in the term. Furthermore, the simulation is in a model that does not require pre-shared resources such as randomness or entanglement between the communicating parties. Our work improves over the best previously known quantum result where the overhead is a non-explicit large constant [Brassard et al., SICOMP'19] for low.

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

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