Sciweavers

341 search results - page 13 / 69
» Quantum Computation and Lattice Problems
Sort
View
VISUALIZATION
2005
IEEE
14 years 1 months ago
VolQD: Direct Volume Rendering of Multi-million Atom Quantum Dot Simulations
In this work we present a hardware-accelerated direct volume rendering system for visualizing multivariate wave functions in semiconducting quantum dot (QD) simulations. The simul...
Wei Qiao, David S. Ebert, Alireza Entezari, Marek ...
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
ISCA
2005
IEEE
128views Hardware» more  ISCA 2005»
14 years 1 months ago
An Evaluation Framework and Instruction Set Architecture for Ion-Trap Based Quantum Micro-Architectures
: The theoretical study of quantum computation has yielded efficient algorithms for some traditionally hard problems. Correspondingly, experimental work on the underlying physical...
Steven Balensiefer, Lucas Kreger-Stickles, Mark Os...
ISCI
2008
104views more  ISCI 2008»
13 years 7 months ago
Unconditionally secure cryptosystems based on quantum cryptography
Most modern cryptographic studies design cryptosystems and algorithms using mathematical concepts. In designing and analyzing cryptosystems and protocols, mathematical concepts ar...
Yu-Fang Chung, Zhen Yu Wu, Tzer-Shyong Chen
ASIACRYPT
2010
Springer
13 years 5 months ago
Lattice-Based Blind Signatures
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
Markus Rückert