508 search results - page 57 / 102 » Poly-locality in quantum computing |
STOC
2006
ACM
14 years 9 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
CDES
2006
13 years 10 months ago
2006
: Over the last three decades there has been significant progress in the first principles methods for calculating the properties of materials at the quantum level. They have largel...
ANTS
2004
Springer
14 years 2 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
TAMC
2007
Springer
14 years 2 months ago
2007
Springer
STOC
2004
ACM
14 years 9 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...