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.
This work is partly supported by NSERC Postdoctoral Fellowship and DIMACS Fellowship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strength and weakness of quantum computing, SIAM J. Comput, 26 (1997), 1510–1523.
E. Bernstein and U. Vazirani, Quantum complexity theory, SIAM J. Comput., 26 (1997), 1411–1473.
A. C. Yao, Quantum circuit complexity, Proc. 34th IEEE Symposium on Foundation of Computer Science, pp.352–361, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamakami, T. (1999). A Foundation of Programming a Multi-tape Quantum Turing Machine. In: Kutyłowski, M., Pacholski, L., Wierzbicki, T. (eds) Mathematical Foundations of Computer Science 1999. MFCS 1999. Lecture Notes in Computer Science, vol 1672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48340-3_39
Download citation
DOI: https://doi.org/10.1007/3-540-48340-3_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66408-6
Online ISBN: 978-3-540-48340-3
eBook Packages: Springer Book Archive