pith. sign in

arxiv: quant-ph/0407008 · v3 · pith:I467QLIYnew · submitted 2004-07-01 · 🪐 quant-ph · cs.CC

Classically-Controlled Quantum Computation

classification 🪐 quant-ph cs.CC
keywords quantumclassicalcqtmclassically-controlledcomputationcomputationscontrolmachine
0
0 comments X
read the original abstract

Quantum computations usually take place under the control of the classical world. We introduce a Classically-controlled Quantum Turing Machine (CQTM) which is a Turing Machine (TM) with a quantum tape for acting on quantum data, and a classical transition function for a formalized classical control. In CQTM, unitary transformations and measurements are allowed. We show that any classical TM is simulated by a CQTM without loss of efficiency. The gap between classical and quantum computations, already pointed out in the framework of measurement-based quantum computation is confirmed. To appreciate the similarity of programming classical TM and CQTM, examples are given.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.