Quantum Testers for Hidden Group Properties
From MaRDI portal
Abstract: We construct efficient or query efficient quantum property testers for two existential group properties which have exponential query complexity both for their decision problem in the quantum and for their testing problem in the classical model of computing. These are periodicity in groups and the common coset range property of two functions having identical ranges within each coset of some normal subgroup. Our periodicity tester is efficient in Abelian groups and generalizes, in several aspects, previous periodicity testers. This is achieved by introducing a technique refining the majority correction process widely used for proving robustness of algebraic properties. The periodicity tester in non-Abelian groups and the common coset range tester are query efficient.
Recommendations
- Mathematical Foundations of Computer Science 2003
- Quantum hypothesis testing with group symmetry
- Automata, Languages and Programming
- Quantum complexity of testing group commutativity
- The Quantum Complexity of Group Testing
- Quantum measurements for hidden subgroup problems with optimal sample complexity
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations
- Hidden subgroup quantum algorithms for a class of semi-direct product groups
Cited in
(4)
This page was built for publication: Quantum Testers for Hidden Group Properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3634002)
