FOCS | STOC | |

1993 | 2 | 1 |

1994 | 2 | 0 |

1995 | 1 | 1 |

1996 | 3 | 1 |

1997 | 1 | 2 |

1998 | 5 | 4 |

1999 | 6 | 6 |

2000 | 8 |

- Andrew Chi-Chih Yao.

Quantum circuit complexity. - Gilles Brassard and Claude Cr?peau and Richard Jozsa and Denis Langlois.

A quantum bit commitment scheme provably unbreakable by both parties.

- Daniel R. Simon.

On the power of quantum computation. - Peter W. Shor.

Algorithms for quantum computation: Discrete logarithms and factoring.

- John Watrous.

On one-dimensional quantum cellular automata.

- Christoph D?rr and Miklos Santha.

A decision procedure for unitary linear quantum cellular automata. - D. Aharonov and M. Ben-Or.

Polynomial simulations of decohered quantum computers. - Peter W. Shor.

Fault-tolerant quantum computation.

- Attila Kondacs and John Watrous.

On the power of quantum finite state automata.

- Andris Ambainis, Leonard Schulman, Amnon Ta-Shma, Umesh Vazirani, and Avi Wigderson.

The Quantum Communication Complexity of Sampling. - Andris Ambainis and Rusins Freivalds.

1-way quantum finite automata: strengths, weaknesses and generalizations. - Dominic Mayers and Andrew Yao.

Quantum Cryptography with Imperfect Apparatus. - R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf.

Quantum Lower Bounds by Polynomials. - Wim van Dam.

Quantum Oracle Interrogation: Getting all information for almost half the price.

- John Watrous.

PSPACE has constant-round quantum interactive proof systems. - P. Oscar Boykin, Tal Mor, Mathew Pulver, Vwani Roychowdhury, and Farrokh Vatan.

On Universal and Fault-Tolerant Quantum Computing: A Novel Basis and a New Constructive Proof of Universality for Shor's Basis. - Ashwin Nayak.

Optimal lower bounds for quantum automata and random access codes. - H. Buhrman, R. Cleve, R. de Wolf, and Ch. Zalka.

Reducing Error Probability in Quantum Algorithms. - Andris Ambainis.

A better lower bound for quantum algorithms searching an ordered list. - John Watrous.

On quantum and classical space-bounded processes with algebraic transition amplitudes.

- Ethan Bernstein and Umesh Vazirani.

Quantum complexity theory (preliminary abstract).

- Andrew Chi-Chih Yao.

Security of quantum protocols against coherent measurements.

- Lov K. Grover.

A fast quantum mechanical algorithm for database search.

- Robert Beals.

Quantum computation of Fourier transforms over symmetric groups. - D. Aharonov and M. Ben-Or.

Fault tolerant quantum computation with constant error.

- Dorit Aharonov, Alexei Kitaev, and Noam Nisan.

Quantum Circuits with Mixed States. - Lov K. Grover.

A Framework for Fast Quantum Mechanical Algorithms. - Harry Buhrman, Richard Cleve, and Avi Wigderson.

Quantum vs. Classical Communication and Computation. - Peter Shor.

Developments in Quantum Computing.

- Ashwin Nayak and Felix Wu.

The quantum query complexity of approximating the median and related problems. - Lisa Hales and Sean Hallgren,

Quantum Fourier Sampling Simplified. - Ran Raz.

Exponential separation of quantum and classical communication complexity. - Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, and Umesh Vazirani.

Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata. - Masami Amano and Kazuo Iwama.

Undecidability on Quantum Finite Automata. - Leonard J. Schulman and Umesh Vazirani.

Molecular Scale Heat Engines and Scalable Quantum Computation.

- Andris Ambainis

Quantum lower bounds by quantum arguments - Sean Hallgren, Alexander Russell, and Amnon Ta-Shma

Normal Subgroup Reconstruction and Quantum Computation Using Group Representations - Alexei Kitaev and John Watrous

Parallelization, amplification, and exponential time simulation of quantum interactive proof systems - Hartmut Klauck

On quantum and probabilistic communication: Las Vegas and bounded rounds - Lov K. Grover

Rapid Sampling through Quantum Computing - Wim van Dam, Frederic Magniez, Michele Mosca, and Miklos Santha

Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates - Eli Biham, Michel Boyer, P. Oscar Boykin, Tal Mor, Vwani Roychowdhury

A proof of security of quantum key distribution - Amnon Ta-Shma, Umesh Vazirani, and Andrew C. Yao

Quantum Bit Escrow