Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8729039430618286
0 references
0.8668872714042664
0 references
0.7890600562095642
0 references
0.7557486891746521
0 references
0.7437772750854492
0 references
