Gilles Brassard

Prof. Gilles Brassard

orcid

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 February 2023 in Social Network Analysis and Mining
Verified
Journal Article
Closed access
PDF file
EAEsma Aïmeur
Esma Aïmeur
SASabrine Amri
Sabrine Amri
GBGilles Brassard
Gilles Brassard

1 November 2005 in Foundations of Physics
Verified
Journal Article
Closed access
PDF file
GBGilles Brassard
Gilles Brassard
ABAnne Broadbent
Anne Broadbent
ATAlain Tapp
Alain Tapp

30 August 1999 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
GBGilles Brassard
Gilles Brassard
RCRichard Cleve
Richard Cleve
ATAlain Tapp
Alain Tapp
We investigate the amount of communication that must augment classical local hidden variable models in order to simulate the behavior of entangled quantum systems. We consider the scenario where a bipartite measurement is given from a set of possibilities and the goal is to obtain exactly the same correlations that arise when the actual quantum system is measured. We show that, in the case of a single pair of qubits in a Bell state, a constant number of bits of communication is always sufficient—regardless of the number of measurements under consideration. We also show that, in the case of a system of n Bell states, a constant times 2n bits of communication is necessary.

31 August 2012 in Machine Learning
Verified
Journal Article
Open access
PDF file
EAEsma Aïmeur
Esma Aïmeur
GBGilles Brassard
Gilles Brassard
SGSébastien Gambs
Sébastien Gambs
We show how the quantum paradigm can be used to speed up unsupervised learning algorithms. More precisely, we explain how it is possible to accelerate learning algorithms by quantizing some of their subroutines. Quantization refers to the process that partially or totally converts a classical algorithm to its quantum counterpart in order to improve performance. In particular, we give quantized versions of clustering via minimum spanning tree, divisive clustering and k-medians that are faster than their classical analogues. We also describe a distributed version of k-medians that allows the participants to save on the global communication cost of the protocol compared to the classical version. Finally, we design quantum algorithms for the construction of a neighbourhood graph, outlier detection as well as smart initialization of the cluster centres.

31 January 1997 in Science
Verified
Journal Article
Closed access
GBGilles Brassard
Gilles Brassard
Finding a phone number in a directory when one knows the name is easy; much harder is finding the name given the number. On average, a search algorithm will have to scan half the total number of entries. If the database or directory is extremely large, the search may be impossible with classical computers. New possibilities emerge, however, with quantum computing. As Brassard discusses in his Perspective, a new algorithm developed by L. K. Grover enables much faster searching of large databases if one uses a quantum computer.

27 February 2008 in International Journal of Information Security
Verified
Journal Article
Closed access
PDF file
EAEsma Aïmeur
Esma Aïmeur
GBGilles Brassard
Gilles Brassard
JFJosé M. Fernandez
José M. Fernandez
FOFlavien Serge Mani Onana
Flavien Serge Mani Onana