Abstract
A uniform mathematical description of quantum automata as quantum finite automata, quantum linear bounded automata, and quantum Turing machines is introduced, and the existence of such automata under certain circumstances is investigated. Such quantum automata are modelled by isometric rather than unitary operators, reflecting the fact that computation is primarily irreversible in contrast to physical phenomena in the microworld. The global conditions determine the local conditions of the operators.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
