Deterministic algorithms for the hidden subgroup problem

DOI10.1016/j.ic.2022.104975OpenAlexW4285351578MaRDI QIDQ2105456

Lvzhou Li, Zekun Ye

Publication date: 8 December 2022

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

quantum computingdeterministic algorithmquery complexityhidden subgroup problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• The query complexity of order-finding
• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• Optimal separation in exact query complexities for Simon's problem
• Query complexity of generalized Simon's problem
• The quantum query complexity of the hidden subgroup problem is polynomial
• Quantum and classical query complexities for generalized Simon's problem
• The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts
• Hidden translation and orbit coset in quantum computing
• Fast quantum algorithms for computing the unit group and class group of a number field
• Polynomial time quantum algorithm for the computation of the unit group of a number field
• Rapid solution of problems by quantum computation
• Quantum algorithms and the Fourier transform
• Quantum Computation and Lattice Problems
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• A quantum algorithm for computing the unit group of an arbitrary degree number field
• Hidden Symmetry Subgroup Problems
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deterministic algorithms for the hidden subgroup problem