A polynomial-time classical algorithm for noisy random circuit sampling (Q6499276): Difference between revisions

@@ Property / Wikidata QID @@
+Q130921280
@@ Property / Wikidata QID: Q130921280 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3191572
@@ Property / cites work: Q3191572 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5111152
@@ Property / cites work: Q5111152 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5140846
@@ Property / cites work: Q5140846 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Complexity Theory
@@ Property / cites work: Quantum Complexity Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Supremacy and the Complexity of Random Circuit Sampling
+Normal rank
@@ Property / cites work @@
+Random quantum circuits are approximate 2-designs
@@ Property / cites work: Random quantum circuits are approximate 2-designs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3171599
@@ Property / cites work: Q3171599 / rank @@
+Normal rank
@@ Property / cites work @@
+Entanglement and correlation functions of the quantum Motzkin spin-chain
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6499276