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
4 papers · 2 filters
A common algebraic description for probabilistic and quantum computations
Martin Beaudry, Jose M. Fernandez, Markus Holzer
We study the computational complexity of the problem SFT (Sum-free Formula partial Trace): given a tensor formula F over a subsemiring of the complex field (C,+,.) plus a positive…
The Impossibility of Pseudo-Telepathy Without Quantum Entanglement
Viktor Galliard, Stefan Wolf, Alain Tapp
Imagine that Alice and Bob, unable to communicate, are both given a 16-bit string such that the strings are either equal, or they differ in exactly 8 positions. Both parties are th…
Authentication of Quantum Messages
Howard Barnum, Claude Crepeau, Daniel Gottesman +2
Authentication is a well-studied area of classical cryptography: a sender S and a receiver R sharing a classical private key want to exchange a classical message with the guarantee…
Circuit for Shor's algorithm using 2n+3 qubits
Stephane Beauregard
We try to minimize the number of qubits needed to factor an integer of n bits using Shor's algorithm on a quantum computer. We introduce a circuit which uses 2n+3 qubits and O(n^3…