Harry Buhrman
Avi Wigderson
- BBCMW98.R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolff "Quantum Lower Bounds by Polynomials", prepfint available from the LANL quant-ph archive 9802049, 1998.]] Google Scholar
Digital Library
- BBBV97.C.H. Bennett, E. Bernstein, G. Brassard and U.V. Vazirani, "Strengths and wealmesses of quantum computing" SlAM J. on Computing, Vol. 26, No. 5, pp. 1510--1523, 1997.]] Google ScholarDigital Library
- BV93.E. Bemstein and U.V. Vazirani, "Quantum complexity theory", Pro& of the 25th STOC, pp. 11-20, 1993.]] Google ScholarDigital Library
- BB94.A. Berthiaume and G. Brassard, "Oracle quantum computing'', Journal of blodern Optics, 41, 12, pp. 2521-2535, 1994.]]Google Scholar
- BBHT96.M. Boyer, M., G. Brassard, P. H0yer, and A. Tapp, "Tight bounds on quantum searching", Prec. 4th I$br'kshop on Physics atut Computation, pp. 36.-43, 1996.]]Google Scholar
- Bu97.H. Buhrman, untitled manuscript, 1997.]]Google Scholar
- BCD97.H. Buhnnan, R. Cleve. and W. van Dam, "Quantum entanglement and communication complexity", preprint available from the LANL quant-ph archive 9705033, 1997.]]Google Scholar
- CG88.B. Chef and O. Goldreich, "Unbiased bits from sources of weak randomness and probabilistie communication complexit3"', SIAM J. Comput. 17(2), pp. 230--261, 1988.]] Google ScholarDigital Library
- CB97.R. Cleve and H. Buhrman, "Substituting quantum entanglement for communication", Physical Review A, Vol. 56, No. 2, pp. 1201-1204, 1997. Preprint available from the LANL quant-ph archive 9704026.]]Google ScholarCross Ref
- CDNT97.R. Cleve, W. van Dam, M. Nielsen, and A. Tapp, "Quantum entanglement and the communication complexity of the inner product function", preprint available from the LANL quant-ph archive 9708019, 1997.]] Google ScholarDigital Library
- DHT97.W. ,.,an Dam, P. H0yer, and A. Tapp, "Multiparty quantum communication complexity", preprint available from the LANL quant-ph archi,.,e 9710054, 1997.]]Google Scholar
- DJ92.D. Deutsch and R. Jozsa, Prec. R. See. Lend. A 439, pp. 553-558, 1992.]]Google ScholarCross Ref
- FGGS98.E. Fahri, J. Goldstone, S. Gutmann, M. $ipser, "A Limit on the Speed of Quantum Computation in Determining Parity", prepfint available from the LANk, quant-ph archive 9802045, 1998.]]Google Scholar
- FR87.P. Frankl and V. ROdl, "Forbidden intersections", TrailS. Amer. Math. $oc. 300, 1, pp. 259-286, 1987.]]Google Scholar
- FC94.C. Fuchs and C. Caves, "Ensemble.dependent bounds for accessible information in quantum mechanics", Physical Rc~: Lett., Vol. 73, pp. 3047-3050, 1994.]]Google ScholarCross Ref
- Gr96.L.K. Grover, "A fast quantum mechanical algorithm for database search", Prec. of the 28th STOC, pp. 212-219, 1996.]] Google ScholarDigital Library
- Hol73.A.S. Holevo, "Some estimates of the information transmitted by quantum communication channels", Problemy Peredachi Informatsii, Vol. 9, 1973, pp. 3-1 i. English translation in Problems of Information Transmission (U$SR), Vol. 9, pp. 177-183, 1973.]]Google Scholar
- KS87.B. Kalyanasundaram and O. Schnitger, "The probabilistie communication complexity of set intersection", 2nd $tructttre in Complexio, Theory Conference, pages 41--49, 1987.]]Google Scholar
- Ki95.A. Kitaev, "Quantum measurements and the abelian stabilizer problem", Preprint available from the LANL quant-ph archive 9511026.]]Google Scholar
- Kr95.I. Kremer, Quantum Commttnication, MSc Thesis, Computer Science Department, The Hebrew University, 1995.]]Google Scholar
- KN97.E. Kushilevitz and N. Nisan, Communicatiott Compla~it)', Cambridge University Press, 1997.]]Google Scholar
- Ne91.I. Newman, "Private vs. common random bits in com. munication complexity", Information Processing letters, 39, pp. 67-71,1991.]] Google ScholarDigital Library
- Raz95.R. Raz, "Fourier analysis for probabilistic communication complexity", Comput. Complexity, Vol. 5, pp. 205-221, 1995.]]Google ScholarCross Ref
- Raz90.A. Razborov, "On the distributional complexity of disjointness", Proceedings of the ICALP, pp. 249-253, 1990. To appear in Theoretical Computer Science.]] Google ScholarDigital Library
- Sh97.P.W. Shot, "Polynomial-time algorithms for primo faetodzation and discrete logarithms on a quantum computer", SIAM J. on Computing, Vol. 26, No. 5, pp. 1484-1509, 1997. Preliminary version appeared as "Algorithms for quantum computation: discrete logarithms and factoring" in Prec. of tlte 35th FOCS, pp. 124-134, 1994.]] Google ScholarDigital Library
- Si97.D. Simon, "On the power of quantum computation", SIAM J. on Computing, Vol. 26, No. 5, pp. 1474-1483, 1997, Preliminary version appeared in Prec. of the 35th FOC$, pp. 116-123, 1994.]] Google ScholarDigital Library
- VV86.L.G. Valiant and V.V. Vazirani, "NP is as easy as detecting unique solutions", Theoret. Comput. $ci., Vol. 47, pp. 85-93, 1986.]] Google ScholarDigital Library
- Va87.U.V. Vazirani, "Strong communication complexity or generating quasi-random sequences from two communicating slightly-random sources", Combinatorica, Vol. 7, No. 4, pp. 375--392, 1987.]] Google ScholarDigital Library
- Ya79.A. C.-C. Yao, "Some complexity questions related to distributive computing, Proceedings of 1! $roc, pp. 209. 213, 1979.]] Google ScholarDigital Library
- Ya93.A. C.-C. Yao, "Quantum circuit complexity", Prec. of the 34th FOCS, pp. 352-361, 1993.]]Google Scholar
Index Terms
- Quantum vs. classical communication and computation
Recommendations
Classical communication and non-classical fidelity of quantum teleportation
In quantum teleportation, the role of entanglement has been much discussed. It is known that entanglement is necessary for achieving non-classical teleportation fidelity. Here we focus on the amount of classical communication that is necessary to obtain ...
Can quantum discord increase in a quantum communication task?
Quantum teleportation of an unknown quantum state is one of the few communication tasks which has no classical counterpart. Usually the aim of teleportation is to send an unknown quantum state to a receiver. But is it possible in some way that the ...
Secure quantum communication using classical correlated channel
We propose a secure protocol to send quantum information from one part to another without a quantum channel. In our protocol, which resembles quantum teleportation, a sender (Alice) and a receiver (Bob) share classical correlated states instead of EPR ...
Comments