Classical simulability, entanglement breaking, and quantum computation thresholds (Q3102424): Difference between revisions

@@ Property / author @@
-Martin B. Plenio
@@ Property / author: Martin B. Plenio / rank @@
-Normal rank
@@ Property / author @@
+Martin B. Plenio
@@ Property / author: Martin B. Plenio / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+quant-ph/0408076
@@ Property / arXiv ID: quant-ph/0408076 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Circuits That Can Be Simulated Classically in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Linear transformations which preserve trace and positive semidefiniteness of operators
+Normal rank
@@ Property / cites work @@
+Quantum coding theorems
@@ Property / cites work: Quantum coding theorems / rank @@
+Normal rank
@@ Property / cites work @@
+QUANTUM COMPUTATION BY MEASUREMENTS
@@ Property / cites work: QUANTUM COMPUTATION BY MEASUREMENTS / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum computation by measurement and quantum memory
+Normal rank
@@ Property / OpenAlex ID @@
+W2090829264
@@ Property / OpenAlex ID: W2090829264 / rank @@
+Normal rank