Quantum versus randomized communication complexity, with efficient players
type: Item
instance of: scholarly article
title: Quantum versus randomized communication complexity, with efficient players
author: Uma Girish
author: Ran Raz
author: Avishay Tal
published in: Computational Complexity
publication date: 2022-11-24T00:00:00Z
full work available at URL: https://arxiv.org/abs/1911.02218
Mathematics Subject Classification ID: 68Q11
Mathematics Subject Classification ID: 68Q12
zbMATH DE Number: 7622849
zbMATH Keywords: quantum
zbMATH Keywords: randomized
zbMATH Keywords: communication complexity
zbMATH Keywords: exponential separation
MaRDI profile type: Publication
OpenAlex ID: W3134293981
cites work: BQP and the polynomial hierarchy
cites work: Forrelation
cites work: Exponential separation of quantum and classical one-way communication complexity
cites work: Q4542521
cites work: Query-To-Communication Lifting for BPP Using Inner Product
cites work: Q5121889
cites work: Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates
cites work: Entangled simultaneity versus classical interactivity in communication complexity
cites work: Q3549651
cites work: Query-to-Communication Lifting for BPP
cites work: Structure of Protocols for XOR Functions
cites work: Analysis of Boolean Functions
cites work: Fourier analysis for probabilistic communication complexity
cites work: Exponential separation of quantum and classical communication complexity
cites work: Oracle separation of BQP and PH
cites work: Quantum one-way communication can be exponentially stronger than classical communication
DOI: 10.1007/S00037-022-00232-7
description: scientific article; zbMATH DE number 7622849