Deterministic algorithms for the hidden subgroup problem
type: Item
instance of: scholarly article
title: Deterministic algorithms for the hidden subgroup problem
author: Zekun Ye
author: Lvzhou Li
published in: Information and Computation
publication date: 2022-12-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/2110.00827
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7629156
zbMATH Keywords: quantum computing
zbMATH Keywords: hidden subgroup problem
zbMATH Keywords: query complexity
zbMATH Keywords: deterministic algorithm
MaRDI profile type: Publication
OpenAlex ID: W4285351578
cites work: Q4343414
cites work: Optimal separation in exact query complexities for Simon's problem
cites work: Q2934718
cites work: The query complexity of order-finding
cites work: Hidden Symmetry Subgroup Problems
cites work: Rapid solution of problems by quantum computation
cites work: A quantum algorithm for computing the unit group of an arbitrary degree number field
cites work: The quantum query complexity of the hidden subgroup problem is polynomial
cites work: Hidden translation and orbit coset in quantum computing
cites work: Quantum mechanical algorithms for the nonabelian hidden subgroup problem
cites work: Fast quantum algorithms for computing the unit group and class group of a number field
cites work: Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
cites work: The Hidden Subgroup Problem and Quantum Computation Using Group Representations
cites work: Quantum algorithms and the Fourier transform
cites work: The hidden subgroup problem and permutation group theory
cites work: A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
cites work: The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts
cites work: Q4939150
cites work: Quantum Computation and Lattice Problems
cites work: Polynomial time quantum algorithm for the computation of the unit group of a number field
cites work: Quantum and classical query complexities for generalized Simon's problem
cites work: Query complexity of generalized Simon's problem
DOI: 10.1016/J.IC.2022.104975
Recommended article: On the Complexity of the Hidden Subgroup Problem
Recommended article: ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM
Recommended article: Public Key Cryptography – PKC 2004
Recommended article: A polynomial-time algorithm for solving the hidden subset sum problem
Recommended article: The hidden subgroup problem and MKTP
Recommended article: Sample complexity of hidden subgroup problem
Recommended article: The hidden subgroup problem and permutation group theory
Recommended article: Q3526242
Recommended article: Deterministic Algorithms for Submodular Maximization Problems
description: scientific article; zbMATH DE number 7629156