On the classical hardness of spoofing linear cross-entropy benchmarking (Q5140846)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7286921
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the classical hardness of spoofing linear cross-entropy benchmarking |
scientific article; zbMATH DE number 7286921 |
Statements
17 December 2020
0 references
quantum supremacy
0 references
quantum complexity
0 references
sampling complexity
0 references
0.7791652083396912
0 references
0.742326557636261
0 references
0.7396016716957092
0 references
0.712016761302948
0 references
0.7117060422897339
0 references
