341 search results - page 20 / 69 » Quantum Computation and Lattice Problems |
GC
2002
Springer
13 years 7 months ago
2002
Springer
One of the classical problems concerning the peg solitaire game is the feasibility issue. Tools used to show the infeasibility of various peg games include valid inequalities, know...
STOC
1998
ACM
13 years 12 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
FCT
1991
Springer
13 years 11 months ago
1991
Springer
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...