The quantum query complexity of the abelian hidden subgroup problem

No abstract is available for this paper.

• Publication year

  2007

• Venue

  Theoretical Computer Science

• Publication date

  2007-07-20

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/J.TCS.2007.02.057
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Quantum Lower Bound for the Query Complexity of Simon's Problem

  2005cited by this paper
• Quantum Lower Bound for the Collision Problem with Small Range

  2005cited by this paper
• Quantum Computing (Natural Computing Series)

  2004influential reference
• 20世紀の名著名論：Peter Shor : Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

  2004cited by this paper
• The theory of finite groups : an introduction

  2004cited by this paper
• The quantum query complexity of the hidden subgroup problem is polynomial

  2004cited by this paper
• The theory of finite groups

  2003cited by this paper
• Quantum walk algorithm for element distinctness

  2003cited by this paper
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem

  2003cited by this paper
• A quantum lower bound for the collision problem

  2003cited by this paper
• The quantum fourier transform and extensions of the abelian hidden subgroup problem

  2002cited by this paper
• Quantum Computing

  2001cited by this paper
• Quantum lower bound for the collision problem

  2001cited by this paper
• Quantum lower bounds for the collision and the element distinctness problems

  2001cited by this paper
• Quantum lower bounds by quantum arguments

  2000cited by this paper
• A better lower bound for quantum algorithms searching an ordered list

  1999cited by this paper
• Conjugated operators in quantum algorithms

  1999cited by this paper
• Quantum lower bounds by polynomials

  1998cited by this paper
• An exact quantum polynomial-time algorithm for Simon's problem

  1997cited by this paper
• Quantum algorithms and the Fourier transform

  1997cited by this paper
• Quantum computation of Fourier transforms over symmetric groups

  1997cited by this paper
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

  1995influential reference
• On the power of quantum computation

  1994cited by this paper
• On the degree of polynomials that approximate symmetric Boolean functions (preliminary version)

  1992cited by this paper
• On the degree of boolean functions as real polynomials

  1992cited by this paper

• Revisiting finite Abelian hidden subgroup problem and its distributed exact quantum algorithm

  2025cites this paper
• A survey about Hidden Subgroup Problem from a mathematical and cryptographic perspective

  2025cites this paper
• Probabilistic Bounds on the Number of Elements to Generate Finite Nilpotent Groups and Their Applications

  2025cites this paper
• The Status and Prospect of Quantum-Classical Combination Integer Factorization Algorithm

  2025cites this paper
• Enhanced QSimon Algorithm for Attacking the Offset Two‐Round Scheme

  2024cites this paper
• Quantum Complexity for Discrete Logarithms and Related Problems

  2023cites this paper
• Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher

  2023influential citation
• Intractable Group-theoretic Problems Around Zero-knowledge Proofs

  2022cites this paper
• An exact quantum hidden subgroup algorithm and applications to solvable groups

  2022cites this paper
• Quantum query complexity with matrix-vector products

  2021influential citation
• On Assessing the Quantum Advantage for MaxCut Provided by Quantum Neural Network Ans\"atze

  2021cites this paper
• Tight Bounds for Simon's Algorithm

  2020cites this paper
• Quantum and classical query complexities for generalized Simon's problem

  2019influential citation
• Simon's problem for linear functions

  2018influential citation
• Optimal Separation in Exact Query Complexities for Simon's Problem

  2016influential citation
• Quantum Fourier transform of polarization photons mediated by weak cross-Kerr nonlinearity

  2013cites this paper
• Two-player interaction in quantum computing : cryptographic primitives & query complexity. (Interaction à deux joueurs en informatique quantique : primitives cryptographiques et complexité en requêtes)

  2011cites this paper
• Conjugate adjoining problem in braid groups and new design of braid-based signatures

  2010cites this paper
• New Cryptosystems From CSP-Based Self-Distributive Systems

  2009cites this paper
• Adversary Lower Bounds for Nonadaptive Quantum Algorithms

  2008cites this paper
• Quantum algorithms for algebraic problems

  2008cites this paper
• Adversary lower bounds for nonadaptive quantum algorithms

  2008cites this paper
• On the Probabilistic Query Complexity of Transitively Symmetric Problems

  2006cites this paper