The formal model of quantum circuits is generalized to a model in which the state can be a general quantum state and the gates can be general quantum operations. The new model is shown to be equivalent in computational power to standard models. The main result is a solution for the subroutine problem. A natural notion of using subroutines is defined, and the failure of the general subroutines to strengthen the models is shown.
|Number of pages
|Conference Proceedings of the Annual ACM Symposium on Theory of Computing
|Published - 1998
|Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing - Dallas, TX, USA
Duration: 23 May 1998 → 26 May 1998