An introduction to quantum complexity theory

An introduction to quantum complexity theory (2000)

Cached

Download Links

[www.hep.princeton.edu]

by Richard Cleve

Venue:	Collected Papers on Quantum Computation and Quantum Information Theory
Citations:	22 - 0 self

BibTeX

@INPROCEEDINGS{Cleve00anintroduction,
    author = {Richard Cleve},
    title = {An introduction to quantum complexity theory},
    booktitle = {Collected Papers on Quantum Computation and Quantum Information Theory},
    year = {2000},
    pages = {103--127},
    publisher = {World Scientific}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

8881	D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness - Garey, Johnson - 1979
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
583	Quantum theory, the Church–Turing principle and the universal quantum computer - Deutsch - 1985
447	Quantum complexity theory - Bernstein, Vazirani - 1993
377	Logical reversibility of computation - Bennett - 1973
342	Some complexity questions related to distributive computing - Yao - 1979
337	On the power of quantum computation - Simon - 1997
295	U.Vazirani, Strengths and weaknesses of quantum computing - Bennett, Brassard - 1997
267	circuit complexity - Yao - 1993
226	Quantum computational networks - Deutsch - 1989
180	Fault-tolerant quantum computation - Shor
174	Fault-tolerant quantum computation with constant error - Aharonov, Ben-Or - 1997
159	Unbiased bits from sources of weak randomness and probabilistic communication complexity - Chor, Goldreich - 1985
137	Quantum measurements and the Abelian Stabilizer Problem lanl e-print quant-ph/9511026 - Kitaev
135	Quantum computations: algorithms and error correction - Kitaev - 1997
131	Quantum Algorithms Revisited - Cleve, Ekert, et al. - 1998
122	Elementary gates for quantum computation,” Phys - Barenco, Bennett, et al. - 1995
113	A.: Quantum vs. classical communication and computation - Buhrman, Cleve, et al.
109	Tight bounds on quantum searching”, Fortsch.Phys - Boyer, Brassard, et al. - 1998
102	On distinguishing prime numbers from composite numbers - Adleman, Pomerance, et al. - 1983
95	Quantum counting - Brassard, Hoyer, et al. - 1998
90	Grover’s quantum searching algorithm is optimal, lanl e-print quant-ph/9711070 - Zalka
88	Complexity limitations on quantum computation - Fortnow, Rogers - 1999
80	An exact quantum polynomial-time algorithm for Simon's problem - Brassard, Hoyer - 1997
73	Exponential separation of quantum and classical communication complexity - Raz - 1999
51	The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer - Mosca, Ekert - 1999
48	Strong communication complexity or generating quasirandom sequences form two communicating semi-random sources - Vazirani - 1987
43	M.Sipser, A limit on the speed of quantum computation in determining parity, Phys.Rev.Lett - Farhi, Gutmann - 1998
42	Some estimates of the information transmitted by a quantum communication channel”, Probl - Holevo - 1973
33	A rigorous time bound for factoring integers - Pomerance - 1992
29	Fast Monte Carlo test for primality - Solovay, Strassen - 1977
24	A.Tapp. Multiparty quantum communication complexity - Buhrman, Dam, et al. - 1999
22	On universal and fault-tolerant quantum computing: a novel basis and a new constructive proof of universality for Shor’s basis - Boykin, Mor, et al. - 1999
22	Threshold accuracy for quantum computation," LANL e-print quant-ph/9610011 - Knill, Laflamme, et al.
19	Substituting Quantum Entanglement for Communication, Phys - Cleve, Buhrman - 1997
18	Fast, rigorous factorization and discrete logarithm algorithms, Discrete Algorithms and Complexity, edited by - Pomerance - 1987
17	Computational complexity of uniform quantum circuit families and quantum Turing machines. Theoret - Nishimura, Ozawa
16	Quantum searching, counting and amplitude amplification by eigenvector analysis - Mosca
15	Quantum gates and circuits - DiVincenzo - 1998
6	Lower bounds for quantum search and derandomization - Buhrman, Wolf
6	Realizable universal quantum logic gates”, preprint - Sleator, Weinfurter - 1994
5	Quantum entanglement and communication complexity”, preprint on the quant-ph archive 1 - Buhrman, Cleve, et al. - 1997
4	The complexity of theorem proving procedures,” Proc - Cook - 1971
4	Quantum Communication, MSc - Kremer - 1995
4	Lie groups and quantum circuits - Solovay - 2000
3	Fast Quantum Verification for the Formulas of Predicate Calculus - Ozhigov
2	A Grover-based quantum search of optimal order for an unknown number of marked elements”, preprint quant-ph/9902049 - Zalka - 1999