Sciweavers

7486 search results - page 48 / 1498
» The Limits of Quantum Computers
Sort
View
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
14 years 3 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman
IPPS
2003
IEEE
14 years 2 months ago
Global Communication Optimization for Tensor Contraction Expressions under Memory Constraints
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...
Daniel Cociorva, Xiaoyang Gao, Sandhya Krishnan, G...
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
14 years 9 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
Sean Hallgren
INTETAIN
2009
Springer
14 years 3 months ago
Entertainment Computing, Social Transformation and the Quantum Field
Abstract. Entertainment computing is on its way getting an established academic discipline. The scope of entertainment computing is quite broad (see the scope of the international ...
Matthias Rauterberg
FCS
2006
13 years 10 months ago
The Church-Turing-Deutsch Principle in Quantum Computation
This paper is based on the idea that the Church-Turing-Deutsch (CTD) principle can play a very fundamental role in Physics similar to those of conservation laws in the constructio...
P. Prashant