Constructive Membership Testing in Black-Box Classical Groups
نویسندگان
چکیده
1 School of Mathematics and Statistics, The University of Western Australia 35 Stirling Highway CRAWLEY WA 6009 Australia [email protected], [email protected] 2 Faculty of Information Sciences and Engineering, The University of Canberra, ACT, 2601 [email protected] 3 Centro de Álgebra da Universidade de Lisboa Av. Prof. Gama Pinto, 2, 1649-003 Lisboa, Portugal [email protected]
منابع مشابه
Constructive membership in black-box groups
We present an algorithm to reduce the constructive membership problem for a black-box group G to three instances of the same problem for involution centralisers in G. If G is a simple group of Lie type in odd characteristic, then this reduction can be performed in (Monte Carlo) polynomial time.
متن کاملQuantum Algorithms for Learning and Testing Juntas
In this article we develop quantum algorithms for learning and testing juntas, i.e. Boolean functions which depend only on an unknown set of k out of n input variables. Our aim is to develop efficient algorithms: • whose sample complexity has no dependence on n, the dimension of the domain the Boolean functions are defined over; • with no access to any classical or quantum membership (“black-bo...
متن کاملQuantum Algorithms for a Set of Group Theoretic Problems
We study two group theoretic problems, Group Intersection and Double Coset Membership, in the setting of black-box groups, where Double Coset Membership generalizes a set of problems, including Group Membership, Group Factorization, and Coset Intersection. No polynomial-time classical algorithms are known for these problems. We show that for solvable groups, there exist efficient quantum algori...
متن کاملConstructive recognition of a black box group isomorphic to GL(n,2)
A Monte Carlo algorithm is presented for constructing the natural representation of a group G that is known to be isomorphic to GL(n, 2). The complexity parameters are the natural dimension n and the storage space required to represent an element of G. What is surprising about this result is that both the data structure used to compute the isomorphism and each invocation of the isomorphism requ...
متن کاملEquivalences and Separations Between Quantum and Classical Learnability
We consider quantum versions of two well-studied models of learning Boolean functions: Angluin’s model of exact learning from membership queries and Valiant’s Probably Approximately Correct (PAC) model of learning from random examples. For each of these two learning models we establish a polynomial relationship between the number of quantum versus classical queries required for learning. These ...
متن کامل