508 search results - page 40 / 102 » Poly-locality in quantum computing |
COCO
2009
Springer
14 years 3 months ago
2009
Springer
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...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
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...
INTETAIN
2009
Springer
14 years 3 months ago
2009
Springer
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 ...
FCS
2006
13 years 10 months ago
2006
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...
MKM
2009
Springer
14 years 3 months ago
2009
Springer
Graphical languages provide a powerful tool for describing the behaviour of quantum systems. While the use of graphs vastly reduces the complexity of many calculations [4,10], manu...