Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- 343 Downloads
In order to establish the computational equivalence between quantum Turing machines (QTMs) and quantum circuit families (QCFs) using Yao’s quantum circuit simulation of QTMs, we previously introduced the class of uniform QCFs based on an infinite set of elementary gates, which has been shown to be computationally equivalent to the polynomial-time QTMs (with appropriate restriction of amplitudes) up to bounded error simulation. This result implies that the complexity class BQP introduced by Bernstein and Vazirani for QTMs equals its counterpart for uniform QCFs. However, the complexity classes ZQP and EQP for QTMs do not appear to equal their counterparts for uniform QCFs. In this paper, we introduce a subclass of uniform QCFs, the finitely generated uniform QCFs, based on finite number of elementary gates and show that the class of finitely generated uniform QCFs is perfectly equivalent to the class of polynomial-time QTMs; they can exactly simulate each other. This naturally implies that BQP as well as ZQP and EQP equal the corresponding complexity classes of the finitely generated uniform QCFs.
KeywordsQuantum computation Complexity theory Uniform circuit families Turing machines Finitely generated uniform quantum circuit families
M. Ozawa gratefully acknowledges the financial support of the SCOPE project of the MIC, the Grant-in-Aid for Scientific Research (B) 17340021 of the JSPS, and the CREST project of the JST.
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
- 4.Bernstein, E., Vazirani, U.: Quantum complexity theory (preliminary abstract). In: Proceedings of the 25th ACM Symposium on Theory of Computing, pp. 11–20. ACM Press, New York (1993)Google Scholar
- 11.Gruska J.: Quantum Computing. McGraw-Hill, Berkshire (1999)Google Scholar
- 14.Kitaev, A., Watrous, J.: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 608–617. ACM Press, New York (2000)Google Scholar
- 16.Möttönen, M., Vartiainen, J.J.: Decomposition of general quantum gates. Available via http://arxiv.org/quant-ph/0504100
- 25.Shor, P.W.: Fault-tolerant quantum computation. In: Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, pp. 56–65. IEEE Computer Society Press, Los Alamitos, CA (1996)Google Scholar
- 26.Yamakami, T.: A foundation of programming a multi-tape quantum Turing machine. In: Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 1672, pp. 430–441 (1999)Google Scholar
- 27.Yao, A.C.-C.: Quantum circuit complexity. In: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pp. 352–361. IEEE Computer Society Press, Los Alamitos, CA (1993)Google Scholar