Computer Science – Computational Complexity
Scientific paper
2004-11-12
Computer Science
Computational Complexity
8 pages
Scientific paper
Recently, 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.
No associations
LandOfFree
A Note on Bulk Quantum Turing Machine does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Note on Bulk Quantum Turing Machine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Bulk Quantum Turing Machine will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-87314