Documents
Authors
Tables
Log in
Sign up
MetaCart
DMCA
Donate
Documents:
Advanced Search
Include Citations
Authors:
Advanced Search
Include Citations
Tables:
DMCA
Quantum Computational Complexity
Cached
Download Links
[www.cs.uwaterloo.ca]
[www.cs.uwaterloo.ca]
[cs.uwaterloo.ca]
[arxiv.org]
[arxiv.org]
Save to List
Add to Collection
Correct Errors
Monitor Changes
by John Watrous
Citations:
38 - 4 self
Summary
Citations
Active Bibliography
Co-citation
Clustered Documents
Version History
Citations
1236
The knowledge complexity of interactive proof systems
- Goldwasser, Micali, et al. - 1989
999
On the Einstein-Podolski-Rosen paradox
- Bell - 1964
854
Quantum theory, the Church-Turing principle and the universal quantum computer
- Deutsch - 1985
796
Proof verification and the hardness of approximation problems
- Arora, Lund, et al. - 1998
751
Some Optimal Inapproximability Results,
- Hastad - 2001
661
Logical reversibility of computation
- Bennett - 1973
599
Simulating physics with computers
- Feynman - 1982
585
Th e complexity of theorem proving procedures.
- Cook - 1971
571
Quantum complexity theory
- Bernstein, Vazirani - 1993
416
Addendum to nondeterministic exponential time has two-prover interactive protocols
- Babai, Fortnow, et al. - 1992
414
Probabilistic checking of proofs; a new characterization of np
- Arora, Safra - 1992
375
Strengths and weaknesses of quantum computing
- Bennett, Bernstein, et al. - 1997
351
Trading group theory for randomness
- Babai - 1985
338
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Babai, Moran - 1988
287
Quantum computational networks
- Deutsch - 1989
221
Private coins versus public coins in interactive proof systems
- Goldwasser, Sipser
212
Free bits, pcps and non-approximability — towards tight results.
- Bellare, Goldreich, et al. - 1995
193
Quantum computations: algorithms and error correction
- Kitaev - 1997
166
The PCP theorem by gap amplification
- Dinur
145
Quantum lower bounds for the collision and the element distinctness problems
- Aaronson, Shi
142
Quantum circuits with mixed states
- Aharonov, Kitaev, et al. - 1998
126
Gap-definable counting classes
- Fenner, Fortnow, et al. - 1991
123
The Complexity of Promise Problems with Applications to Public-Key Cryptography, Information and Control 61
- Even, Selman, et al. - 1984
120
Consequences and limits of nonlocal strategies.
- Cleve, Høyer, et al. - 2004
116
Quantum computability,
- Adleman, Demarrais, et al. - 1997
115
On relating time and space to size and depth
- BORODIN - 1977
110
Two-prover one-round proof systems: Their power and their problems.
- Feige, Lovasz - 1992
107
Two theorems on random polynomial time
- Adleman - 1978
96
On the complexity of matrix group problems, I. In
- Babai, Szemeredi - 1984
93
Complexity limitations on quantum computation
- FORTNOW, ROGERS - 1999
92
PP is closed under intersection
- Beigel, Reingold, et al. - 1995
90
Theory of Computational Complexity.
- Du, Ko - 2000
79
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation," arXiv:quant-ph/0405098
- Aharonov, Dam, et al. - 2006
77
An Introduction to Quantum Computing.
- Kaye, Laflamme, et al. - 2007
77
The complexity of the local Hamiltonian problem
- Kempe, Kitaev, et al. - 2004
77
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems.
- Kitaev, Watrous - 2000
71
Fast parallel circuits for the quantum fourier transform
- Cleve, Watrous - 2000
66
Quantum lower bound for the collision problem
- AARONSON - 2002
60
Parallel computation for well-endowed rings and space-boundedprobabilistic machines
- Borodin, Cook, et al. - 1983
58
Limitations of quantum advice and one-way communication
- Aaronson - 2005
50
Counting complexity
- Fortnow - 1997
46
Quantum multi-prover interactive proof systems with limited prior entanglement.
- KOBAYASHI, MATSUMOTO - 2003
43
The power of quantum systems on a line
- Aharonov, Gottesman, et al.
43
Toward a general theory of quantum games.
- Gutoski, Watrous - 2007
41
Quantum Merlin-Arthur proof systems: Are multiple Merlins more helpful to Arthur? Chicago
- Kobayashi, Matsumoto, et al. - 2009
37
Relationships among PL, #L, and the determinant
- Allender, Ogihara - 1996
34
Comparing entropies in statistical zero knowledge with applications to the structure of SZK
- Goldreich, Vadhan - 1999
31
Consistency of local density matrices is QMA-Complete.
- Liu - 2006
29
Quantum versus classical proofs and advice.
- Aaronson, Kuperberg - 2007
28
Quantum randomness and nondeterminism
- Knill - 1996
27
Perfect parallel repetition theorem for quantum XOR proof systems.
- Cleve, Slofstra, et al. - 2008
26
All languages in np have very short quantum proofs.
- Blier, Tapp - 2009
26
Using entanglement in quantum multi-prover interactive proofs
- Kempe, Kobayashi, et al. - 2009
23
Making games short.
- Feige, Kilian - 1997
19
On the complexity of computing zero-error and Holevo capacity of quantum channels, ArXiv preprint arXiv:0709.2090
- Beigi, Shor - 2007
19
Quantum complexity theory (preliminary abstract
- Bernstein, Vazirani - 1993
19
2005 Bounds on the power of constant-depth quantum circuits
- Fenner, Green, et al. - 2005
18
Strong parallel repetition theorem for quantum XOR proof systems
- Cleve, Slofstra, et al. - 2007
15
The unique games conjecture with entangled provers is false
- Kempe, Regev, et al. - 2007
13
QMA/qpoly is contained in PSPACE/poly: De-Merlinizing quantum protocols
- Aaronson - 2006
9
Quantum expanders and the quantum entropy difference problem,”
- Ben-Aroya, Ta-Shma - 2007
9
Quantum NP. Talk at AQIP ’99
- Kitaev - 1999
7
Non-identity-check” is QMAcomplete
- Janzing, Wocjan, et al. - 2005
6
Quantum NP - A survey. Available at arXiv.org e-Print quantph/0210077v1,
- Aharonov, Naveh - 2002
6
General properties of quantum zero-knowledge proofs
- Kobayashi
5
S.: Small depth quantum circuits
- Bera, Green, et al. - 2007
2
Complexity Theory: A Modern Approach (Preliminary web draft
- Arora, Barak - 2006
2
Quantum communication complexity. Foundations of Physics
- Brassard - 2000
2
Entangled games are hard to approximate. Available as arXiv.org e-Print 0704.2903
- Kempe, Kobayashi, et al. - 2007
1
The power of unentanglement. Available as arXiv.org e-print 0804.0802
- Aaronson, Beigi, et al. - 2008
1
Universal search problems (English translation
- Levin - 1973