341 search results - page 6 / 69 » Quantum Computation and Lattice Problems |
CLA
2004
13 years 9 months ago
2004
An important problem in applications of formal concept analysis is a possibly large number of clusters extracted from data. Factorization is one of the methods being used to cope w...
EUROPAR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Lattice basis reduction is the problem of finding short vectors in lattices. The security of lattice based cryptosystems is based on the hardness of lattice reduction. Fu...
ISTCS
1997
Springer
13 years 11 months ago
1997
Springer
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...
ITICSE
2010
ACM
13 years 9 months ago
2010
ACM
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor’s factorization [8] ...
FLOPS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...