scientific article; zbMATH DE number 1406113

zbMath0979.94041arXivquant-ph/9708019MaRDI QIDQ4939137

Alain Tapp, Richard Cleve, Wim van Dam, Michael A. Nielsen

Publication date: 23 February 2000

Full work available at URL: https://arxiv.org/abs/quant-ph/9708019

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

communication complexityentangled quantum statequantum reductionbinary inner product function

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items

Implausible consequences of superstrong nonlocality ⋮ Experimental multipartner quantum communication complexity employing just one qubit ⋮ Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness ⋮ Bounds on oblivious multiparty quantum communication complexity ⋮ Quantum speed-up for unsupervised learning ⋮ The quantum query complexity of learning multilinear polynomials ⋮ Lower bounds for predecessor searching in the cell probe model ⋮ On the power of non-local boxes ⋮ Exponential lower bound for 2-query locally decodable codes via a quantum argument ⋮ Sensitivity, affine transforms and quantum communication complexity ⋮ Entropy lower bounds for quantum decision tree complexity ⋮ Quantum communication and complexity.