In computational complexity theory and quantum computing, Simon's problem is a computational problem in the model of decision tree complexity orâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Thomas Santoli, Christian Schaffner
- Quantum Information & Computation
- 2017

We present new connections between quantum information and the field of classical cryptography. In particular, we provideâ€¦Â (More)

Is this relevant?

2016

2016

- Guangya Cai, Daowen Qiu
- ArXiv
- 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

- Gorjan Alagic, Cristopher Moore, Alexander Russell
- ACM Trans. Algorithms
- 2009

Daniel Simon's 1994 discovery of an efficient quantum algorithm for finding “hidden shifts” of Z<sub>2</sub><sup><i>nâ€¦Â (More)

Is this relevant?

2007

2007

- Gorjan Alagic, Cristopher Moore, Alexander Russell
- SODA
- 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

- Pascal Koiran, Vincent Nesme, Natacha Portier
- Theor. Comput. Sci.
- 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

- Dave Bacon
- 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

- Pascal Koiran, Vincent Nesme, Natacha Portier
- ICALP
- 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

- Takashi Mihara, Shao Chin Sung
- computational complexity
- 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

- Sean Hallgren, Alexander Russell, Amnon Ta-Shma
- SIAM J. Comput.
- 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

- Gilles Brassard, Peter HÃ¸yer
- ISTCS
- 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?