Classically-controlled Quantum Computation

It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-controlled Quantum Turing Machine (CQTM) which is a Turing machine with a quantum tape for acting on quantum data, and a classical transition function for a formalized classical control. In CQTM, unitary transformations and quantum measurements are allowed. We show that any classical Turing machine is simulated by a CQTM without loss of efficiency. Furthermore, we show that any k-tape CQTM is simulated by a 2-tape CQTM with a quadratic loss of efficiency. The gap between classical and quantum computations which was already pointed out in the framework of measurement-based quantum computation (see [S. Perdrix, Ph. Jorrand, Measurement-Based Quantum Turing Machines and their Universality, arXiv, quant-ph/0404146, 2004]) is confirmed in the general case of classically-controlled quantum computation. In order to appreciate the similarity between programming classical Turing machines and programming CQTM, some examples of CQTM will be given in the full version of the paper. Proofs of lemmas and theorems are omitted in this extended abstract.

[1]  H. Briegel,et al.  Measurement-based quantum computation on cluster states , 2003, quant-ph/0301052.

[2]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[3]  Masanori Ohya,et al.  On Halting Process of Quantum Turing Machine , 2005, Open Syst. Inf. Dyn..

[4]  Elham Kashefi,et al.  The measurement calculus , 2004, JACM.

[5]  Simon Perdrix.  STATE TRANSFER INSTEAD OF TELEPORTATION IN MEASUREMENT-BASED QUANTUM COMPUTATION , 2005 .

[6]  Masanori Ohya,et al.  Generalized Quantum Turing Machine and its Application to the SAT Chaos Algorithm , 2004 .

[7]  John Watrous,et al.  Succinct quantum proofs for properties of finite groups , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[8]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and EPR channels , 1993 .

[9]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

[10]  Michael A. Nielsen,et al.  Quantum computation by measurement and quantum memory , 2003 .

[11]  Debbie W. Leung,et al.  Quantum computation by measurements , 2003 .

[12]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[13]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[14]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[15]  Jr.,et al.  Multivalued logic gates for quantum computation , 2000, quant-ph/0002033.

[16]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.

[17]  P. Jorrand,et al.  Measurement-Based Quantum Turing Machines and their Universality , 2004, quant-ph/0404146.

[18]  Luciano Serafini,et al.  Toward an architecture for quantum programming , 2001, ArXiv.

[19]  Peter Selinger,et al.  Towards a quantum programming language , 2004, Mathematical Structures in Computer Science.

[20]  Philippe Jorrand,et al.  Toward a quantum process algebra , 2004, CF '04.

[21]  Benoît Valiron,et al.  A lambda calculus for quantum computation with classical control , 2006, Math. Struct. Comput. Sci..