JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    •   OpenBU
    • College of Arts and Sciences
    • Computer Science
    • CAS: Computer Science: Technical Reports
    • View Item
    •   OpenBU
    • College of Arts and Sciences
    • Computer Science
    • CAS: Computer Science: Technical Reports
    • View Item

    Determining Acceptance Possibility for a Quantum Computation is Hard for PH

    Thumbnail
    Download/View
    1998-008-quant.pdf (158.8Kb)
    Date Issued
    1998-04-02
    Author
    Fenner, Stephen
    Green, Frederic
    Homer, Steven
    Share to FacebookShare to TwitterShare by Email
    Export Citation
    Download to BibTex
    Download to EndNote/RefMan (RIS)
    Metadata
    Show full item record
    Permanent Link
    https://hdl.handle.net/2144/1765
    Citation
    Fenner, Stephen; Green, Frederic; Homer, Steven; Pruim, Randall. "Determining Acceptance Possibility for a Quantum Computation is Hard for PH", Technical Report BUCS-1998-008, Computer Science Department, Boston University, April 2, 1998. [Available from: http://hdl.handle.net/2144/1765]
    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.
    Collections
    • CAS: Computer Science: Technical Reports [584]

    Contact Us | Send Feedback | Help
     

     

    Browse

    All of OpenBUCommunities & CollectionsIssue DateAuthorsTitlesSubjectsThis CollectionIssue DateAuthorsTitlesSubjects

    Deposit Materials

    LoginNon-BU Registration

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Contact Us | Send Feedback | Help