508 search results - page 83 / 102 » Quantum Computing |
134
Voted
IPPS
2002
IEEE
15 years 7 months ago
2002
IEEE
This paper discusses a program synthesis system to facilitate the generation of high-performance parallel programs for a class of computations encountered in quantum chemistry and...
136
Voted
TIT
2008
15 years 22 days ago
2008
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
115
click to vote
COCO
2003
Springer
15 years 7 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
79
Voted
IMA
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
107
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...