Sciweavers

587 search results - page 24 / 118
» Quantum computation and quantum information
Sort
View
ICALP
2001
Springer
14 years 2 months ago
Separating Quantum and Classical Learning
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
Rocco A. Servedio
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 10 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro
ENTCS
2008
94views more  ENTCS 2008»
13 years 10 months ago
From Reversible to Irreversible Computations
In this paper we study the relation between reversible and irreversible computation applicable to different models of computation -- here we are considering classical and quantum ...
Alexander S. Green, Thorsten Altenkirch
ISCA
2006
IEEE
92views Hardware» more  ISCA 2006»
13 years 10 months ago
Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing
The assumption of maximum parallelism support for the successful realization of scalable quantum computers has led to homogeneous, "sea-of-qubits" architectures. The res...
Darshan D. Thaker, Tzvetan S. Metodi, Andrew W. Cr...