Logical structures underlying quantum computing

Federico Holik; Giuseppe Sergioli; Hector Freytes; Angel Plastino

doi:10.3390/e21010077

Logical structures underlying quantum computing

Federico Holik, Giuseppe Sergioli, Hector Freytes, Angel Plastino

Research output: Contribution to journal › Article › peer-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 language	English
Article number	77
Journal	Entropy
Volume	21
Issue number	1
DOIs	https://doi.org/10.3390/e21010077
Publication status	Published - 2019

Keywords

Non-kolmogorovian probability
Quantum computational gates
Quantum computing

Access to Document

10.3390/e21010077

Cite this

@article{18750e3970f0408e909e8bbd30a5acad,

title = "Logical structures underlying quantum computing",

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.",

keywords = "Non-kolmogorovian probability, Quantum computational gates, Quantum computing",

author = "Federico Holik and Giuseppe Sergioli and Hector Freytes and Angel Plastino",

year = "2019",

doi = "10.3390/e21010077",

language = "English",

volume = "21",

journal = "Entropy",

issn = "1099-4300",

publisher = "MDPI AG",

number = "1",

}

TY - JOUR

T1 - Logical structures underlying quantum computing

AU - Holik, Federico

AU - Sergioli, Giuseppe

AU - Freytes, Hector

AU - Plastino, Angel

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - Non-kolmogorovian probability

KW - Quantum computational gates

KW - Quantum computing

UR - http://www.scopus.com/inward/record.url?scp=85060396674&partnerID=8YFLogxK

U2 - 10.3390/e21010077

DO - 10.3390/e21010077

M3 - Article

VL - 21

JO - Entropy

JF - Entropy

SN - 1099-4300

IS - 1

M1 - 77

ER -

Logical structures underlying quantum computing

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this