Query complexity of generalized Simon's problem
type: Item
instance of: scholarly article
title: Query complexity of generalized Simon's problem
author: Zekun Ye
author: Yunqi Huang
author: Lvzhou Li
author: Yuyi Wang
published in: Information and Computation
publication date: 2021-11-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/1907.07367
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7433312
zbMATH Keywords: Simon's problem
zbMATH Keywords: query complexity
zbMATH Keywords: quantum computing
zbMATH Keywords: group theory
MaRDI profile type: Publication
OpenAlex ID: W3197138950
cites work: Forrelation: A Problem That Optimally Separates Quantum from Classical Computing
cites work: Separations in query complexity using cheat sheets
cites work: Q2934717
cites work: Superlinear advantage for exact quantum algorithms
cites work: Separations in Query Complexity Based on Pointer Functions
cites work: Quantum lower bounds by polynomials
cites work: Q4819589
cites work: Quantum Property Testing
cites work: The polynomial method strikes back: tight quantum query bounds via dual polynomials
cites work: Optimal separation in exact query complexities for Simon's problem
cites work: Q2934718
cites work: Rapid solution of problems by quantum computation
cites work: The quantum query complexity of the hidden subgroup problem is polynomial
cites work: Quantum mechanical algorithms for the nonabelian hidden subgroup problem
cites work: The Hidden Subgroup Problem and Quantum Computation Using Group Representations
cites work: Complexity measures and decision tree complexity: a survey.
cites work: Quantum computing
cites work: Quantum algorithms and the Fourier transform
cites work: Breaking Symmetric Cryptosystems Using Quantum Period Finding
cites work: Q3410550
cites work: The hidden subgroup problem and permutation group theory
cites work: Q4544834
cites work: Automata, Languages and Programming
cites work: A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
cites work: Deterministic polynomial-time quantum algorithms for Simon's problem
cites work: A note on quantum related-key attacks
cites work: Q3225387
DOI: 10.1016/J.IC.2021.104790
description: scientific article; zbMATH DE number 7433312