|
Algorithms
¤
Gilles
Brassard, Frédéric Dupuis, Sébastien Gambs and Alain Tapp,
Efficient Clustering by Quantum Algorithms that Approximate
the Mean and the Median,
submited to
ICML2009.
¤
Gilles
Brassard, Peter Høyer, Michele Mosca and Alain Tapp,
Quantum Amplitude Amplification and Estimation,
Book chapter, edited by Samuel J. Lomonaco and and Howard E.
Brandt,
Quantum Computation &
Quantum Information Science,
AMS Contemporary Mathematics Series Millennium Volume,
vol. 305, pp. 53-74, 2002.
(arXiv:quant-ph/0005055v1)
¤
Gilles
Brassard, Peter Høyer and Alain Tapp,
Quantum Counting,
25th International Colloquium on Automata, Languages and
Programming (ICALP'98),
Springer-Verlag, LNCS vol. 1443, pp.820-831, 1998.
(quant-ph/9805082)
¤
Michel Boyer,
Gilles Brassard, Peter Høyer and Alain Tapp,
Tight Bounds on Quantum Searching,
Fortschritte der Physik,
vol. 46(4-5), pp. 493-505, 1998.
(quant-ph/9605034)
¤
Michel Boyer,
Gilles Brassard, Peter Høyer and Alain Tapp,
Tight Bounds on Quantum Searching,
Book
chapter, edited by Samuel L. Braunstein,
Quantum Computing, Where
Do We Want to Go Tomorrow?,
Wiley-VCH,
1999.
¤
Michel Boyer,
Gilles Brassard, Peter Høyer and Alain Tapp,
Tight Bounds on Quantum Searching,
4th workshop on physics and computation (PHYSCOMP'96),
pp.36-43, 1996.
¤
Gilles
Brassard, Peter Høyer and Alain Tapp,
Quantum Algorithm for the Collision Problem,
3rd Latin American Theoretical Informatics Symposium
(LATIN'98),
Springer-Verlag, LNCS, vol. 1380, pp.163-169, 1998.
(quant-ph/9705002)
¤
Gilles
Brassard, Peter Høyer and Alain Tapp,
Cryptology Column ---Quantum Algorithm for the Collision
Problem,
ACM SIGACT News,
vol. 28 (2), pp. 14-19, June 1997.
¤
Alain Tapp,
Quantum Algorithm for the Collision Problem,
Book chapter, edited by Ming-Yang Kao,
The Encyclopedia of
Algorithms,
Springer, 2008.
Communication complexity
¤
Anne Broadbent and Alain Tapp,
Can quantum mechanics help distributed computing?,
ACM SIGACT News 39:67-76, 2008.
(arXiv:0810.5317v1)
¤
Richard Cleve,
Wim van Dam, Michael Nielsen and Alain Tapp,
Quantum Entanglement and the Communication Complexity of
the Inner Product Function,
Quantum computing and quantum communication: First NASA
International Conference (QCQC'98).
Springer-Verlag, LNCS, vol. 1509, pp.61-74,1998.
(quant-ph/9708019)
¤
Harry Buhrman,
Wim van Dam, Peter Høyer and Alain Tapp,
Multiparty Quantum Communication Complexity,
Physical Review A, vol. 60(4), pp.2737-2741,1999.
(arXiv:quant-ph/9710054v2)
Quantum cryptography
¤
Gilles
Brassard, Louis Salvail and Alain Tapp,
Merkle's puzzle and oblivious transfer,
electronic proceedings of ICQNM09, 2009.
¤
Anne Broadbent,
Paul Robert Chouha and Alain Tapp,
The GHZ state in secret sharing and entanglement
simulation,
electronic proceedings of ICQNM09, 2009.
¤
Gilles
Brassard, Anne Broadbent, Joseph Fitzsimons, Sébastien Gambs
and Alain Tapp,
Anonymous quantum communication,
proceedings of
ASIACRYPT’07,
pp. 460-473, 2007.
(arXiv:0706.2356)
¤
Gilles
Brassard, Anne Broadbent, Joseph Fitzsimons, Sébastien Gambs
and Alain Tapp,
Anonymous quantum communication,
proceedings of the International Conference on Information
Theoretic Security (ICITS’07),
invited article, short format, 2007.
¤
Howard Barnum,
Claude Crépeau, Daniel Gottesman and Alain Tapp,
Authentication of quantum messages,
43rd Annual IEEE Symposium on Foundations of Computer
Science (FOCS’02), 2002.
(arXiv:quant-ph/0205128)
¤
Andris
Ambainis, Michele Mosca, Alain Tapp and Ronald de Wolf,
Private Quantum Channels,
proceeding of the 41st Annual Symposium on Foundations of
Computer Science (FOCS`2000),
pp 547-553, 2000.
(quant-ph/0003101)
¤
Michele Mosca,
Alain Tapp and Ronald de Wolf,
Private Quantum Channels and the Cost of Randomizing
Quantum Information,
Technical report:
quant-ph/0003101,
2000.
Classical cryptography
¤
Anne Broadbent
and Alain Tapp,
Information-theoretically secure voting without an honest
majority,
proceedings of the IAVoSS Workshop On Trustworthy Elections
(WOTE 2008),
2008.
(Cryptology
ePrint Archive: Report 2008/266)
¤
Hugue Blier and
Alain Tapp,
A Single Initialization Server for Multi-Party Cryptography,
proceedings of ICITS’08.
¤
Anne Broadbent
and Alain Tapp,
Information-theoretic security without an honest majority,
proceedings of the 13th International Conference on the
Theory and Application of Cryptology and Information
Security (ASIACRYPT 2007),
pp. 410-426, 2007.
(arXiv:0706.2010)
¤
Alain Tapp,
Cryptography based on Oblivious Transfer,
proceedings of PRAGOCRYPT'96, pp.400-413, 1996.
¤
Claude Crépeau,
Jeroen van de Graaf and Alain Tapp,
Committed Oblivious Transfer and Private Multy-Party
Computation,
Advances in Cryptology -
CRYPTO'95,
Springer, LNCS, vol. 963, pp.110-123, 1995.
Foundations of computer science
¤
Hugue Blier and
Alain Tapp,
All
languages in NP have very short quantum proofs,
electronic proceedings of ICQNM09.
¤
Hugue Blier and
Alain Tapp,
All languages in NP have very short quantum proofs,
technical report
arXiv:0709.0738,
September 2007.
¤
Klaus-Jörn
Lange, Pierre McKenzie and Alain Tapp,
Reversible space equals deterministic space,
Journal of Computer and
System Sciences,
vol. 60(2), pp. 354-367, 2000.
¤
Klaus-Jörn
Lange, Pierre McKenzie and Alain Tapp,
Reversible space equals deterministic space,
12th Annual IEEE Conference on Computational Complexity
(CCC'97),
pp.45-50, 1997.
¤ David Janin and Alain
Tapp,
Expériences de démonstration interactive avec le logiciel
Coq,
Technical report #840, DIRO, Université de Montréal, 1992.
Foundations of physics
¤
Viktor
Galliard, Stefan Wolf and Alain Tapp,
Deterministic quantum non-locality and graph colorings,
to appear in TCS.
¤
Viktor
Galliard, Stefan Wolf et Alain Tapp,
The Impossibility of Pseudo-Telepathy Without Quantum
Entanglement,
Proceedings of the 2003 IEEE International Symposium on
Information Theory (ISIT’03), 2003.
(arXiv:quant-ph/0211011)
¤
Gilles
Brassard, Harry Buhrman, Noah Linden, André A. Méthot, Alain
Tapp and Falk Unger,
A limit on non-local correlations in any world where
communication complexity is not trivial,
Physical Review Letter,
vol. 96, 250401, 2006
¤
Gilles
Brassard, André A. Methot and Alain Tapp,
Minimum entangled state dimension required for
pseudo-telepathy,
Quantum
Information and Computation
(QIC),
vol 5(4,5), pp. 275-284, 2005.
¤
Gilles
Brassard, Aanne Broadbent and Alain Tapp,
Recasting Mermin's multi-player game into the framework of
pseudo-telepathy,
Quantum Information and
Computation (QIC),
Vol.5(7), November, 2005
¤
Survey, Gilles
Brassard, Anne Broadbent and Alain Tapp,
Quantum Pseudo-Telepathy,
Foundations of Physics,
Vol 35(11), 2005.
¤
Gilles
Brassard, Anne Broadbent and Alain Tapp,
Multi-Party Pseudo-Telepathy,
Proceedings of the 8th International Workshop on Algorithms
and Data Structures (WADS 2003),
volume 2748 of Lecture Notes in Computer Science, pages
1-11, 2003.
(arXiv:quant-ph/0306042)
¤
Gilles
Brassard, Richard Cleve and Alain Tapp,
The cost of exactly simulating quantum entanglement
with classical communication,
Physical Review Letter,
vol. 83(9), pp.1874-1878, 1999.
¤
Gilles
Brassard, Richard Cleve and Alain Tapp,
The cost of exactly simulating quantum entanglement
with classical communication,
Extended version, technical report #1160,
October 1999, DIRO, Université de Montréal.
(quant-ph/9901035)
Editor
Michele
Mosca and Alain Tapp,
guest editor of a special isue on quantum computation,
Algorithmica Volume 34, Number 4, 2002.
(Introduction pp. 309-313)
Thesis
¤
Alain Tapp,
Informatique
Quantique: Algorithmes et Complexité de la Communication,
Ph. D. thesis, Université de montréal, accepted in December
1999,
comity: Michel Boyer, Gilles Brassard, Pierre McKenzie,
Claude Crépeau and Miklos Santha.
¤ Alain Tapp,
Évaluation
de fonctions sur données privées,
Master thesis, Université de Montréal, August 1995.
|
|