Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR2k papers
- University of British ColumbiaCA1.9k papers
- McGill UniversityCA1.9k papers
- University of VictoriaCA1.8k papers
- University of California, Santa CruzUS1.7k papers
- Rutherford Appleton LaboratoryGB1.7k papers
- University of ManchesterGB1.7k papers
- Queen Mary University of LondonGB1.7k papers
- University of PisaIT1.6k papers
- University of EdinburghGB1.6k papers
- University of BirminghamGB1.6k papers
- Heidelberg UniversityDE1.6k papers
8 papers · 2 filters
A brief review on the impossibility of quantum bit commitment
Gilles Brassard, Claude Crépeau, Dominic Mayers +1
The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the first time thirteen years ago. Bit commitment is sufficient in…
Cryptographic Distinguishability Measures for Quantum Mechanical States
Christopher A. Fuchs, Jeroen van de Graaf
This paper, mostly expository in nature, surveys four measures of distinguishability for quantum-mechanical states. This is done from the point of view of the cryptographer with a…
Multiparty Quantum Communication Complexity
Harry Buhrman, Wim van Dam, Peter Hoyer +1
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…
Equivalence of the grand canonical partition functions of particles with different statistics
S. Chaturvedi, R. MacKenzie, P. K. Panigrahi +1
It is shown that the grand partition function of an ideal Bose system with single particle spectrum is identical to that of a system of particles with sing…
Quantum Entanglement and the Communication Complexity of the Inner Product Function
Richard Cleve, Wim van Dam, Michael Nielsen +1
We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of particles in an…
Quantum Algorithm for the Collision Problem
Gilles Brassard, Peter Hoyer, Alain Tapp
In this note, we give a quantum algorithm that finds collisions in arbitrary r-to-one functions after only O((N/r)^(1/3)) expected evaluations of the function. Assuming the functio…
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
Gilles Brassard, Peter Hoyer
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the…
Strengths and Weaknesses of Quantum Computing
Charles H. Bennett, Ethan Bernstein, Gilles Brassard +1
Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilist…