Name
Abstract | ||
|---|---|---|
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an alternative generalization, namely to problems of finding hidden nonlinear structures over finite fields. We give examples of two such problems that can be solved efficiently by a quantum computer, but not by a classical computer. We also give some positive results on the quantum query complexity of finding hidden nonlinear structures. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/FOCS.2007.18 | Providence, RI |
Keywords | Field | DocType |
finite field,quantum algorithm,quantum physics,computational complexity,hidden subgroup problem,quantum computer,quantum computing | Discrete mathematics,Quantum,Combinatorics,Finite field,Nonlinear system,Hidden subgroup problem,Computer science,Quantum computer,Quantum algorithm,Computation,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
0272-5428 | 0-7695-3010-9 | 30 |
PageRank | References | Authors |
1.31 | 23 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. M. Childs | 1 | 590 | 52.47 |
| Leonard J. Schulman | 2 | 1328 | 136.88 |
| Umesh V. Vazirani | 3 | 3338 | 610.23 |