Sciweavers

2661 search results - page 4 / 533
» Quantum Complexity Classes
Sort
View
102
Voted
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 26 days ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 5 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
104
Voted
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
15 years 10 months ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger
79
Voted
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
15 years 6 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur
ECCC
2008
98views more  ECCC 2008»
15 years 19 days 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