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


    Publications referenced by this paper.
    Quantum Complexity Theory
    • 854
    On the power of quantum computation
    • 947
    • PDF
    Quantum computation of Fourier transforms over symmetric groups
    • R. Beals
    • Mathematics, Computer Science
    • 1997
    • 124
    • PDF
    Limitations of quantum coset states for graph isomorphism
    • 97
    • PDF
    On the impossibility of a quantum sieve algorithm for graph isomorphism
    • 24
    • PDF
    Quantum Algorithms for Hidden Nonlinear Structures
    • 39
    • PDF
    Normal subgroup reconstruction and quantum computation using group representations
    • 115
    • PDF
    A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
    • 235
    • Highly Influential
    • PDF
    Quantum algorithms for some hidden shift problems
    • 143
    • PDF
    From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
    • 117
    • Highly Influential
    • PDF