Sciweavers

2479 search results - page 23 / 496
» Quantum complexity theory
Sort
View
CDES
2006
99views Hardware» more  CDES 2006»
13 years 10 months ago
Teraflop Computing for Nanoscience
: Over the last three decades there has been significant progress in the first principles methods for calculating the properties of materials at the quantum level. They have largel...
Yang Wang 0008, G. M. Stocks, Aurelian Rusanu, D. ...
ECCC
2008
98views more  ECCC 2008»
13 years 9 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 9 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
ICALP
2005
Springer
14 years 2 months ago
All Quantum Adversary Methods Are Equivalent
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
Robert Spalek, Mario Szegedy
CSL
2003
Springer
14 years 2 months ago
A Logic for Probability in Quantum Systems
Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to descr...
Ron van der Meyden, Manas Patra