Logical structures underlying quantum computing
In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2019 |
| País: | Argentina |
| Institución: | Universidad Nacional de La Plata |
| Repositorio: | SEDICI (UNLP) |
| Idioma: | inglés |
| OAI Identifier: | oai:sedici.unlp.edu.ar:10915/123868 |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/123868 |
| Access Level: | acceso abierto |
| Palabra clave: | Ciencias Exactas Física non-kolmogorovian probability quantum computational gates quantum computing |
| Sumario: | In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures. |
|---|