A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space
Oded Regev
Abstract
In a recent paper, Kuperberg described the first subexponential time algorithm for solving the dihedral hidden subgroup problem. The space requirement of his algorithm is super-polynomial. We describe a modified algorithm whose running time is still subexponential and whose space requirement is only polynomial.
Create a lesson
Related papers
Gaussian entanglement and quantum communication: geodesic optimization and multimode bounds
Hemant K. Mishra, Mark M. Wilde
On the coincidence of discrete and continuous definitions of Entanglement of Formation
Haobo Ma, Maksim E. Shirokov, Wenlin Zhang
EFI1PRS
Rishabh Batra
Relative-Entropy Geometry and Convergence in Nonconvex Wiretap Optimization
Farzin Salek, Masahito Hayashi
Deterministic and programmable generation of mechanical multipartite entangled states
Isabelle Franzen, Max-Emanuel Kern, Q. Rumman Rahman et al.
Quantum-enhanced mechanical sensing with machine-learning estimation
Finn Müßigbrodt, Andraž Omahen, Q. Rumman Rahman et al.