Sciweavers

508 search results - page 65 / 102
» Poly-locality in quantum computing
Sort
View
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
14 years 1 months ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig
ICCSA
2005
Springer
14 years 2 months ago
High-Level Quantum Chemical Methods for the Study of Photochemical Processes
Multireference configuration interaction calculations have been performed on the excited state energy surfaces of the methyleneimmonium cation using recently developed methods for ...
Hans Lischka, Adélia J. A. Aquino, Mario Ba...
QUANTUMCOMM
2009
Springer
14 years 3 months ago
The Case for Quantum Key Distribution
Quantum key distribution (QKD) promises secure key agreement by using quantum mechanical systems. We argue that QKD will be an important part of future cryptographic infrastructur...
Douglas Stebila, Michele Mosca, Norbert Lütke...
ISCA
2008
IEEE
113views Hardware» more  ISCA 2008»
14 years 3 months ago
Running a Quantum Circuit at the Speed of Data
We analyze circuits for a number of kernels from popular quantum computing applications, characterizing the hardware resources necessary to take ancilla preparation off the critic...
Nemanja Isailovic, Mark Whitney, Yatish Patel, Joh...
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 6 months ago
BQP and the Polynomial Hierarchy
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
Scott Aaronson