Translator Disclaimer
30 March 2010 Quantum state transition diagram: a bridge from classical computing to quantum computing
Author Affiliations +
Abstract
Very few papers have been written on the topic of a quantum version of the finite state machine, (or finite state automata). Furthermore, these papers only serve to define what a quantum finite state machine might be in the mathematical sense using the early languages of Turing machines. This paper seeks to further develop the notion of a quantum finite state machine (FSM) using constructs developed for the classical FSM and utilized for classical FSM design. In particular the quantum state transition diagram (QSTD) is constructed to further the understanding and realization of quantum finite state machines and quantum computers.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Loyd R. Hook IV and Samuel C. Lee "Quantum state transition diagram: a bridge from classical computing to quantum computing", Proc. SPIE 7646, Nanosensors, Biosensors, and Info-Tech Sensors and Systems 2010, 76460R (30 March 2010); doi: 10.1117/12.847450; https://doi.org/10.1117/12.847450
PROCEEDINGS
5 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Quantum computation
Proceedings of SPIE (August 31 1996)
Simulation of applications in quantum computing
Proceedings of SPIE (October 18 2004)
Qubit decoherence
Proceedings of SPIE (June 30 1997)
Separable states and separability criteria
Proceedings of SPIE (August 03 2003)

Back to Top