Deterministic Algorithms for the Hidden Subgroup Problem

04/29/2021
by   Ashwin Nayak, et al.
0

In this note, we present deterministic algorithms for the Hidden Subgroup Problem. The algorithm for abelian groups achieves the same asymptotic query complexity as the optimal randomized algorithm. The algorithm for non-abelian groups comes within a polylogarithmic factor of the optimal randomized query complexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2022

Finding a Hidden Edge

We consider the problem of finding an edge in a hidden undirected graph ...
research
12/06/2019

Constructive derandomization of query algorithms

We give efficient deterministic algorithms for converting randomized que...
research
06/18/2021

The dihedral hidden subgroup problem

We give an exposition of the hidden subgroup problem for dihedral groups...
research
06/16/2022

Active Fairness Auditing

The fast spreading adoption of machine learning (ML) by companies across...
research
04/20/2003

Whitehead method and Genetic Algorithms

In this paper we discuss a genetic version (GWA) of the Whitehead's algo...
research
05/13/2023

Randomized Algorithm for the Maximum-Profit Routing Problem

In this paper, we consider the Maximum-Profit Routing Problem (MPRP), in...
research
10/16/2018

Peek Search: Near-Optimal Online Markov Decoding

We resolve the fundamental problem of online decoding with ergodic Marko...

Please sign up or login with your details

Forgot password? Click here to reset