587 search results - page 85 / 118 » Quantum computation and quantum information |
STACS
2010
Springer
14 years 4 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
ALGORITHMICA
2002
13 years 9 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
DATE
2004
IEEE
14 years 1 months ago
2004
IEEE
There has been considerable research on quantum dots cellular automata as a new computing scheme in the nano-scale regimes. The basic logic element of this technology is a majorit...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w ...