Sciweavers

7486 search results - page 61 / 1498
» The Limits of Quantum Computers
Sort
View
QCQC
1998
Springer
115views Communications» more  QCQC 1998»
14 years 1 months ago
Quantum Entanglement and the Communication Complexity of the Inner Product Function
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
Richard Cleve, Wim van Dam, Michael Nielsen, Alain...
JCC
2007
90views more  JCC 2007»
13 years 8 months ago
Aromaticity in linear polyacenes: Generalized population analysis and molecular quantum similarity approach
Abstract: The relative aromaticity of benzenoid rings in the linear polyacenes is investigated using two novel aromaticity approaches. According to the first, the aromaticity of i...
Patrick Bultinck, Robert Ponec, Ramon Carbó...
FCT
2007
Springer
14 years 21 days ago
Product Rules in Semidefinite Programming
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
Rajat Mittal, Mario Szegedy
ISMVL
2005
IEEE
108views Hardware» more  ISMVL 2005»
14 years 2 months ago
Approaching the Physical Limits of Computing
As logic device sizes shrink towards the nanometer scale, a number of important physical limits threaten to soon halt further improvements in computer performance per unit cost. H...
Michael P. Frank
AMC
2006
96views more  AMC 2006»
13 years 8 months ago
Analog computation beyond the Turing limit
The main purpose of this paper is quite uncontroversial. First, we recall some models of analog computations (including these allowed to perform Turing uncomputable tasks). Second...
Jerzy Mycka