Stephen Fenner  Home/Search
Context Related
| bu.edu/techreports/98008quant.ps.Z bu.edu/techreports...998008quant.ps.Z 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/Home (more) Homepages: S.Fenner |
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 polynomialtime 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. 1 Introduction This decade has seen renewed interest and great activity in quantum computing. This... (Update)
Context of citations to this paper: More
...the QACC operator is non zero. This is analogous to the de nition of the class NQP in Adleman et al. 10] and discussed in Fenner et al. [11] where it is shown that NQP is classically of high complexity, and in particular is hard for the polynomial time hierarchy. In this way...
...lies in the polynomial time hierarchy. What about quantum variations of NP and interactive proof systems Fenner, Green, Homer and Pruim [FGHP99] consider the class consisting of the languages L such that for some polynomialtime quantum Turing machine, x is in L when M(x)...
Cited by: More
One Complexity Theorist's View of Quantum Computing - Lance Fortnow Nec (2000) (Correct)
Graph Non-Isomorphism Has a Succinct Quantum Certificate - Tatsuaki Okamoto Keisuke (Correct)
Succinct Quantum Proofs for Properties of Finite Groups - Watrous (2000) (Correct)
Similar documents (at the sentence level): More
60.4%: Determining Acceptance Possibility for a Quantum.. - Fenner, Green, Homer.. (1998) (Correct)
58.9%: Quantum NP is Hard for PH - Fenner, Green, al. (1998) (Correct)
50.7%: Determining Acceptance Possibility for a Quantum - Computation Is Hard (2000) (Correct)
Active bibliography (related documents): More All
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)
0.1: On the Power of Deterministic Reductions to .. - Green (1991) (Correct)
Similar documents based on text: More All
1.0: Complements of Multivalued Functions - Frederic Green Clark (Correct)
0.3: The Correlation Between Parity and Quadratic Polynomials - Green (Correct)
0.3: IEEE November 10 - 13, 1999 San Juan, Puerto Rico - Integrating Service Learning (Correct)
Related documents from co-citation: More All
9: Quantum complexity theory - Bernstein, Vazirani - 1993
6: SIAM Journal on Computing (context) - Adleman, Demarrais et al. - 1997
6: A fast quantum mechanical algorithm for database search - Grover - 1996
BibTeX entry: (Update)
S. Fenner, F. Green, S. Homer, and R. Pruim. Determining acceptance possibility for a quantum computation is hard for PH. Technical Report 98-008, Computer Science Department, Boston University, 1998. http://citeseer.ist.psu.edu/article/fenner98determining.html More
@article{ fenner99determining,
author = "Stephen A. Fenner and Frederic Green and Steven Homer and Randall Pruim",
title = "Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
volume = "6",
number = "003",
year = "1999",
url = "citeseer.ist.psu.edu/article/fenner98determining.html" }
Citations (may not include all citations):168 Algorithms for quantum computation: Discrete logarithms and .. - Shor - 1994 DBLP
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 ACM DBLP
90 The complexity of combinatorial problems with succinct input.. (context) - Wagner - 1986 ACM DBLP
85 Quantum circuit complexity - Yao - 1993 DBLP
53 Counting classes are at least as hard as the polynomial-time.. (context) - Toda, Ogiwara - 1992 ACM DBLP
45 Quantum computation - Berthiaume - 1997 ACM
42 The quantum challenge to structural complexity theory - Berthiaume, Brassard - 1992 DBLP
36 Complexity limitations on quantum computation - Fortnow, Rogers - 1997 ACM DBLP
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 ACM DBLP
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 ACM
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://cs-www.bu.edu/techreports/Home.html): More
Value-cognizant Speculative Concurrency Control - Bestavros, Braoudakis (1995) (Correct)
Fixed Point vs. First-Order Logic on Finite Ordered.. - Kfoury, Wymann-Böni (1993) (Correct)
The Undecidability of Mitchell's Subtyping Relationship - Wells (1995) (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