activity
19962004
most citedQuantum Arithmetic on Galois Fields

19 citations · 23 across the 3 of their papers we have counts for

collaborators

9 papers

quant-ph2004

Minimum entangled state dimension required for pseudo-telepathy

Gilles Brassard, Andre A. Methot, Alain Tapp

Pseudo-telepathy provides an intuitive way of looking at Bell's inequalities, in which it is often obvious that feats achievable by use of quantum entanglement would be classically…

quant-ph20044 cited

Recasting Mermin's multi-player game into the framework of pseudo-telepathy

Gilles Brassard, Anne Broadbent, Alain Tapp

Entanglement is perhaps the most non-classical manifestation of quantum mechanics. Among its many interesting applications to information processing, it can be harnessed to reduce…

quant-ph200319 cited

Quantum Arithmetic on Galois Fields

Stephane Beauregard, Gilles Brassard, Jose M. Fernandez

In this paper we discuss the problem of performing elementary finite field arithmetic on a quantum computer. Of particular interest, is the controlled-multiplication operation, whi…

quant-ph1998

Defeating classical bit commitments with a quantum computer

Gilles Brassard, Claude Crépeau, Dominic Mayers +1

It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a se…

quant-ph1998

Efficient Quantum Key Distribution

M. Ardehali, H. F. Chau, Hoi-Kwong Lo

We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns…

quant-ph1998

Security of Quantum Key Distribution Against All Collective Attacks

Eli Biham, Michel Boyer, Gilles Brassard +2

Security of quantum key distribution against sophisticated attacks is among the most important issues in quantum information theory. In this work we prove security against a very i…