Exponential separation of quantum and classical communication complexity
From MaRDI portal
Recommendations
- Exponential Separation of Quantum and Classical One-Way Communication Complexity
- Exponential separation of quantum and classical one-way communication complexity
- Exponential separation of quantum communication and classical information
- A new exponential separation between quantum and classical one-way communication complexity
- scientific article; zbMATH DE number 1775389
Cited in
(60)- Classical versus quantum communication in XOR games
- Euclidean distance matrices and separations in communication complexity theory
- Quantum communication based on an algorithm of determining a matrix
- Quantum branching programs and space-bounded nonuniform quantum complexity
- Quantum communication and complexity.
- Almost-everywhere superiority for quantum polynomial time
- PSPACE has constant-round quantum interactive proof systems
- Quantum entanglement as a new information processing resource
- Quantum versus randomized communication complexity, with efficient players
- Quantum one-way versus classical two-way communication in XOR games
- Parity decision tree in classical-quantum separations for certain classes of Boolean functions
- Experimental multipartner quantum communication complexity employing just one qubit
- Bounded-error quantum state identification and exponential separations in communication complexity
- New bounds on the classical and quantum communication complexity of some graph properties
- Quantum communication complexity advantage implies violation of a Bell inequality
- Generalizations of the distributed Deutsch-Jozsa promise problem
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
- A new exponential separation between quantum and classical one-way communication complexity
- scientific article; zbMATH DE number 5953454 (Why is no real title available?)
- On quantum and probabilistic communication: Las Vegas and one-way protocols
- Exponential separations for one-way quantum communication complexity, with applications to cryptography
- Exponential separation of quantum and classical one-way communication complexity
- Exponential Separation of Quantum and Classical One-Way Communication Complexity
- Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
- Quantum weakly nondeterministic communication complexity
- Towards characterizing the non-locality of entangled quantum states
- scientific article; zbMATH DE number 1954386 (Why is no real title available?)
- The Quantum Communication Complexity of Sampling
- scientific article; zbMATH DE number 1775389 (Why is no real title available?)
- Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
- Forrelation: a problem that optimally separates quantum from classical computing
- Exponential separation of quantum communication and classical information
- A compressed classical description of quantum states
- On solving linear systems in sublinear time
- scientific article; zbMATH DE number 7559121 (Why is no real title available?)
- scientific article; zbMATH DE number 7204275 (Why is no real title available?)
- The complexity of quantum disjointness
- Query-to-communication lifting for BPP
- Noise and the Mermin-GHZ game
- Bounded-error quantum state identification and exponential separations in communication complexity
- Noisy interactive quantum communication
- Round elimination in exact communication complexity
- Entangled simultaneity versus classical interactivity in communication complexity
- Unbounded-Error Classical and Quantum Communication Complexity
- Simultaneous communication protocols with quantum and classical messages
- Quantum one-way communication can be exponentially stronger than classical communication
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Quantum Weakly Nondeterministic Communication Complexity
- Optimal bounds for parity-oblivious random access codes
- scientific article; zbMATH DE number 7651028 (Why is no real title available?)
- An Optimal Separation of Randomized and Quantum Query Complexity
- Exponential Separation of Information and Communication for Boolean Functions
- Quantum and classical communication complexity of permutation-invariant functions
- Classical vs quantum advice and proofs under classically-accessible oracle
- Quantum communication complexity of linear regression
- Quantum versus randomized communication complexity, with efficient players
- Exponential separation of quantum and classical online space complexity
- Consumable data via quantum communication
- Density Frankl-Rödl on the sphere
- Small ball probability and Dvoretzky's Theorem
This page was built for publication: Exponential separation of quantum and classical communication complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819566)
