Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:14, 30 January 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
