1352 search results - page 111 / 271 » Fault-Tolerant Quantum Computation |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
STOC
1993
ACM
14 years 3 hour ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
ICCSA
2009
Springer
14 years 2 months ago
2009
Springer
A mobile agent is regarded as an attractive technology when developing distributed applications in mobile and ubiquitous computing environments. In this paper, we present ODDUGI, a...