Alain Tapp
Alain Tapp
UdeM, MILA, DIRO, CRM, IVADO, RALI, LITQ, Université de Montréal
Verifierad e-postadress på - Startsida
Citeras av
Citeras av
Tight bounds on quantum searching
M Boyer, G Brassard, P Høyer, A Tappa
Quantum Computing, 187-199, 1998
Quantum amplitude amplification and estimation
G Brassard, P Hoyer, M Mosca, A Tapp
Contemporary Mathematics 305, 53-74, 2002
Quantum counting
G Brassard, P Høyer, A Tapp
International Colloquium on Automata, Languages, and Programming, 820-831, 1998
Limit on nonlocality in any world in which communication complexity is not trivial
G Brassard, H Buhrman, N Linden, AA Méthot, A Tapp, F Unger
Physical review letters 96 (25), 250401, 2006
Authentication of quantum messages
H Barnum, C Crépeau, D Gottesman, A Smith, A Tapp
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002
Cost of exactly simulating quantum entanglement with classical communication
G Brassard, R Cleve, A Tapp
Physical Review Letters 83 (9), 1874, 1999
Private quantum channels
A Ambainis, M Mosca, A Tapp, R De Wolf
Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on …, 2000
Quantum entanglement and the communication complexity of the inner product function
R Cleve, W Van Dam, M Nielsen, A Tapp
NASA International Conference on Quantum Computing and Quantum …, 1998
Committed oblivious transfer and private multi-party computation
C Crépeau, J van de Graaf, A Tapp
Advances in Cryptology—CRYPT0’95, 110-123, 1995
Quantum Pseudo-Telepathy
A Tapp, A Broadbent, G Brassard
Foundations of physics: an international journal devoted to the conceptual …, 2005
Quantum cryptanalysis of hash and claw-free functions
G Brassard, P Høyer, A Tapp
LATIN'98: Theoretical Informatics, 163-169, 1998
Multiparty quantum communication complexity
H Buhrman, W van Dam, P Høyer, A Tapp
Physical Review A 60 (4), 2737, 1999
Quantum algorithm for the collision problem
G Brassard, P Hoyer, A Tapp
arXiv preprint quant-ph/9705002, 1997
Reversible space equals deterministic space
KJ Lange, P McKenzie, A Tapp
Computational Complexity, 1997. Proceedings., Twelfth Annual IEEE Conference …, 1997
All languages in NP have very short quantum proofs
H Blier, A Tapp
2009 Third International Conference on Quantum, Nano and Micro Technologies …, 2009
Anonymous quantum communication
G Brassard, A Broadbent, J Fitzsimons, S Gambs, A Tapp
Proceedings of the Advances in Crypotology 13th international conference on …, 2007
Information-theoretic security without an honest majority
A Broadbent, A Tapp
International Conference on the Theory and Application of Cryptology and …, 2007
Minimum entangled state dimension required for pseudo-telepathy
G Brassard, AA Methot, A Tapp
arXiv preprint quant-ph/0412136, 2004
Two provers in isolation
C Crépeau, L Salvail, JR Simard, A Tapp
International Conference on the Theory and Application of Cryptology and …, 2011
Multi-party pseudo-telepathy
G Brassard, A Broadbent, A Tapp
Workshop on Algorithms and Data Structures, 1-11, 2003
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20