Almost-everywhere superiority for Quantum polynomial time

Authors:
Edith Hemaspaandra;Lane A. Hemaspaandra;Marius Zimand
Affiliations:
Rochester Institute of Technology, Rochester, NY;Univ. of Rochester, Rochester, NY;Tosowon Univ., Towson, MD
Venue:
Information and Computation
Year:
2002

Citing 10
Cited 0

A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
A note on almost-everywhere-complex sets and separating deterministic-time-complexity classes

Information and Computation
Almost-everywhere complexity hierarchies for nondeterministic time

Theoretical Computer Science
A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the Power of Quantum Computation

SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Exponential separation of quantum and classical communication complexity

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Quantum Lower Bounds by Polynomials

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem

ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Almost-Everywhere Superiority for Quantum Polynomial-Time Languages

Almost-Everywhere Superiority for Quantum Polynomial-Time Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Simon as extended by Brassard and Hyer shows that there are tasks on which polynomial-time quantum machines are exponentially faster than each classical machine infinitely often. The present paper shows that there are tasks on which polynomial-time quantum machines are exponentially faster than each classical machine almost everywhere.