Quantum and classical communication complexity of permutation-invariant functions
From MaRDI portal
Cites work
- A new exponential separation between quantum and classical one-way communication complexity
- A note on the quantum query complexity of permutation symmetric functions
- A quantum advantage for a natural streaming problem
- An additive combinatorics approach relating rank to communication complexity
- An optimal lower bound on the communication complexity of gap-Hamming-distance
- An optimal lower bound on the communication complexity of gap-Hamming-distance
- Communication complexities of symmetric XOR functions
- Communication complexity of permutation-invariant functions
- Communication is bounded by root of rank
- Exponential separation between quantum communication and logarithm of approximate rank
- Exponential separation of quantum and classical communication complexity
- Exponential separation of quantum and classical one-way communication complexity
- Exponential separation of quantum communication and classical information
- Exponential separations between learning with and without quantum memory
- Exponential separations for one-way quantum communication complexity, with applications to cryptography
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- scientific article; zbMATH DE number 6789291 (Why is no real title available?)
- scientific article; zbMATH DE number 6292622 (Why is no real title available?)
- Interactive shallow Clifford circuits: Quantum advantage against NC¹ and beyond
- Log-rank and lifting for AND-functions
- Quantum advantage with noisy shallow circuits in 3D
- Quantum Chebyshev's Inequality and Applications
- Quantum communication complexity of symmetric predicates
- Quantum log-approximate-rank conjecture is also false
- Quantum lower bounds by polynomials
- Quantum lower bounds for the collision and the element distinctness problems
- Symmetries, graph properties, and quantum speedups
- The communication complexity of gap Hamming distance
- The communication complexity of the Hamming distance problem
- The Log-Approximate-Rank Conjecture Is False
- The need for structure in quantum speedups
- The pattern matrix method
- The structure of promises in quantum speedups
- Verifiable quantum advantage without structure
This page was built for publication: Quantum and classical communication complexity of permutation-invariant functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902683)
