, Dense quantum coding and a lower bound for 1-way quantum automata, Proceedings of the thirty-first annual ACM symposium on Theory of computing , STOC '99, pp.376-383, 1999.
DOI : 10.1145/301250.301347
, Dense quantum coding and quantum finite automata, Journal of the ACM, vol.49, issue.4, pp.496-511, 2002.
DOI : 10.1145/581771.581773
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.7649
, A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs, FOCS, pp.477-486, 2008.
, Quantum Cryptography, or Unforgeable Subway Tokens, Advances in Cryptology CRYPTO 1982, pp.267-275, 1983.
DOI : 10.1007/978-1-4757-0602-4_26
, Quantum Fingerprinting, Physical Review Letters, vol.87, issue.16, p.167902, 2001.
DOI : 10.1103/PhysRevLett.87.167902
, Near-Optimal and Explicit Bell Inequality Violations, 2011 IEEE 26th Annual Conference on Computational Complexity, pp.623-645, 2012.
DOI : 10.1109/CCC.2011.30
URL : https://hal.archives-ouvertes.fr/hal-01110446
, Proposed Experiment to Test Local Hidden-Variable Theories, Physical Review Letters, vol.23, issue.15, pp.880-884, 1969.
DOI : 10.1103/PhysRevLett.23.880
, Strong connections between quantum encodings, non-locality and quantum cryptography, Physical Review A, vol.89, p.22334, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01093921
, Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems, computational complexity, vol.17, issue.2, pp.282-299, 2008.
DOI : 10.1007/s00037-008-0250-4
, Near-optimal extractors against quantum storage, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.161-170, 2010.
DOI : 10.1145/1806689.1806713
, Protecting data privacy in private information retrieval schemes, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.151-160, 1998.
DOI : 10.1145/276698.276723
, Exponential separation for one-way quantum communication complexity, with applications to cryptography, SIAM J. Comput, vol.38, issue.5, pp.1695-1708, 2008.
, (4,1)-Quantum random access coding does not exist???one qubit is not enough to recover one of four bits, New Journal of Physics, vol.8, issue.8, p.129, 2006.
DOI : 10.1088/1367-2630/8/8/129
, Some estimates of the information transmitted by quantum communication channels, Problemy Peredachi Informatsii, vol.9, pp.3-11, 1973.
, Unbounded-Error One-Way Classical and Quantum Communication Complexity, ICALP, pp.110-121, 2007.
DOI : 10.1007/978-3-540-73420-8_12
URL : http://arxiv.org/abs/0706.3265
, Quantum symmetrically-private information retrieval, Information Processing Letters, vol.90, issue.3, pp.109-114, 2004.
, quantum random access codes, Physical Review A, vol.85, issue.5, p.52308, 2012.
DOI : 10.1103/PhysRevA.85.052308
, Optimal lower bounds for quantum automata and random access codes, Proceedings of 40th IEEE Symposium on Foundations of Computer Science, pp.369-376, 1999.
, The uncertainty principle determines the non-locality of quantum mechanics, Science, vol.3306007, pp.1072-1074, 2010.
, From qubits to hyperbits, PZ10] M. Paw?owski and M. ? Zukowski. Entanglement-assisted random access codes, p.022331042326, 2010.
, Exponential separation of quantum and classical communication complexity, Proceedings of the thirty-first annual ACM symposium on Theory of computing , STOC '99, pp.358-367, 1999.
DOI : 10.1145/301250.301343
, Quantum one-way communication can be exponentially stronger than classical communication, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pp.31-40, 2011.
DOI : 10.1145/1993636.1993642
, Preparation contextuality powers parity-oblivious multiplexing Quantum analogues of the Bell inequalities: The case of two spatially separated domains, Physical Review Letters Journal of Soviet Mathematics, vol.102, issue.36, pp.10401557-570, 1987.
, Does ignorance of the whole imply ignorance of the parts? Physical Review Letters, p.30402, 2011.
, Unpublished note, 2008.