Quantum communication and complexity.
type: Item
instance of: scholarly article
title: Quantum communication and complexity.
zbMATH Open document ID: 1061.81016
DOI: 10.1016/S0304-3975(02)00377-8
author: Ronald de Wolf
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 81P68
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94A05
zbMATH DE Number: 1857022
zbMATH Keywords: Quantum computing
zbMATH Keywords: Communication complexity
MaRDI profile type: Publication
cites work: Communication complexity in a 3-computer model
cites work: Dense quantum coding and a lower bound for 1-way quantum automata
cites work: The Quantum Communication Complexity of Sampling
cites work: Q4540518
cites work: Quantum lower bounds by polynomials
cites work: Strengths and Weaknesses of Quantum Computing
cites work: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
cites work: Quantum information theory
cites work: Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
cites work: Quantum Complexity Theory
cites work: Q4505702
cites work: Quantum entanglement and communication complexity
cites work: Q4542521
cites work: Quantum algorithms revisited
cites work: Q4939137
cites work: Quantum theory, the Church–Turing principle and the universal quantum computer
cites work: Quantum computational networks
cites work: Rapid solution of problems by quantum computation
cites work: Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
cites work: Forbidden Intersections
cites work: Q4736853
cites work: Q4228473
cites work: Q4079482
cites work: Q4736848
cites work: Q4337605
cites work: The Probabilistic Communication Complexity of Set Intersection
cites work: On quantum and probabilistic communication
cites work: Interaction in quantum communication and the complexity of set disjointness
cites work: Communication Complexity
cites work: On communication over an entanglement-assisted quantum channel
cites work: Private vs. common random bits in communication complexity
cites work: Q4228511
cites work: Q2706552
cites work: Fourier analysis for probabilistic communication complexity
cites work: Exponential separation of quantum and classical communication complexity
cites work: On the distributional complexity of disjointness
cites work: Quantum communication complexity of symmetric predicates
cites work: Q4535029
cites work: A single quantum cannot be cloned
description: scientific article; zbMATH DE number 1857022