Quantum Computing

UR-CS Participating Faculty: Lane A. Hemaspaandra (= Lane A. Hemachandra).

Project Description

This project focuses on exploring the power of quantum computation, and in particular on showing its superiority relative to classical deterministic and bounded-error probabilistic computing.

Bibliography

1
This is a list of selected journal (except when the work has not yet appeared in journal/book form) papers, from or related to this project, by University of Rochester authors. Essentially all the papers listed below can be found, in their full technical report versions, in the UR-CS Technical Report Archive's theory section. Lane Hemaspaandra's complete publication list can always be found at http://www.cs.rochester.edu/u/lane/publist.pdf.

2
E. Hemaspaandra, L. Hemaspaandra, and M. Zimand.
Almost-everywhere superiority for quantum polynomial-time languages.
Technical Report TR-754, Department of Computer Science, University of Rochester, Rochester, NY, July 2001.
Revised, August 2002 and January 2005.

3
E. Hemaspaandra, L. Hemaspaandra, and M. Zimand.
Almost-everywhere superiority for quantum polynomial time.
Information and Computation, 175(2):171-181, 2002.

4
H. Spakowski, M. Thakur, and R. Tripathi.
Quantum and classical complexity classes: Separations, collapses, and closure properties.
Information and Computation, 200(1):1-34, 2005.



Lane A. Hemaspaandra