Results 1  10
of
5,516
Simulating Physics with Computers
 SIAM Journal on Computing
, 1982
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 601 (1 self)
 Add to MetaCart
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 622 (6 self)
 Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently  those with shortrange forces where the neighbors of each atom change rapidly. They can be implemented on any distributedmemory parallel machine which allows for messagepassing of data between independently executing processors. The algorithms are tested on a standard LennardJones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers  the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray YMP and C90 algorithm shows that the current generation of parallel machines is competitive with conventi...
The Landscape of Parallel Computing Research: A View from Berkeley
 TECHNICAL REPORT, UC BERKELEY
, 2006
"... ..."
Sieving for Shortest Vectors in Ideal Lattices
, 2011
"... Lattice based cryptography is gaining more and more importance in the cryptographic community. It is a common approach to use a special class of lattices, socalled ideal lattices, as the basis of lattice based crypto systems. This speeds up computations and saves storage space for cryptographic ke ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
shortest vector in ideal lattices faster than in regular lattices without special structure. The practical speedup of our algorithm is linear in the degree of the field polynomial. We also propose an ideal lattice variant of the heuristic GaussSieve algorithm that allows for the same speedup.
Lockfree GaussSieve for linear speedups in parallel high performance SVP calculation
 IN: SBACPAD
, 2014
"... Latticebased cryptography became a hottopic in the past years because it seems to be quantum immune, i.e., resistant to attacks operated with quantum computers. The security of latticebased cryptosystems is determined by the hardness of certain lattice problems, such as the Shortest Vector Pro ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Latticebased cryptography became a hottopic in the past years because it seems to be quantum immune, i.e., resistant to attacks operated with quantum computers. The security of latticebased cryptosystems is determined by the hardness of certain lattice problems, such as the Shortest Vector
On Quantum Sieve Approaches to the Lattice Shortest Vector Problem
, 2014
"... The lattice hortest vector problem, or lattice SVP, has gained a lot of attention in the field of quantum computing. There are a number of reasons for this, including the fact that the hardness of lattice SVP is the foudation of a number of postquantum cryptosystems and that approximateSVP is in N ..."
Abstract
 Add to MetaCart
The lattice hortest vector problem, or lattice SVP, has gained a lot of attention in the field of quantum computing. There are a number of reasons for this, including the fact that the hardness of lattice SVP is the foudation of a number of postquantum cryptosystems and that approximate
Quantum walk algorithms for element distinctness
 In: 45th Annual IEEE Symposium on Foundations of Computer Science, OCT 1719, 2004. IEEE Computer Society Press, Los Alamitos, CA
, 2004
"... We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element distinctness (the problem of finding two equal items among N given items), we get an O(N 2/3) query quantum algorithm. This improves the previous O(N 3/4) quantum algorithm of Buhrm ..."
Abstract

Cited by 174 (14 self)
 Add to MetaCart
We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element distinctness (the problem of finding two equal items among N given items), we get an O(N 2/3) query quantum algorithm. This improves the previous O(N 3/4) quantum algorithm
Quantum Computation and Lattice Problems
 Proc. 43rd Symposium on Foundations of Computer Science
, 2002
"... We present the first explicit connection between quantum computation and lattice problems. Namely, we show a solution to the uniqueSVP under the assumption that there exists... ..."
Abstract

Cited by 74 (4 self)
 Add to MetaCart
We present the first explicit connection between quantum computation and lattice problems. Namely, we show a solution to the uniqueSVP under the assumption that there exists...
Results 1  10
of
5,516