Limitations of Quantum Advice and One-Way Communication

Authors:
Scott Aaronson
Affiliations:
University of California at Berkeley
Venue:
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Year:
2004

Citing 0
Cited 10

Exponential separation of quantum and classical one-way communication complexity

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Guest Column: NP-complete problems and physical reality

ACM SIGACT News
A new quantum lower bound method,: with applications to direct product theorems and time-space tradeoffs

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Chernoff-type direct product theorems

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
On the role of shared entanglement

Quantum Information & Computation
Communication complexities of symmetric XOR functions

Quantum Information & Computation
Quantum and classical communication-space tradeoffs from rectangle bounds

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Quantum predictive learning and communication complexity with single input

Quantum Information & Computation
Complexity upper bounds for classical locally random reductions using a quantum computational argument

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the compression of polynomially samplablesources. In particular, we give efficientprefix-free compression and decompression algorithmsfor three classes of such sources (whosesupport is a subset of {0, 1}^n).1. We show how to compress sources ...