Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: quant-ph/0511117 / rank | |||
Normal rank | |||
Revision as of 18:37, 18 April 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
