The power of qutrit logic for quantum computation (Q379272): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3998482 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: History and generality of the CS decomposition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quantum switching and quantum merge sorting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Enhanced Universal N x N Fully Nonblocking Quantum Switch / rank | |||
Normal rank |
Revision as of 00:18, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The power of qutrit logic for quantum computation |
scientific article |
Statements
The power of qutrit logic for quantum computation (English)
0 references
11 November 2013
0 references
qutrit logic
0 references
quantum computation
0 references
qutrit swapping
0 references
0 references