Key publications of Quantum Computing
Research group Quantum Computing (INS4.1)
- I. Kerenidis, R. de Wolf, Exponential Lower Bound for 2-Query Locally Decodable Codes, submitted to STOC2003, Quantum Physics preprint server.
- H. Buhrman, S. Massar, H. Röhrig, Combinatorics and Quantum Nonlocality, Quantum Physics preprint server.
- H. Buhrman, L. Fortnow, I. Newman, H. Röhrig, Quantum Property Testing, Proceedings of 14th SODA, 2003, Quantum Physics preprint server.
- H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf, Quantum fingerprinting, in Physical Review Letters, 87(16), 2001.
- P. Vitanyi, Quantum Kolmogorov complexity based on classical descriptions, in IEEE Trans. Inform. Th., 47:6(2001), 2464--2479.
- H. Klauck, Lower Bounds for Quantum Communication Complexity, Proc. of 42st IEEE FOCS, 2001.
- H. Klauck, A. Nayak, A. Ta-Shma, D. Zuckerman, Interaction in Quantum Communication and the Complexity of Set Disjointness , Proc. STOC 2001, 2001.
- A. Ambainis, M. Mosca, A. Tapp, and R. de Wolf, Private quantum channels, Proc. of 41st IEEE FOCS, 2000.
- W. van Dam, F. Magniez, M. Mosca, and M. Santha, Self-testing of universal and fault-tolerant sets of quantum gates, Proc. of 32nd ACM STOC, 688-696, 2000.
- R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, Quantum lower bounds by polynomials, Proc. of 39th IEEE FOCS, 352-361, 1998.
- H. Buhrman, R. Cleve, and A. Wigderson, Quantum vs. classical communication and computation, Proc. of 30th ACM STOC, 63-68, 1998.
- H. Buhrman, R. Cleve, Substituting quantum entanglement for communication, Physical Review A, Volume 56, Number 2, pages 1201-1204, 1997.
