Lower bounds in the quantum cell probe model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 358-369

  Sen, Pranab ^a   Venkatesh, S ^b  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CELLS; COMPUTATIONAL COMPLEXITY; CYTOLOGY; DIGITAL STORAGE; PROBES; COMPUTATIONAL LINGUISTICS;

CLASSICAL COMMUNICATION; GROVER'S ALGORITHM; MEMBERSHIP PROBLEM; PREDECESSOR PROBLEMS; QUANTUM COMMUNICATION COMPLEXITY; QUANTUM PARALLELISM; QUANTUM QUERIES; QUANTUM QUERY ALGORITHM; STORAGE SCHEMES;

QUANTUM COMMUNICATION;

EID: 84879547615     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_30     Document Type: Conference Paper

References (17)

1. P. Beame and F. Fich. Optimal bounds for the predecessor problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 295-304, 1999.
2. H. Buhrman, P. Miltersen, J. Radhakrishnan, and S. Venkatesh. Are bitvectors optimal In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 449-458, 2000.
3. R. Cleve, W. van Dam, , M. Nielsen, and A. Tapp. Quantum entanglement and the communication complexity of the inner product function. In Proceedings of the 1st NASA International Conference on Quantum Computing and Quantum Communications, Lecture Notes in Computer Science, vol. 1509, pages 61-74, 1998. Also quant-ph/9708019.
4. M. Fredman, J. Komĺos, and E. Szemeŕedi. Storing a sparse table with O(1) worst case access time. Journal of the Association for Computing Machinery, 31(3):538-544, 1984.
5. L. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 212-219, 1996. Also quant-ph/9605043.
6. P. Høyer and J. Neerbek. Bounds on quantum ordered searching. Manuscript at quant-ph/0009032, September 2000.
7. H. Klauck. On rounds in quantum communication. Manuscript at quant-ph/0004100, April 2000.
8. P. B. Miltersen. Cell probe complexity-A survey. Invited talk at the pre-conference workshop on Advances in data structures preceding the 19th conference on the Foundations of Software Technology and Theoretical Computer Science, December 11-12, 1999, Chennai, India. Also available from http://www. daimi. au. dk/̃bromille/Papers/survey3. ps.
9. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 57:37-49, 1998.
10. A. Nayak, A. Ta-Shma, and D. Zuckerman. Interaction in quantum communication complexity. Manuscript at quant-ph/0005106, May 2000.
11. I. Newman. Private vs common random bits in communication complexity. Information Processing Letters, 39:67-71, 1991.
12. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
13. J. Radhakrishnan, P. Sen, and S. Venkatesh. The quantum complexity of set membership. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 554-562, 2000. Also quant-ph/0007021.
14. P. Sen and S. Venkatesh. Lower bounds in the quantum cell probe model. Full version. Manuscript at quant-ph/0104100.
15. A. C-C. Yao. Probabilistic computations: towards a unified measure of complexity. In Proceedings of the 9th Annual ACM Symposium on Theory of Computing, pages 209-213, 1977.
16. A. C-C. Yao. Should tables be sorted Journal of the Association for Computing Machinery, 28(3):615-628, 1981.
17. A. C-C. Yao. Quantum circuit complexity. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 352-361, 1993.