Sciweavers

508 search results - page 83 / 102
» Quantum Computers
Sort
View
IPPS
2002
IEEE
15 years 2 months ago
A Performance Optimization Framework for Compilation of Tensor Contraction Expressions into Parallel Programs
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...
Gerald Baumgartner, David E. Bernholdt, Daniel Coc...
TIT
2008
105views more  TIT 2008»
14 years 8 months ago
State Discrimination With Post-Measurement Information
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 ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 2 months ago
Lower bounds for predecessor searching in the cell probe model
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...
Pranab Sen
IMA
2001
Springer
78views Cryptology» more  IMA 2001»
15 years 2 months ago
Unconditionally Secure Key Agreement Protocol
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...
Cyril Prissette
CORR
2010
Springer
109views Education» more  CORR 2010»
14 years 9 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
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...
Rahul Jain, Hartmut Klauck, Miklos Santha