Frederic Green, et al.  Home/Search
Context Related
| santafe.edu/pub/moore/homer.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: santafe.edu/~moore/pubs/homer (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: q are distinct primes, QACC[q] is strictly more powerful than its classical counterpart, as is QAC 0 when fanout is allowed. This adds to the growing list of quantum complexity classes which are provably more powerful than their classical counterparts. We also develop techniques for proving upper bounds for QACC in terms of related language classes. We de ne classes of languages closely related to QACC[2] and show that restricted versions of them can be simulated by polynomialsize... (Update)
Cited by: More
Quantum Lower Bounds for Fanout - Fang, Fenner, Green, Homer, Zhang (2003) (Correct)
Similar documents (at the sentence level):
9.0%: On the Complexity of Quantum ACC - Green, Homer, Pollett (2000) (Correct)
7.7%: Quantum Circuits: Fanout, Parity, and Counting - Moore (Correct)
Active bibliography (related documents): More All
0.3: Subtree-Counting Loops - Lemieux, Moore, Thérien (Correct)
0.3: Polyabelian loops and Boolean completeness - Lemieux, Moore, Thérien (Correct)
0.3: Quantum Information Processing: Compression, Coding, and Related.. - Reif (1985) (Correct)
Similar documents based on text: More All
0.3: Algebraic Methods for Proving Lower Bounds in Circuit Complexity - Allender (Correct)
0.2: Polynomial Programs and the Razborov-Smolensky Method - Chen (2001) (Correct)
0.1: BOOK REVIEW on A New Kind of Science by Stephen Wolfram Wolfram - Aaronson (2001) (Correct)
Related documents from co-citation: More All
2: Algebraic methods in the theory of lower bounds for Boolean circuit complexity (context) - Smolensky - 1987
2: American Mathematical Society (context) - Shashkin, volume et al. - 1991
2: Polynomial-time algorithms for prime number factorization and discrete logarithm.. (context) - Shor - 1997
BibTeX entry: (Update)
F. Green, S. Homer, C. Moore and C. Pollett, "Counting, Fanout and the Complexity of Quantum ACC," Quantum Information and Computation # (2002) 35-65. http://citeseer.ist.psu.edu/green02counting.html More
@misc{ green02counting,
author = "F. Green and S. Homer and C. Moore and C. Pollett",
title = "Counting, Fanout and the Complexity of Quantum ACC",
text = "F. Green, S. Homer, C. Moore and C. Pollett, Counting, Fanout and the Complexity
of Quantum ACC, Quantum Information and Computation # (2002) 35-65.",
year = "2002",
url = "citeseer.ist.psu.edu/green02counting.html" }
Citations (may not include all citations):210 A fast quantum mechanical algorithm for database search - Grover - 1996
173 Quantum complexity theory - Bernstein, Vazirani - 1997
144 the power of quantum computation - Simon - 1997
126 Rapid solutions of problems by quantum computation (context) - Deutsch, Jozsa - 1992
114 Bounded-width polynomial-size branching programs recognize e.. (context) - Barrington - 1989
92 Constant depth reducibility (context) - Chandra, Stockmeyer et al. - 1984
36 Oracle quantum computing - Berthiaume, Brassard - 1994
28 Introduction to Circuit Complexity (context) - Vollmer - 1999
15 Quantum computability (context) - Adleman, DeMarrais et al. - 1997
14 Polynomial-time algorithms for prime number factorization an.. (context) - Shor - 1997
13 Strengths and weaknesses of quantum computation (context) - Bennett, Bernstein et al. - 1997
9 and the universal quantum computer (context) - Deutsch, the - 1985
9 Determining acceptance possibility for a quantum computation.. - Fenner, Green et al. - 1999
6 th IEEE Symposium on Foundations of Computer Science (context) - Yao, complexity - 1993
6 Circuits and Expressions with Non-Associative Gates - Moore, Th et al. - 2000
5 Finite monoids and the ne structure of NC (context) - Barrington, Th
4 The quantum challenge to structural complexity (context) - Berthiaume, Brassard - 1992
2 Symposium on Theoretical Aspects of Computer Science (context) - Beaudry, McKenzie et al. - 1993
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC