A polynomial-time classical algorithm for noisy random circuit sampling (Q6499276): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q130921280, #quickstatements; #temporary_batch_1731347681068 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130921280 / rank | |||
Normal rank | |||
Latest revision as of 18:56, 11 November 2024
scientific article; zbMATH DE number 7844643
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time classical algorithm for noisy random circuit sampling |
scientific article; zbMATH DE number 7844643 |
Statements
A polynomial-time classical algorithm for noisy random circuit sampling (English)
0 references
8 May 2024
0 references
quantum supremacy
0 references
random circuit sampling
0 references
