Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh Vazirani  Home/Search
Context Related
| berkeley.edu/~ashwin/papers...qfa.ps.gz berkeley.edu/~amnon/Papers/qaut.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/~ashwin/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the possibility of encoding m classical bits into much fewer n quantum bits so that an arbitrary bit from the original m bits can be recovered with a good probability, and we show that nontrivial quantum encodings exist that have no classical counterparts. On the other hand, we show that quantum encodings cannot be much more succint as compared to classical encodings, and we provide a lower bound on such quantum encodings. Finally, using this lower bound, we prove an exponential... (Update)
Context of citations to this paper: More
...that the VCdimension lower bound of [26] can be extended to the (bounded error) quantum case. We get a tight bound by using the results of [3] on random access quantum coding. We furthermore show that for total functions and one way protocols exact quantum communication is...
Cited by: More
On the Power of Quantum Memory - König, Maurer, Renner (2003) (Correct)
A Generic Security Proof for Quantum Key Distribution - Christandl, Renner, Ekert (2004) (Correct)
One-Way Communication Complexity And The Neciporuk Lower Bound on .. - Klauck (Correct)
Similar documents (at the sentence level):
42.4%: Dense Quantum Coding and a Lower Bound for 1-way.. - Ambainis, Nayak.. (1999) (Correct)
9.1%: Dense Quantum Coding and Quantum Finite Automata - Andris Ambainis Institute (2002) (Correct)
Active bibliography (related documents): More All
0.5: Size of Finite Probabilistic and Quantum Automata - Bonner, Freivalds, Rasscevskis (2002) (Correct)
0.2: The Capacity of Quantum Channel with General Signal States - Holevo (1996) (Correct)
0.2: A Game of Prediction with Expert Advice - Vovk (1997) (Correct)
Similar documents based on text: More All
0.7: Optimal Lower Bounds for Quantum Automata and Random Access Codes - Nayak (1999) (Correct)
0.6: The Complexity of Probabilistic VS Quantum Finite Automata - Midrijanis (Correct)
0.5: Interaction in Quantum Communication and the.. - Klauck, Nayak.. (2001) (Correct)
Related documents from co-citation: More All
4: Some estimates of the information transmitted by quantum communication channel (context) - Holevo - 1973
4: Optimal lower bounds for quantum automata and random access codes - Nayak - 1999
3: Quantum circuits with mixed states - Aharonov, Kitaev et al. - 1998
BibTeX entry: (Update)
A. Ambainis, A. Nayak, A. Ta-Shma and U. Vazirani. Dense quantum coding and a lower bound for 1-way quantum automata. To appear in Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing, 1999. http://citeseer.ist.psu.edu/article/ambainis99dense.html More
@inproceedings{ ambainis99dense,
author = "Andris Ambainis and Ashwin Nayak and Ammon Ta-Shma and Umesh Vazirani",
title = "Dense quantum coding and a lower bound for 1-way quantum automata",
pages = "376--383",
year = "1999",
url = "citeseer.ist.psu.edu/article/ambainis99dense.html" }
Citations (may not include all citations):2319 Elements of information theory (context) - Cover, Thomas - 1991
173 Quantum complexity theory - Bernstein, Vazirani - 1997
102 Strengths and weaknesses of quantum computing - Bennett, Bernstein et al. - 1997
52 Information and Control (context) - Rabin - 1963
23 Philosophical Transactions of the Royal Society of London (context) - Vazirani, power et al. - 1998
21 the power of quantum finite state automata - Kondacs, Watrous - 1997
13 way quantum finite automata: strengths (context) - Ambainis, Freivalds - 1998
11 Santa-Fe Institute Working Paper (context) - Moore, Crutchfield et al. - 1997
7 Relationships between quantum and classical space-bounded co.. - Watrous - 1998
6 The complexity of probabilistic versus deterministic finite .. - Ambainis - 1996
5 the growth of the number of states in result of determinizat.. (context) - Freivalds - 1982
4 Some estimates of the information transmitted by quantum com.. (context) - Kholevo - 1973
4 A nonconstructive upper bound on covering radius (context) - Cohen - 1983
3 Personal communication (context) - Chuang - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.berkeley.edu/~ashwin/): More
Optimal Lower Bounds for Quantum Automata and Random Access Codes - Nayak (1999) (Correct)
Spatial Codes and the Hardness of String Folding Problems - Nayak, Sinclair, Zwick (1998) (Correct)
The Quantum Query Complexity of Approximating the Median and.. - Nayak, Wu (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC