A Foundation of Programming a Multi-Tape Quantum Turing machine

Abstract

The notion of quantum Turing machines is a basis of quantum complexity theory. We discuss a general model of multi-tape, multi-head Quantum Turing machines with multi final states that also allow tape heads to stay still.

A twelve page version is to appear in the Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science in September, 1999. LNCS

Cited by in corpus (4)

• A Schematic Definition of Quantum Polynomial Time Computability
• Quantum List Decoding of Classical Block Codes of Polynomially Small Rate from Quantumly Corrupted Codewords
• Computational Complexity Measures of Multipartite Quantum Entanglement
• Quantum Optimization Problems