Sciweavers

1677 search results - page 9 / 336
» On the Completeness of Quantum Computation Models
Sort
View
FOCS
2005
IEEE
15 years 3 months ago
Cryptography In the Bounded Quantum-Storage Model
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary’s quantum memory is of bounded size. We show that oblivious ...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
HASE
2007
IEEE
15 years 3 months ago
Advances in Quantum Computing Fault Tolerance and Testing
We study recent developments in quantum computing (QC) testing and fault tolerance (FT) techniques and discuss several attempts to formalize quantum logic fault models. We illustr...
David Y. Feinstein, V. S. S. Nair, Mitchell A. Tho...
90
Voted
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 2 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
ICCS
2004
Springer
15 years 2 months ago
Applying Grid Computing to the Parameter Sweep of a Group Difference Pseudopotential
Theoretical modeling of chemical and biological processes is a key to understand nature and to predict experiments. Unfortunately, this is very data and computation extensive. Howe...
Wibke Sudholt, Kim Baldridge, David Abramson, Coli...
151
Voted
POPL
2005
ACM
15 years 9 months ago
Communicating quantum processes
We define a language CQP (Communicating Quantum Processes) for modelling systems which combine quantum and classical communication and computation. CQP combines the communication ...
Simon J. Gay, Rajagopal Nagarajan