Browsing CAS: Computer Science: Technical Reports by Author "Zhang, Y."

OpenBU

Browsing CAS: Computer Science: Technical Reports by Author "Zhang, Y."

Sort by: Order: Results:

  • Fenner, S.; Green, F.; Homer, S.; Zhang, Y. (Boston University Computer Science Department, 2004-01-12)
    We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply ...
  • Fang, M.; Fenner, S.; Green, F.; Homer, S.; Zhang, Y. (Boston University Computer Science Department, 2004-01-12)
    We prove several new lower bounds for constant depth quantum circuits. The main result is that parity (and hence fanout) requires log depth circuits, when the circuits are composed of single qubit and arbitrary size Toffoli ...

Search OpenBU


Advanced Search

Browse

Deposit Materials