Superlinear advantage for exact quantum algorithms

@inproceedings{Ambainis2013SuperlinearAF,
  title={Superlinear advantage for exact quantum algorithms},
  author={Andris Ambainis},
  booktitle={STOC '13},
  year={2013}
}
  • Andris Ambainis
  • Published in STOC '13 2013
  • Mathematics, Physics, Computer Science
  • A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms. For total Boolean functions in the query model, the biggest known gap was just a factor of 2: PARITY of N input bits requires N queries classically but can be computed with N/2 queries by an exact quantum algorithm. We present the first example of a… CONTINUE READING

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 29 CITATIONS

    Separations in Query Complexity Based on Pointer Functions

    VIEW 7 EXCERPTS

    A REFORMULATION OF THE QUANTUM QUERY MODEL

    VIEW 7 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Characterizations of symmetrically partial Boolean functions with exact quantum query complexity

    VIEW 14 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Quantum query without unitary operators

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Time-space tradeoffs for two-way finite automata

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Generalizations of the distributed Deutsch-Jozsa promise problem

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Quantum Query Algorithms

    VIEW 3 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Almost tight bound on the query complexity of generalized Simon's problem

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES

    Span-program-based quantum algorithm for evaluating formulas

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Quantum Amplitude Amplification and Estimation

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    An exact quantum polynomial-time algorithm for Simon's problem

    • Gilles Brassard, Peter Høyer
    • Computer Science, Physics
    • Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems
    • 1997
    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    On the degree of Boolean functions as real polynomials

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Complexity measures and decision tree complexity: a survey

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL