A Note on Bulk Quantum Turing Machine

Simple item page
dc.creatorMatsui, Tetsushi
dc.date2004-11-12
dc.date2004-11-13
dc.date.accessioned2026-07-07T03:21:59Z
dc.date.available2026-07-07T03:21:59Z
dc.descriptionRecently, among experiments for realization of quantum computers, NMR quantum computers have achieved the most impressive succession. There is a model of the NMR quantum computation,namely Atsumi and Nishino's bulk quantum Turing Machine. It assumes, however, an unnatural assumption with quantum mechanics. We, then, define a more natural and quantum mechanically realizable modified bulk quantum Turing Machine, and show its computational ability by comparing complexity classes with quantum Turing Machine's counter part.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/cs/0411037
dc.identifierhttp://arxiv.org/abs/cs/0411037
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32424
dc.subjectComputational Complexity
dc.titleA Note on Bulk Quantum Turing Machine
dc.typetext

Files

Collections

arXiv