Corpus ID: 14862588

Quantum Computing and the Hunt for Hidden Symmetry

  title={Quantum Computing and the Hunt for Hidden Symmetry},
  author={G. Alagic and A. Russell},
  journal={Bull. EATCS},
  • G. Alagic, A. Russell
  • Published 2007
  • Mathematics, Computer Science
  • Bull. EATCS
  • In 1994, Peter Shor gave e cient quantum algorithms for factoring integers and extracting discrete logarithms [20]. If we believe that nature will permit us to faithfully implement our current model of quantum computation, then these algorithms dramatically contradict the Strong Church-Turing thesis. The e ect is heightened by the fact that these algorithms solve computational problems with long histories of attention by the computational and mathematical communities alike. In this article we… CONTINUE READING
    1 Citations


    Quantum Complexity Theory
    • 837
    On the power of quantum computation
    • D. Simon
    • Computer Science
    • Proceedings 35th Annual Symposium on Foundations of Computer Science
    • 1994
    • 961
    • PDF
    Quantum computation of Fourier transforms over symmetric groups
    • R. Beals
    • Mathematics, Computer Science
    • STOC '97
    • 1997
    • 123
    • PDF
    Limitations of quantum coset states for graph isomorphism
    • 97
    • PDF
    On the impossibility of a quantum sieve algorithm for graph isomorphism
    • 26
    • PDF
    Quantum Algorithms for Hidden Nonlinear Structures
    • 38
    • PDF
    Normal subgroup reconstruction and quantum computation using group representations
    • 116
    • PDF
    A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
    • G. Kuperberg
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 2005
    • 237
    • Highly Influential
    • PDF
    Quantum algorithms for some hidden shift problems
    • 144
    • PDF
    From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
    • 117
    • Highly Influential
    • PDF