Thumbnail
Access Restriction
Subscribed

Author Nayak, Ashwin ♦ Salzman, Julia
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2006
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Communication complexity ♦ Holevo bound ♦ Inner Product function ♦ Entanglement-assisted quantum channel ♦ Information theory ♦ Lower bounds ♦ Privacy amplification ♦ Quantum communication ♦ Shared entanglement ♦ Superdense coding
Abstract We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of the previous work on this problem, and on other communication tasks in the setting of bounded error entanglement-assisted communication, is based on sophisticated information theoretic arguments. Our results are derived from first principles, using a simple linear algebraic technique. A direct consequence is a tight lower bound for the Inner Product function that has found applications to privacy amplification in quantum key distribution protocols.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2006-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 53
Issue Number 1
Page Count 23
Starting Page 184
Ending Page 206


Open content in new tab

   Open content in new tab
Source: ACM Digital Library