Superpolynomial Speedups Based on Almost Any Quantum Circuit

  title={Superpolynomial Speedups Based on Almost Any Quantum Circuit},
  author={Sean Hallgren and A. Harrow},
  • Sean Hallgren, A. Harrow
  • Published in ICALP 2008
  • Physics, Computer Science, Mathematics
  • The first separation between quantum polynomial time and classical bounded-error polynomial time was due to Bernstein and Vazirani in 1993. They first showed a O(1) vs. Omega(n) quantum-classical oracle separation based on the quantum Hadamard transform, and then showed how to amplify this into a n^{O(1)} time quantum algorithm and a n^{Omega(log n)} classical query lower bound. We generalize both aspects of this speedup. We show that a wide class of unitary circuits (which we call dispersing… CONTINUE READING

    Figures and Topics from this paper.

    Exponential quantum speed-ups are generic
    • 23
    • Highly Influenced
    • PDF
    Pseudo-randonmess and Learning in Quantum Computation
    • 39
    • PDF
    Quantum algorithms for highly non-linear Boolean functions
    • 29
    • PDF
    A pr 2 01 3 Exponential Quantum Speed-ups are Generic
    • 1
    • Highly Influenced
    • PDF
    Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure
    • 17
    • PDF
    Random Quantum Circuits are Approximate 2-designs
    • 119
    • PDF
    Quantum algorithms using the curvelet transform
    • 5
    • PDF
    Mixing Properties of Stochastic Quantum Hamiltonians
    • 17
    • PDF


    Publications referenced by this paper.
    On the power of quantum computation
    • 947
    • PDF
    Quantum complexity theory
    • 647
    • PDF
    On the Power of Quantum Computation
    • 274
    • PDF
    Cryptographic Distinguishability Measures for Quantum-Mechanical States
    • 515
    • PDF
    Quantum computation of Fourier transforms over symmetric groups
    • R. Beals
    • Mathematics, Computer Science
    • 1997
    • 124
    • PDF