Sciweavers

2661 search results - page 49 / 533
» Quantum Complexity Classes
Sort
View
105
Voted
RTSS
2002
IEEE
15 years 8 months ago
Locking in Pfair-Scheduled Multiprocessor Systems
We present several locking synchronization protocols and associated schedulability conditions for Pfair-scheduled multiprocessor systems. We focus on two classes of protocols. The...
Philip Holman, James H. Anderson
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
16 years 13 days 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
DAC
2010
ACM
15 years 7 months ago
Reducing the number of lines in reversible circuits
Reversible logic became a promising alternative to traditional circuits because of its applications e.g. in low-power design and quantum computation. As a result, design of revers...
Robert Wille, Mathias Soeken, Rolf Drechsler
IPPS
2010
IEEE
15 years 29 days ago
Enhancing adaptive middleware for quantum chemistry applications with a database framework
Quantum chemistry applications such as the General Atomic and Molecular Electronic Structure System (GAMESS) that can execute on a complex peta-scale parallel computing environment...
Lakshminarasimhan Seshagiri, Meng-Shiou Wu, Masha ...
CIE
2006
Springer
15 years 6 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante