Dense quantum coding and a lower bound for 1-way quantum automata

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Andris Ambainis Computer Science Division, UC Berkeley
Ashwin Nayak Computer Science Division, UC Berkeley
Ammon Ta-Shma International Computer Science Insitute, Berkeley
Umesh Vazirani Computer Science Division, UC Berkeley
Dense quantum coding and a lower bound for 1-way quantum automata Published by ACM 1999 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 11
· Downloads (cumulative): 307
· Citation Count: 15

Published in:
· Proceeding
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pages 376-383
ACM New York, NY, USA ©1999
table of contents ISBN:1-58113-067-8 doi>10.1145/301250.301347

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder