Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11128-008-0091-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11128-008-0091-8 / rank | |||
Normal rank | |||
Latest revision as of 12:42, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families |
scientific article |
Statements
Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (English)
0 references
31 March 2009
0 references
Quantum computation
0 references
Complexity theory
0 references
Uniform circuit families
0 references
Turing machines
0 references
Finitely generated uniform quantum circuit families
0 references
0 references
0 references
0 references
