Sciweavers

587 search results - page 86 / 118
» Quantum computation and quantum information
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
13 years 10 months ago
A Monotonicity Principle for Information Theory
We establish a monotonicity principle for convex functions that enables high-level reasoning about capacity in information theory. Despite its simplicity, this single idea is rema...
Konstantinos Chatzikokolakis, Keye Martin
FOCS
2006
IEEE
14 years 4 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
DAC
2004
ACM
14 years 11 months ago
Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions
This paper presents the Quantum-Dot Cellular Automata (QCA) physical design problem, in the context of the VLSI physical design problem. The problem is divided into three subprobl...
Dominic A. Antonelli, Danny Z. Chen, Timothy J. Dy...
ICALP
2007
Springer
14 years 4 months ago
Unbounded-Error One-Way Classical and Quantum Communication Complexity
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...
JCC
2002
73views more  JCC 2002»
13 years 9 months ago
Linear scaling approaches to quantum macromolecular similarity: Evaluating the similarity function
: The evaluation of the electron density based similarity function scales quadratically with respect to the size of the molecules for simplified, atomic shell densities. Due to the...
Pere Constans