Logical structures underlying quantum computing

Federico Holik, Giuseppe Sergioli, Hector Freytes, Angel Plastino

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number77
JournalEntropy
Volume21
Issue number1
DOIs
Publication statusPublished - 2019

Keywords

  • Non-kolmogorovian probability
  • Quantum computational gates
  • Quantum computing

Fingerprint

Dive into the research topics of 'Logical structures underlying quantum computing'. Together they form a unique fingerprint.

Cite this