Alain Tapp

Alain Tapp

Auto-generated profile, based on publicly available information

Alain Tapp

Université de Montréal

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

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

Representative Publications

View All Publications
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.

1 October 1999 in Physical Review A
Verified
Journal Article
Closed access
PDF file
HBHarry Buhrman
Harry Buhrman
WDWim van Dam
Wim van Dam
PHPeter Høyer
Peter Høyer
ATAlain Tapp
Alain Tapp
Quantum entanglement cannot be used to achieve direct communication between remote parties, but it can reduce the communication needed for some problems. Let each of k parties hold some partial input data to some fixed k-variable function f. The communication complexity of f is the minimum number of classical bits required to be broadcasted for every party to know the value of f on their inputs. We construct a function G such that for the one-round communication model and three parties, G can be computed with n+1 bits of communication when the parties share prior entanglement. We then show that without entangled particles, the one-round communication complexity of G is (3/2)n+1. Next we generalize this function to a function F. We show that if the parties share prior quantum entanglement, then the communication complexity of F is exactly k. We also show that, if no entangled particles are provided, then the communication complexity of F is roughly klog2k. These two results prove communication complexity separations better than a constant number of bits.

1 April 2000 in Journal of Computer and System Sciences
Verified
Journal Article
Closed access
KLKlaus-Jörn Lange
Klaus-Jörn Lange
PMPierre McKenzie
Pierre McKenzie
ATAlain Tapp
Alain Tapp

1 June 1998 in Fortschritte der Physik
Verified
Journal Article
Closed access
Michel BoyerMichel Boyer
Michel Boyer
GBGilles Brassard
Gilles Brassard
PHPeter Høyer
Peter Høyer
ATAlain Tapp
Alain Tapp

12 October 1999
Verified
Book Chapter
Closed access
PDF file
Michel BoyerMichel Boyer
Michel Boyer
GBGilles Brassard
Gilles Brassard
PHPeter Høyer
Peter Høyer
ATAlain Tappa
Alain Tappa