Quantum Entanglement and Communication Complexity
From MaRDI portal
Publication:2706137
DOI10.1137/S0097539797324886zbMath0980.68051arXivquant-ph/9705033OpenAlexW2045420759MaRDI QIDQ2706137
Harry Buhrman, Wim van Dam, Richard Cleve
Publication date: 19 March 2001
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/9705033
Related Items
Experimental multipartner quantum communication complexity employing just one qubit ⋮ Splitting information securely with entanglement ⋮ Quantum entanglement and the communication complexity of the inner product function ⋮ Towards characterizing the non-locality of entangled quantum states ⋮ Classical, quantum and nonsignalling resources in bipartite games ⋮ Information and the Reconstruction of Quantum Physics ⋮ Polynomial representation of quantum entanglement ⋮ Quantum communication complexity advantage implies violation of a Bell inequality ⋮ Communication complexity as a principle of quantum mechanics ⋮ A quantum characterization of NP ⋮ Quantum protocols for untrusted computations ⋮ SEPARABILITY OF PURE N-QUBIT STATES: TWO CHARACTERIZATIONS ⋮ On the power of non-local boxes ⋮ Non-contextuality, finite precision measurement and the Kochen-Specker theorem ⋮ Unbounded violation of tripartite Bell inequalities ⋮ Quantum entanglement ⋮ Efficient Prüfer-like coding and counting labelled hypertrees ⋮ BASIC OPERATIONS AMONG ENTANGLED STATES AND THEIR APPLICATIONS TO QUANTUM PROTOCOLS ⋮ Quantum communication and complexity.
