NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (26)

quant-ph1998

Quantum Counting

Gilles Brassard, Peter Hoyer, Alain Tapp

quant-ph1997

Quantum Algorithm for the Collision Problem

Gilles Brassard, Peter Hoyer, Alain Tapp

quant-ph2010

A quantum characterization of NP

Hugue Blier, Alain Tapp

quant-ph2011

An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance

Gilles Brassard, Frederic Dupuis, Sebastien Gambs +1

quant-ph2003

Multi-Party Pseudo-Telepathy

Gilles Brassard, Anne Broadbent, Alain Tapp

stat.ML2014

A new approach in machine learning

Alain Tapp

quant-ph2009

Can quantum mechanics help distributed computing?

Anne Broadbent, Alain Tapp

quant-ph1998

Quantum Entanglement and the Communication Complexity of the Inner Product Function

Richard Cleve, Wim van Dam, Michael Nielsen +1

cs.LG2019

Fairwashing: the risk of rationalization

Ulrich Aïvodji, Hiromi Arai, Olivier Fortineau +3

quant-ph2007

Anonymous quantum communication

Gilles Brassard, Anne Broadbent, Joseph Fitzsimons +2

cs.CR2010

Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters

Anne Broadbent, Stacey Jeffery, Alain Tapp

quant-ph2004

Quantum Pseudo-Telepathy

Gilles Brassard, Anne Broadbent, Alain Tapp

quant-ph2004

Minimum entangled state dimension required for pseudo-telepathy

Gilles Brassard, Andre A. Methot, Alain Tapp

quant-ph2005

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

Gilles Brassard, Anne Broadbent, Alain Tapp

quant-ph1999

Multiparty Quantum Communication Complexity

Harry Buhrman, Wim van Dam, Peter Hoyer +1

quant-ph2002

The Impossibility of Pseudo-Telepathy Without Quantum Entanglement

Viktor Galliard, Stefan Wolf, Alain Tapp

quant-ph2000

Private Quantum Channels and the Cost of Randomizing Quantum Information

Michele Mosca, Alain Tapp, Ronald de Wolf

cs.CR2007

Information-theoretic security without an honest majority

Anne Broadbent, Alain Tapp

quant-ph2005

A limit on nonlocality in any world in which communication complexity is not trivial

Gilles Brassard, Harry Buhrman, Noah Linden +3

quant-ph1999

The cost of exactly simulating quantum entanglement with classical communication

Gilles Brassard, Richard Cleve, Alain Tapp

quant-ph1996

Tight bounds on quantum searching

Michel Boyer, Gilles Brassard, Peter Hoeyer +1

quant-ph2019

Noisy Interactive Quantum Communication

Gilles Brassard, Ashwin Nayak, Alain Tapp +2

cs.CL2019

Towards Lossless Encoding of Sentences

Gabriele Prato, Mathieu Duchesneau, Sarath Chandar +1

quant-ph2008

The GHZ state in secret sharing and entanglement simulation

Anne Broadbent, Paul Robert Chouha, Alain Tapp

cs.CR2008

Information-Theoretically Secure Voting Without an Honest Majority

Anne Broadbent, Alain Tapp

quant-ph2002

Authentication of Quantum Messages

Howard Barnum, Claude Crepeau, Daniel Gottesman +2