Quantum Information and the PCP Theorem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On the power of non-local boxes
Theoretical Computer Science
Toward a general theory of quantum games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
Computational Complexity
Decision Support Systems
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
Monogamy of correlations versus monogamy of entanglement
Quantum Information Processing
Polynomial-space approximation of no-signaling provers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Unique Games with Entangled Provers Are Easy
SIAM Journal on Computing
Parallel repetition of entangled games
Proceedings of the forty-third annual ACM symposium on Theory of computing
Bell inequalities: what do we know about them and why should cryptographers care?
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
A lower bound on the value of entangled binary games
Quantum Information & Computation
Minimum entangled state dimension required for pseudo-telepathy
Quantum Information & Computation
On the role of shared entanglement
Quantum Information & Computation
Properties of local quantum operations with shared entanglement
Quantum Information & Computation
Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's
Quantum Information & Computation
Limitations on quantum dimensionality reduction
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
A Counterexample to Strong Parallel Repetition
SIAM Journal on Computing
Entangled Games Are Hard to Approximate
SIAM Journal on Computing
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Entanglement in interactive proof systems with binary answers
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Nonlocal quantum XOR games for large number of players
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Bell violations through independent bases games
Quantum Information & Computation
Quantum strategies are better than classical in almost any XOR game
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Product rules in semidefinite programming
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Continuous input nonlocal games
Natural Computing: an international journal
Multipartite entanglement in XOR games
Quantum Information & Computation
Strict hierarchy among Bell Theorems
Theoretical Computer Science
Classical, quantum and nonsignalling resources in bipartite games
Theoretical Computer Science
Efficient rounding for the noncommutative grothendieck inequality
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Guest column: the quantum PCP conjecture
ACM SIGACT News
| Hi-index | 0.00 |
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 ...