341 search results - page 5 / 69 » Quantum Computation and Lattice Problems |
STOC
2010
ACM
14 years 5 months ago
2010
ACM
STOC
2005
ACM
14 years 8 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
ALGORITHMICA
2010
13 years 7 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. A new logic is proposed for reasoning about quantum systems. The logic embodies the postulates of quantum physics and it was designed from the semantics upwards by identi...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...