Exponential separation of quantum communication and classical information
type: Item
instance of: scholarly article
title: Exponential separation of quantum communication and classical information
zbMATH Open document ID: 1369.68204
DOI: 10.1145/3055399.3055401
author: Anurag Anshu
author: Dave Touchette
author: Penghui Yao
author: Nengkun Yu
publication date: 2017-08-17T00:00:00Z
full work available at URL: https://arxiv.org/abs/1611.08946
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 6761815
zbMATH Keywords: direct sum
zbMATH Keywords: exponential separation
zbMATH Keywords: information complexity
zbMATH Keywords: quantum communication complexity
MaRDI profile type: Publication
OpenAlex ID: W2558829393
arXiv ID: 1611.08946
Wikidata QID: Q130920862
Recommended article: Exponential separation of quantum and classical communication complexity
Recommended article: Exponential separation of quantum and classical one-way communication complexity
Recommended article: Exponential Separation of Quantum and Classical One-Way Communication Complexity
Recommended article: Q3104210
Recommended article: Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
Recommended article: Q3549651
Recommended article: Entanglement-Assisted Communication of Classical and Quantum Information
Recommended article: CLASSICAL COMMUNICATION COSTS IN QUANTUM INFORMATION PROCESSING
Recommended article: QUANTUM INFORMATION SPLITTING OF TWO-QUBIT STATE WITH MINIMAL CLASSICAL COMMUNICATION AND MEASUREMENT COMPLEXITY
Recommended article: Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity
published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
description: scientific article; zbMATH DE number 6761815