Ashwin Nayak  Home/Search
Context Related
| caltech.edu/~nayak/papers/eqfa.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: caltech.edu/~nayak/publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Consider the finite regular language Ln = fw0 j w 2 f0; 1g ; jwj ng. In [3] it was shown that while this language is accepted by a deterministic finite automaton of size O(n), any one-way quantum finite automaton(QFA) for it has size 2 \Omega\Gamma n= log n) . This was based on the fact that the evolution of a QFA is required to be reversible. When arbitrary intermediate measurements are allowed, this intuition breaks down. Nonetheless, we showa 2 \Omega\Gamma n) lower bound for such QFA ... (Update)
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)
Interaction in Quantum Communication and the.. - Klauck, Nayak.. (2003) (Correct)
Similar documents (at the sentence level):
51.5%: Optimal Lower Bounds for Quantum Automata and Random Access Codes - Nayak (1999) (Correct)
Active bibliography (related documents): More All
0.2: Quantum Entanglement and Communication Complexity - Buhrman, Cleve, Van Dam (1998) (Correct)
0.2: On quantum and probabilistic communication: Las Vegas and one-way .. - Klauck (2000) (Correct)
0.2: Dense Quantum Coding and a Lower Bound for 1-way.. - Ambainis, Nayak.. (1999) (Correct)
Similar documents based on text: More All
1.2: The Complexity of Probabilistic VS Quantum Finite Automata - Midrijanis (Correct)
0.8: Exact Results for Accepting Probabilities of Quantum Automata - Ambainis, Kikusts (2001) (Correct)
0.8: On the Class of Languages Recognizable By 1-Way Quantum .. - Ambainis, Kikusts.. (Correct)
Related documents from co-citation: More All
11: Cambridge university Press (context) - Kushilevitz, Nisan - 1996
11: Exponential separation of quantum and classical communication complexity - Raz - 1999
11: Quantum Entanglement and the Communication Complexity of the Inner Product Funct.. - Cleve, van Dam et al. - 1998
BibTeX entry: (Update)
A. Nayak. Optimal lower bounds for quantum automata and random access codes. In Proceedings of 40th FOCS, 1999. To appear. Also quant-ph/9904093. http://citeseer.ist.psu.edu/nayak99optimal.html More
@inproceedings{ nayak99optimal,
author = "Ashwin Nayak",
title = "Optimal Lower Bounds for Quantum Automata and Random Access Codes",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "369-377",
year = "1999",
url = "citeseer.ist.psu.edu/nayak99optimal.html" }
Citations (may not include all citations):2319 Elements of information theory (context) - Cover, Thomas - 1991
174 Private information retrieval - Chor, Goldreich et al. - 1995
85 Quantum circuit complexity - Yao - 1993
52 Information and Control (context) - Rabin - 1963
37 Quantum circuits with mixed states - Aharonov, Kitaev et al. - 1997
36 Quantum entanglement and the communication complexity of the.. - Cleve, van Dam et al. - 1998
22 The quantum communication complexity of sampling - Ambainis, Schulman et al. - 1998
21 the power of quantum finite state automata - Kondacs, Watrous - 1997
20 General properties of entropy (context) - Wehrl - 1978
19 Kluwer Academic Publishers (context) - Peres, concepts - 1995
14 Some estimates of the information transmitted by quantum com.. (context) - Holevo
13 way quantum finite automata: strengths (context) - Ambainis, Freivalds - 1998
11 Santa-Fe Institute Working Paper (context) - Moore, Crutchfield et al. - 1997
8 Dense quantum coding and a lower bound for 1-way quantum aut.. - Ambainis, Nayak et al. - 1999
8 The Hebrew University of Jerusalem (context) - Kremer, Master's - 1995
1 Lecture notes for Physics 229: Advanced mathematical methods.. (context) - Preskill - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.caltech.edu/~nayak/publ.html): More
Interaction in Quantum Communication and the.. - Klauck, Nayak.. (2001) (Correct)
Interaction in Quantum Communication and the Complexity of.. - Nayak, Ta-Shma (2000) (Correct)
Quantum Walk on the Line (Extended Abstract) - Nayak, al. (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