Capacity approaching coding for low noise interactive quantum communication

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

Capacity approaching coding for low noise interactive quantum communication

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

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings of the Annual ACM Symposium on Theory of Computing, 2018, pp. 926 - 939
Issue Date:: 2018-06-20

Closed Access

	Filename	Description	Size
	stoc18main-p294-p.pdf	Published version	1.63 MB	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	Leung, D	en_US
dc.contributor.author	Touchette, D	en_US
dc.contributor.author	Nayak, A	en_US
dc.contributor.author	Yao, P	en_US
dc.contributor.author	Shayeghi, A	en_US
dc.contributor.author	Yu, N https://orcid.org/0000-0003-1188-3032	en_US
dc.date.issued	2018-06-20	en_US
dc.identifier.citation	Proceedings of the Annual ACM Symposium on Theory of Computing, 2018, pp. 926 - 939	en_US
dc.identifier.isbn	9781450355599	en_US
dc.identifier.issn	0737-8017	en_US
dc.identifier.uri	http://hdl.handle.net/10453/133188
dc.description.abstract	© 2018 Copyright held by the owner/author(s). 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 noiseless qudit channels (where d is arbitrary), our main result is a simulation method that fails with probability less than 2−Θ(nϵ) and uses a qudit channel 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. Perhaps surprisingly, this outperforms the best known overhead of 1 + O log log ϵ1 in the corresponding classical model, which is also conjectured to be optimal [Haeupler, FOCS’14]. Our work also improves over the best previously known quantum result where the overhead is a non-explicit large constant [Brassard et al., FOCS’14] for low .	en_US
dc.relation.ispartof	Proceedings of the Annual ACM Symposium on Theory of Computing	en_US
dc.relation.isbasedon	10.1145/3188745.3188908	en_US
dc.title	Capacity approaching coding for low noise interactive quantum communication	en_US
dc.type	Conference Proceeding
utslib.for	0805 Distributed Computing	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	closed_access
pubs.publication-status	Published	en_US

Abstract:

© 2018 Copyright held by the owner/author(s). 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 noiseless qudit channels (where d is arbitrary), our main result is a simulation method that fails with probability less than 2−Θ(nϵ) and uses a qudit channel 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. Perhaps surprisingly, this outperforms the best known overhead of 1 + O log log ϵ1 in the corresponding classical model, which is also conjectured to be optimal [Haeupler, FOCS’14]. Our work also improves over the best previously known quantum result where the overhead is a non-explicit large constant [Brassard et al., FOCS’14] for low .

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

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