Quantum property testing of group solvability

Authors:
Yoshifumi Inui;François Le Gall
Affiliations:
Department of Computer Science, The University of Tokyo, Tokyo, Japan and ERATO, SORST Quantum Computation and Information Project, JST, Tokyo, Japan;ERATO, SORST Quantum Computation and Information Project, JST, Tokyo, Japan
Venue:
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Year:
2008

Citing 14
Cited 1

Self-testing/correcting with applications to numerical problems

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Fast Monte Carlo algorithms for permutation groups

Selected papers of the 23rd annual ACM symposium on Theory of computing
Solvable black-box group problems are low for PP

Theoretical Computer Science
Spot-checkers

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Quantum algorithms for solvable groups

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum computation and quantum information

Quantum computation and quantum information
Quantum property testing

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Exact and approximate testing/correcting of algebraic functions: a survey

Theoretical aspects of computer science
Verifying identities

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Derandomizing homomorphism testing in general groups

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Efficient testing of groups

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On The Complexity Of Matrix Group Problems I

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups

Quantum Information & Computation
Quantum complexity of testing group commutativity

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantum property testing for bounded-degree graphs

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

Testing efficiently whether a finite set Γ with a binary operation ċ over it, given as an oracle, is a group is a well-known open problem in the field of property testing. Recently, Friedl, Ivanyos and Santha have made a significant step in the direction of solving this problem by showing that it it possible to test efficiently whether the input (Γ, ċ) is an Abelian group or is far, with respect to some distance, from any Abelian group. In this paper, we make a step further and construct an efficient quantum algorithm that tests whether (Γ, ċ) is a solvable group, or is far from any solvable group. More precisely, the number of queries used by our algorithm is polylogarithmic in the size of the set Γ.