@MISC{Yao93quantumcircuit, author = {Andrew Chi-chih Yao}, title = {Quantum Circuit Complexity}, year = {1993} }

Years of Citing Articles

Bookmark

OpenURL

Abstract

We study a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomial-size quantum circuit. This result also enables us to construct a universal quantum computer which can simulate, with a polynomial factor slowdown, a broader class of quantum machines than that considered by Bernstein and Vazirani [BV93], thus answering an open question raised in [BV93]. We also develop a theory of quantum communication complexity, and use it as a tool to prove that the majority function does not have a linear-size quantum formula. Keywords. Boolean circuit complexity, communication complexity, quantum communication complexity, quantum computation AMS subject classifications. 68Q05, 68Q15 1 This research was supported in part by the National Science Foundation under grant CCR-9301430. 1 Introduction One of the most intriguing questions in computation theroy ...