Sciweavers

249 search results - page 5 / 50
» One Complexity Theorist's View of Quantum Computing
Sort
View
EUROCRYPT
2005
Springer
15 years 2 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...
FOCS
2009
IEEE
15 years 4 months ago
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
Daniel Gottesman, Sandy Irani
CHI
1993
ACM
15 years 1 months ago
One is not enough: multiple views in a media space
Media spaces support collaboration, but the limited access they provide to remote colleagues' activities can undermine their utility. To address this limitation, we built an ...
William W. Gaver, Abigail Sellen, Christian Heath,...
JCC
2007
162views more  JCC 2007»
14 years 9 months ago
Bond electron pair: Its relevance and analysis from the quantum chemistry point of view
: This paper first comments on the surprisingly poor status that Quantum Chemistry has offered to the fantastic intuition of Lewis concerning the distribution of the electrons in ...
Jean-Paul Malrieu, Nathalie Guihéry, Carmen...
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
15 years 2 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen