The quantum computation process may be summarized as follows: rst an initial state of a physical system is provided as the input. Then, it evolves according to the elementary operations (quantum gates) that are performed on it. Finally, the access to the information content of the resulting state is possible via the measurement operation that provides one of the possible results. In this note we describe probabilistictype semantics for propositional logics designed to describe eective procedure based on measurement processes.
Probabilistic logics in quantum computation
FREYTES, HECTOR CARLOS;LEDDA, ANTONIO;SERGIOLI, GIUSEPPE;GIUNTINI, ROBERTO
2013-01-01
Abstract
The quantum computation process may be summarized as follows: rst an initial state of a physical system is provided as the input. Then, it evolves according to the elementary operations (quantum gates) that are performed on it. Finally, the access to the information content of the resulting state is possible via the measurement operation that provides one of the possible results. In this note we describe probabilistictype semantics for propositional logics designed to describe eective procedure based on measurement processes.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
probabilistic logics.pdf
Solo gestori archivio
Descrizione: Capitolo
Tipologia:
versione pre-print
Dimensione
119.91 kB
Formato
Adobe PDF
|
119.91 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
