One Complexity Theorist's View of Quantum Computing

One Complexity Theorist's View of Quantum Computing (2000)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Lance Fortnow

Venue:	THEORETICAL COMPUTER SCIENCE
Citations:	19 - 0 self

BibTeX

@ARTICLE{Fortnow00onecomplexity,
    author = {Lance Fortnow},
    title = {One Complexity Theorist's View of Quantum Computing},
    journal = {THEORETICAL COMPUTER SCIENCE},
    year = {2000},
    volume = {292},
    pages = {2003}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools of computational complexity theory should come to bear on these important questions. Quantum Computing

Citations

3376	Introduction to Automata Theory Languages and Computation. 2nd edition. Addison-Wesley Publishing Company, 2000. de - Hopcroft, Ullman - 2004
1121	Quantum Computation and Quantum Information - Nielsen, Chuang - 2000
756	Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer - Shor - 1997
734	A fast quantum mechanical algorithm for database search - Grover - 1996
447	Quantum complexity theory - Bernstein, Vazirani - 1993
409	The complexity of computing the permanent - Valiant - 1979
377	Logical reversibility of computation - Bennett - 1973
356	Nondeterministic exponential time has two-prover interactive protocols - Babai, Fortnow, et al. - 1990
337	On the power of quantum computation - Simon - 1997
295	U.Vazirani, Strengths and weaknesses of quantum computing - Bennett, Brassard - 1997
268	Algebraic methods for interactive proof systems - Lund, Fortnow, et al. - 1990
173	Experimental quantum cryptography - Bennett, Bessette, et al. - 1992
135	Quantum computations: algorithms and error correction - Kitaev - 1997
126	On the degree of Boolean functions as real polynomials - Nisan, Szegedy - 1994
122	A fast Monte-Carlo test for primality - Solovay, Strassen - 1977
112	Quantum computability - Adleman, DeMarrais, et al. - 1997
88	Complexity limitations on quantum computation - Fortnow, Rogers - 1999
61	Counting classes are at least as hard as the polynomialtime hierarchy - Toda, Ogiwara - 1992
55	Quantum cryptanalysis of hidden linear functions - Boneh, Lipton - 1995
47	An oracle builder’s toolkit - Fenner, Fortnow, et al. - 1993
37	The Role of Relativization in Complexity Theory - Fortnow - 1994
35	Correlation Functions - Goulian, Li
32	Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy - Fenner, Green, et al. - 1999
31	Quantum simulations of classical random walks and undirected graph connectivity - Watrous - 2001
29	PSPACE has constant-round quantum interactive proof systems - Watrous - 1999
6	Parallelization, ampli and exponential time simulation of quantum interactive proof systems - Kitaev, Watrous - 2000
5	Quantum Games and Quantum Algorithms - Meyer - 2000
2	Relativized worlds with an in hierarchy - Fortnow - 1999
1	Lecture notes for advanced mathematical methods of physics. http://www.theory.caltech.edu/~preskill/ph229/index.html#lecture - Preskill - 1998