Quantum algorithms for hidden nonlinear structures

Simple item page
dc.creatorChilds, Andrew M.
dc.creatorSchulman, Leonard J.
dc.creatorVazirani, Umesh V.
dc.date2007-05-21
dc.date.accessioned2026-07-07T09:49:12Z
dc.date.available2026-07-07T09:49:12Z
dc.descriptionAttempts 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.
dc.description13 pages
dc.identifierhttps://arxiv.org/abs/0705.2784
dc.identifierhttp://arxiv.org/abs/0705.2784
dc.identifierProc. 48th IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 395-404
dc.identifierdoi:10.1109/FOCS.2007.18
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/164499
dc.subjectQuantum Physics
dc.titleQuantum algorithms for hidden nonlinear structures
dc.typetext

Files

Collections

arXiv