Matchgate and space-bounded quantum computations are equivalent (Q4931028): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q63198946, #quickstatements; #temporary_batch_1711574657256 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0908.1467 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matchgates and classical simulation of quantum circuits / rank | |||
Normal rank | |||
Latest revision as of 06:27, 3 July 2024
scientific article; zbMATH DE number 5794997
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Matchgate and space-bounded quantum computations are equivalent |
scientific article; zbMATH DE number 5794997 |
Statements
Matchgate and space-bounded quantum computations are equivalent (English)
0 references
2 October 2010
0 references
quantum computational complexity
0 references
space-bounded computation
0 references
quantum matchgates
0 references
