Quantum property testing of group solvability

DOI10.1007/s00453-009-9338-8zbMath1206.68126arXiv0712.3829OpenAlexW2159110883MaRDI QIDQ627520

Yoshifumi Inui, François Le Gall

Publication date: 2 March 2011

Published in: Algorithmica, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0712.3829

zbMATH Keywords

quantum algorithmsolvable groupproperty testing

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Property testing for cyclic groups and beyond ⋮ Quantum Property Testing for Bounded-Degree Graphs

Cites Work

• Self-testing/correcting with applications to numerical problems
• Solvable black-box group problems are low for PP
• Spot-checkers
• Fast Monte Carlo algorithms for permutation groups
• Derandomizing homomorphism testing in general groups
• Hidden translation and orbit coset in quantum computing
• Efficient testing of groups
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum algorithms for solvable groups
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Mathematical Foundations of Computer Science 2003
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantum property testing of group solvability