Quantum communication and complexity.
From MaRDI portal
Publication:1853475
DOI10.1016/S0304-3975(02)00377-8zbMath1061.81016MaRDI QIDQ1853475
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Communication theory (94A05)
Related Items
Query Complexity in Expectation ⋮ Quantum weakly nondeterministic communication complexity ⋮ Equality, Revisited ⋮ State succinctness of two-way finite automata with quantum and classical states ⋮ The improvement of decision tree construction algorithm based on quantum heuristic algorithms ⋮ Quantum speed-up for unsupervised learning ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Exponential Lower Bounds for Polytopes in Combinatorial Optimization ⋮ Exponential separation of quantum and classical online space complexity ⋮ Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems ⋮ Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial ⋮ The complexity of quantum disjointness
Cites Work
- Private vs. common random bits in communication complexity
- On the distributional complexity of disjointness
- Fourier analysis for probabilistic communication complexity
- Communication complexity in a 3-computer model
- Quantum Entanglement and Communication Complexity
- Exponential separation of quantum and classical communication complexity
- Dense quantum coding and a lower bound for 1-way quantum automata
- Quantum computational networks
- On quantum and probabilistic communication
- On communication over an entanglement-assisted quantum channel
- Forbidden Intersections
- The Probabilistic Communication Complexity of Set Intersection
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum algorithms revisited
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- The Quantum Communication Complexity of Sampling
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Quantum communication complexity of symmetric predicates
- Quantum information theory
- Communication Complexity
- Interaction in quantum communication and the complexity of set disjointness
- A single quantum cannot be cloned
- Quantum lower bounds by polynomials
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Quantum communication and complexity.
