Computation is Hard for the Polynomial Hierarchy Stephen Fenner University...  Home/Search
Context
Related
| bu.edu/techreports...000002quant1.pdf 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: bu.edu/techreports/pdf/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum basis state appears with nonzero amplitude in a superposition, or whether a given quantum bit has positive expectation value at the end of a quantum computation. This result is achieved by showing that the complexity class NQP of Adleman, Demarrais, and Huang... (Update)
Similar documents (at the sentence level):
50.7%: Quantum NP is Hard for PH - Fenner, Green, al. (1998) (Correct)
31.9%: Determining Acceptance Possibility for a Quantum - Computation Is Hard (1998) (Correct)
31.4%: Determining Acceptance Possibility for a Quantum Computation is.. - Fenner (1998) (Correct)
Active bibliography (related documents): More All
1.2: 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.2: A Short History of Computational Complexity - Fortnow, Homer (2002) (Correct)
BibTeX entry: (Update)
@misc{ hard-determining,
author = "Computation Is Hard",
title = "Determining Acceptance Possibility for a Quantum",
url = "citeseer.ist.psu.edu/713923.html" }
Citations (may not include all citations):173 Quantum Complexity Theory - Bernstein, Vazirani - 1997
168 Algorithms for quantum computation: Discrete logarithms and .. - Shor - 1994
144 the power of quantum computation - Simon - 1997
126 PP is as hard as the polynomial-time hierarchy (context) - Toda - 1991
126 Rapid solutions of problems by quantum computation (context) - Deutsch, Jozsa - 1992
86 Gap-definable counting classes - Fenner, Fortnow et al. - 1994
53 Counting classes are at least as hard as the polynomial-time.. (context) - Toda, Ogiwara - 1992
45 Quantum computation - Berthiaume - 1997
44 The Graph Isomorphism Problem: Its Structural Complexity (context) - Kobler, Schoning et al. - 1993
42 The quantum challenge to structural complexity theory - Berthiaume, Brassard - 1992
36 Complexity limitations on quantum computation - Fortnow, Rogers - 1998
34 Quantum mechanical hamiltonian models of turing machines (context) - Benioff - 1982
24 volume 11 of EATCS Monographs on Theoretical Computer Scienc.. (context) - Balc'azar, 'iaz et al. - 1988
20 SIAM Journal on Computing (context) - Adleman, DeMarrais et al. - 1997
18 Counting Complexity - Fortnow - 1997
14 Polynomial-time algorithms for prime number factorization an.. (context) - Shor - 1997
13 Theoretical Computer Science (context) - Tarui, AC et al. - 1993
13 Strengths and weaknesses of quantum computation (context) - Bennett, Bernstein et al. - 1997
12 Complexity classes defined bycounting quantifiers (context) - Tor'an - 1991
9 The Power of Counting (context) - Schoning - 1990
9 and the universal quantum computer (context) - Deutsch, the - 1985
7 Quantum NP is Hard for PH - Fenner, Green et al. - 1998
3 Private communication (context) - Watrous - 1997
2 The complexityofcombinatorial problems with succinct input r.. (context) - Wagner - 1986
2 Los Alamos Archive for Quantum Physics (context) - Yamakami, Yao et al.
1 InProceedings of the 34th IEEE SymposiumonFoundations of Com.. (context) - Yao, complexity - 1993
Documents on the same site (http://www.cs.bu.edu/techreports/pdf/): More
Robust Tracking of Human Motion - Buzan (2004) (Correct)
Segmenting Foreground Objects from a Dynamic Textured.. - Zhong, Sclaroff (2003) (Correct)
dPAM: A Distributed Prefetching Protocol for Scalable.. - Sharma, Bestavros, Matta (2004) (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