Abstract
We show that the Hidden Subgroup Problem for group families where products and inverses can be computed efficiently is in BPPMKTP (where MKTP is the Minimum KT Problem) using the techniques of Allender et al. (2018) [1]. We also show that the problem is in ZPPMKTP provided that there is a pac overestimator computable in ZPPMKTP for the logarithm of the order of the input group. This last result implies that for permutation groups, the dihedral group and many types of matrix groups the problem is in ZPPMKTP. Lastly, we also show that two decision versions of the problem admit statistical zero knowledge proofs. These results help classify the relative difficulty of the Hidden Subgroup Problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
