Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.3390/e21010077 | ENTROPY |
Keywords | Field | DocType |
quantum computing,non-kolmogorovian probability,quantum computational gates | Quantum,Mathematical optimization,Algebraic number,Algebra,Quantum computer,Quantum algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
21 | 1 | 1099-4300 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| federico holik | 1 | 12 | 6.14 |
| Giuseppe Sergioli | 2 | 23 | 11.03 |
| Hector Freytes | 3 | 22 | 9.37 |
| Angelo Plastino | 4 | 18 | 10.20 |