Simon's problem

Known as: Simon algorithm, Simon's Algorithm, Simons algorithm 
In computational complexity theory and quantum computing, Simon's problem is a computational problem in the model of decision tree complexity or… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1972-2016
02419722016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We present new connections between quantum information and the field of classical cryptography. In particular, we provide… (More)
  • figure 1
  • figure 2
Is this relevant?
2016
2016
Simon’s problem is one of the most important problems demonstrating the power of quantum computers, which achieves a large… (More)
Is this relevant?
2009
2009
Daniel Simon's 1994 discovery of an efficient quantum algorithm for finding &#8220;hidden shifts&#8221; of Z<sub>2</sub><sup><i>n… (More)
Is this relevant?
2007
2007
Daniel Simon's 1994 discovery of an efficient quantum algorithm for solving the hidden subgroup problem (HSP) over Z<sup><i>n</i… (More)
Is this relevant?
2007
2007
Simon in his FOCS’94 paper was the first to show an exponential gap between classical and quantum computation. The problem he… (More)
Is this relevant?
2006
2006
In Simon’s problem we are given a function from n bit strings to n bit strings, f : {0, 1} → {0, 1} which is guaranteed to… (More)
Is this relevant?
2005
2005
Simon in his FOCS'94 paper was the first to show an exponential gap between classical and quantum computation. The problem he… (More)
Is this relevant?
2003
2003
D. R. Simon stated a problem, so-called Simon’s problem, whose computational complexity is in the class BQPψ but not in BPP… (More)
Is this relevant?
2003
2003
The hidden subgroup problem is the foundation of many quantum algorithms. An efficient solution is known for the problem over… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a… (More)
Is this relevant?