Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy (Q4946417)
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: Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy |
scientific article; zbMATH DE number 1421432
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy |
scientific article; zbMATH DE number 1421432 |
Statements
Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy (English)
0 references
22 March 2000
0 references
quantum computation
0 references
polynomial-time hierarchy
0 references
