2.7k citations
- University of AmsterdamNL294 papers
- Eindhoven University of TechnologyNL163 papers
- QuSoftNL123 papers
- Leiden UniversityNL91 papers
- Delft University of TechnologyNL82 papers
- Vrije Universiteit AmsterdamNL61 papers
- Centre National de la Recherche ScientifiqueFR52 papers
- Radboud University NijmegenNL37 papers
- Utrecht UniversityNL37 papers
- University of WaterlooCA34 papers
- University of OxfordGB28 papers
- University College LondonGB26 papers
5 papers · 2 filters
The quantum capacity is properly defined without encodings
H. Barnum, J. A. Smolin, B. M. Terhal
We show that no source encoding is needed in the definition of the capacity of a quantum channel for carrying quantum information. This allows us to use the coherent information ma…
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…
Quantum Entanglement and Communication Complexity
Harry Buhrman, Richard Cleve, Wim van Dam
We consider a variation of the multi-party communication complexity scenario where the parties are supplied with an extra resource: particles in an entangled quantum state. We show…
Substituting Quantum Entanglement for Communication
Richard Cleve, Harry Buhrman
We show that quantum entanglement can be used as a substitute for communication when the goal is to compute a function whose input data is distributed among remote parties. Specifi…
Reversible Simulation of Irreversible Computation by Pebble Games
Ming Li, John Tromp, Paul Vitanyi
Reversible simulation of irreversible algorithms is analyzed in the stylized form of a `reversible' pebble game. While such simulations incur little overhead in additional computat…