Browsing Computer Science by Author "Fenner, Stephen"

OpenBU

Browsing Computer Science by Author "Fenner, Stephen"

Sort by: Order: Results:

  • Fenner, Stephen; Green, Frederic; Homer, Steven (Boston University Computer Science Department, 1998-04-02)
    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 ...
  • Fenner, Stephen; Green, Frederic; Homer, Steven; Pruim, Randall (Boston University Computer Science Department, 2000-01-20)
    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 ...
  • Bera, Debajyoti; Fenner, Stephen; Green, Frederic; Homer, Steve (Boston University Computer Science Department, 2008-02-15)
    We define and construct efficient depth universal and almost size universal quantum circuits. Such circuits can be viewed as general purpose simulators for central classes of quantum circuits and can be used to capture the ...

Search OpenBU


Advanced Search

Browse

Deposit Materials