Computation is Hard for PH Stephen Fenner University of Southern Maine...  Home/Search
Context
Related
| bu.edu/techreports...1998008quant.pdf Cached: 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.
PS.gz PS Image Update HelpFrom: 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 nonzero probability of accepting is at least as hard as the polynomial time hierarchy. (Update)
Similar documents (at the sentence level): More
51.9%: Determining Acceptance Possibility for a Quantum.. - Fenner, Green, Homer.. (1998) (Correct)
51.1%: Determining Acceptance Possibility for a Quantum - Computation Is Hard (2000) (Correct)
50.3%: Quantum NP is Hard for PH - Fenner, Green, al. (1998) (Correct)
Active bibliography (related documents): More All
0.6: Determining Acceptance Possibility for a Quantum Computation is.. - Fenner (1998) (Correct)
0.2: Counting, Fanout, And The Complexity Of Quantum Acc - Green, al. (2002) (Correct)
0.1: Extended Locally Definable Acceptance Types (Extend Abstract) - Niedermeier, Rossmanith (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.6: Complements of Multivalued Functions - Fenner, Green, Homer, Selman.. (1996) (Correct)
0.4: Hyper-Polynomial Hierarchies and the NP-Jump - Fenner, Homer, Pruim, Schaefer (Correct)
BibTeX entry: (Update)
@misc{ hard-determining,
author = "Computation Is Hard",
title = "Determining Acceptance Possibility for a Quantum",
url = "citeseer.ist.psu.edu/709625.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
86 Gap-definable counting classes - Fenner, Fortnow et al. - 1991
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
36 Complexity limitations on quantum computation - Fortnow, Rogers - 1997
34 Quantum mechanical hamiltonian models of turing machines (context) - Benioff - 1982
17 Quantum theory (context) - Deutsch - 1985
15 Quantum computability (context) - Adelman, 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
6 Compact descriptions and the counting polynomial time hierar.. (context) - Wagner - 1986
2 The complexityofcombinatorial problems with succinct input r.. (context) - Wagner - 1986
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