S. Fenner, F. Green, et al.  Home/Search
Context Related
| sc.edu/~fenner/papers/nqp.PS clarku.edu/~fgreen/papers/nqp.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: brics.dk/~hoyer/courses/qip98 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we take a further step in this direction by proving that testing for non-zero acceptance probability of a quantum machine is classically an extremely hard problem. In fact, we prove that this problem -- which we call QAP ("quantum acceptance possibility") and which is complete for NQP (Update)
Context of citations to this paper: More
...of the observed state after applying the QACC operator is non zero. This is analogous to the definition of the class NQP in Fenner et al. [5]. In this paper, we show that NQACC log gates is in TC (0) and NQACC log pl is in P poly. Although the proof uses some of the techniques...
...of the observed state after applying the QACC operator is non zero. This is analogous to the definition of the class NQP in Fenner et al. [5]. In this paper, we show that NQACC is in TC (0) Although the proof uses some of the techniques developed by Yamakami and Yao [14] to...
Cited by: More
Determining Acceptance Possibility for a Quantum - Hard (2000) (Correct)
On the Complexity of Quantum ACC - Frederic Green Steven (2000) (Correct)
Similar documents (at the sentence level):
49.6%: Determining Acceptance Possibility for a Quantum Computation is.. - Fenner (1998) (Correct)
Active bibliography (related documents): More All
0.5: Determining Acceptance Possibility for a Quantum.. - Fenner, Green, Homer.. (1998) (Correct)
0.2: Counting, Fanout, And The Complexity Of Quantum Acc - Green, al. (2002) (Correct)
0.1: Unambiguous Computations and Locally Definable Acceptance.. - Niedermeier, Rossmanith (Correct)
Similar documents based on text: More All
0.8: Complements of Multivalued Functions - Frederic Green Clark (Correct)
0.6: Hyper-Polynomial Hierarchies and the NP-Jump - Fenner, Homer, Pruim, Schaefer (Correct)
0.5: Relativized Separation of EQP from P^NP - Green, Pruim (Correct)
Related documents from co-citation: More All
7: Complexity limitations on quantum computation - Fortnow, Rogers - 1997
7: Polynomial-time algorithms for prime number factorization and discrete logarithm.. (context) - Shor - 1997
5: Quantum circuit complexity - Yao - 1993
BibTeX entry: (Update)
S. Fenner, F. Green, S. Homer and R. Pruim. Quantum NP is Hard for PH. In Proceedings of the Sixth Italian Conference on Theoretical Computer Science, World-Scientific, pages 241 - 252, 1998. http://citeseer.ist.psu.edu/fenner98quantum.html More
@misc{ fenner98quantum,
author = "S. Fenner and F. Green and S. Homer and R. Pruim",
title = "Quantum NP is Hard for PH",
text = "S. Fenner, F. Green, S. Homer and R. Pruim. Quantum NP is Hard for PH.
In Proceedings of the Sixth Italian Conference on Theoretical Computer Science,
World-Scientific, pages 241 - 252, 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/fenner98quantum.html" }
Citations (may not include all citations):168 Algorithms for quantum computation: Discrete logarithms and .. - Shor - 1994
144 the power of quantum computation - Simon - 1994
126 Rapid solutions of problems by quantum computation (context) - Deutsch, Jozsa - 1992
126 PP is as hard as the polynomial-time hierarchy (context) - Toda - 1991
90 The complexity of combinatorial problems with succinct input.. (context) - Wagner - 1986
85 Quantum circuit complexity - Yao - 1993
53 Counting classes are at least as hard as the polynomial-time.. (context) - Toda, Ogiwara - 1992
45 Quantum computation - Berthiaume - 1997
42 The quantum challenge to structural complexity theory - Berthiaume, Brassard - 1992
37 Complexity classes defined by counting quantifiers - Tor'an - 1991
36 Complexity limitations on quantum computation - Fortnow, Rogers - 1997
34 Quantum mechanical hamiltonian models of turing machines (context) - Benioff - 1982
20 SIAM Journal on Computing (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) - Bennet, Bernstein et al.
13 Theoretical Computer Science (context) - Tarui, AC et al. - 1993
9 and the universal quantum computer (context) - Deutsch, the - 1985
6 Compact descriptions and the counting polynomial time hierar.. (context) - Wagner - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/~hoyer/courses/qip98.html):
On the Power of Quantum Computation - Vazirani (1998) (Correct)
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