Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantum Turing machines are nothing but special examples of classical probabilistic machines. We introduce the concepts of deterministic state machine, classical probabilistic state machine and quantum state machine. On this basis, we discuss the question: To what extent can quantum state machines be simulated by classical probabilistic state machines? Each state machine is devoted to a single task determined by its program. Real computers, however, behave differently, being able to solve different kinds of problems. This capacity can be modeled, in the quantum case, by the mathematical notion of abstract quantum computing machine, whose different programs determine different quantum state machines. The computations of abstract quantum computing machines can be linguistically described by the formulas of a particular form of quantum logic, termed quantum computational logic.
|Titolo:||Abstract quantum computing machines and quantum computational logics|
|Data di pubblicazione:||2016|
|Tipologia:||1.1 Articolo in rivista|
File in questo prodotto:
|40. Abstract Quantum Computing Machines and QCL.pdf||versione editoriale||Administrator Richiedi una copia|