Sciweavers

341 search results - page 14 / 69
» Quantum Computation and Lattice Problems
Sort
View
WSCG
2004
118views more  WSCG 2004»
13 years 9 months ago
New Method for Geometric Constraint Solving Based on the Genetic Quantum Algorithm
This paper proposes a novel genetic quantum algorithm (GQA) to solve geometric constraint problems. Instead of binary, numeric or symbolic representation, we introduce qubit chrom...
Chunhong Cao, Wenhui Li
SCN
2010
Springer
122views Communications» more  SCN 2010»
13 years 6 months ago
Recursive Lattice Reduction
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
Thomas Plantard, Willy Susilo
FOCS
2007
IEEE
14 years 2 months ago
The Power of Quantum Systems on a Line
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
Dorit Aharonov, Daniel Gottesman, Sandy Irani, Jul...
ICCAD
2007
IEEE
153views Hardware» more  ICCAD 2007»
14 years 4 months ago
Checking equivalence of quantum circuits and states
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...
George F. Viamontes, Igor L. Markov, John P. Hayes
JSCIC
2008
124views more  JSCIC 2008»
13 years 7 months ago
Growth, Structure and Pattern Formation for Thin Films
Abstract An epitaxial thin film consists of layers of atoms whose lattice properties are determined by those of the underlying substrate. This paper reviews mathematical modeling, ...
Russel E. Caflisch